Sciweavers

950 search results - page 140 / 190
» Evaluation over thousands of queries
Sort
View
SIGMOD
1998
ACM
143views Database» more  SIGMOD 1998»
14 years 1 months ago
Optimal Multi-Step k-Nearest Neighbor Search
For an increasing number of modern database applications, efficient support of similarity search becomes an important task. Along with the complexity of the objects such as images...
Thomas Seidl, Hans-Peter Kriegel
CIKM
2010
Springer
13 years 7 months ago
Web search solved?: all result rankings the same?
The objective of this work is to derive quantitative statements about what fraction of web search queries issued to the state-of-the-art commercial search engines lead to excellen...
Hugo Zaragoza, Berkant Barla Cambazoglu, Ricardo A...
TLSDKCS
2010
13 years 3 months ago
Improving Retrievability and Recall by Automatic Corpus Partitioning
Abstract. With increasing volumes of data, much effort has been devoted to finding the most suitable answer to an information need. However, in many domains, the question whether a...
Shariq Bashir, Andreas Rauber
PVLDB
2008
116views more  PVLDB 2008»
13 years 8 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
BDA
2006
13 years 10 months ago
Type-Based XML Projection
XML data projection (or pruning) is one of the main optimization techniques recently adopted in the context of main-memory XML query-engines. The underlying idea is quite simple: ...
Véronique Benzaken, Giuseppe Castagna, Dari...