activity
19982015
most citedSimrank++: Query rewriting through link analysis of the click graph

46 citations · 86 across the 10 of their papers we have counts for

collaborators

10 papers

cs.DB2015★ 8 cited

SLiMFast: Guaranteed Results for Data Fusion and Source Reliability

Manas Joglekar, Theodoros Rekatsinas, Hector Garcia-Molina +2

We focus on data fusion, i.e., the problem of unifying conflicting data from data sources into a single representation by estimating the source accuracies. We propose SLiMFast, a f…

cs.DB2014★ 1 cited

Interactive Data Exploration with Smart Drill-Down

Manas Joglekar, Hector Garcia-Molina, Aditya Parameswaran

We present {\em smart drill-down}, an operator for interactively exploring a relational table to discover and summarize "interesting" groups of tuples. Each group of tuples is desc…

cs.DB2014

Evaluating the Crowd with Confidence

Manas Joglekar, Hector Garcia-Molina, Aditya Parameswaran

Worker quality control is a crucial aspect of crowdsourcing systems; typically occupying a large fraction of the time and money invested on crowdsourcing. In this work, we devise t…

cs.DB2014★ 1 cited

Comprehensive and Reliable Crowd Assessment Algorithms

Manas Joglekar, Hector Garcia-Molina, Aditya Parameswaran

Evaluating workers is a critical aspect of any crowdsourcing system. In this paper, we devise techniques for evaluating workers by finding confidence intervals on their error rates…

cs.DB2014

Exploiting Correlations for Expensive Predicate Evaluation

Manas Joglekar, Hector Garcia-Molina, Aditya Parameswaran +1

User Defined Function(UDFs) are used increasingly to augment query languages with extra, application dependent functionality. Selection queries involving UDF predicates tend to be…

cs.DB2011★ 16 cited

Human-Assisted Graph Search: It's Okay to Ask Questions

Aditya Parameswaran, Anish Das Sarma, Hector Garcia-Molina +2

We consider the problem of human-assisted graph search: given a directed acyclic graph with some (unknown) target node(s), we consider the problem of finding the target node(s) by…