Sciweavers

709 search results - page 103 / 142
» Efficient Evaluation of All-Nearest-Neighbor Queries
Sort
View
WWW
2005
ACM
16 years 6 months ago
Sampling search-engine results
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
Aris Anagnostopoulos, Andrei Z. Broder, David Carm...
PVLDB
2008
116views more  PVLDB 2008»
15 years 5 months ago
Tighter estimation using bottom k sketches
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
Edith Cohen, Haim Kaplan
ECOI
2011
240views ECommerce» more  ECOI 2011»
15 years 10 days ago
HerbariaViz: A web-based client-server interface for mapping and exploring flora observation data
The potential for physical flora collections to support scientific research is being enhanced by rapid development of digital databases that represent characteristics of the physic...
Tom Auer, Alan M. MacEachren, Craig McCabe, Scott ...
ICDE
2010
IEEE
219views Database» more  ICDE 2010»
16 years 5 months ago
PIP: A Database System for Great and Small Expectations
Estimation via sampling out of highly selective join queries is well known to be problematic, most notably in online aggregation. Without goal-directed sampling strategies, samples...
Oliver Kennedy, Christoph Koch
CORR
2010
Springer
160views Education» more  CORR 2010»
15 years 6 months ago
Scalable Probabilistic Databases with Factor Graphs and MCMC
Incorporating probabilities into the semantics of incomplete databases has posed many challenges, forcing systems to sacrifice modeling power, scalability, or treatment of relatio...
Michael L. Wick, Andrew McCallum, Gerome Miklau