Sciweavers

145 search results - page 4 / 29
» On Using Query Logs for Static Index Pruning
Sort
View
CIKM
2004
Springer
14 years 1 months ago
Using a compact tree to index and query XML data
Indexing XML is crucial for efficient XML query processing. We propose a compact tree (Ctree) for XML indexing, which provides not only concise path summaries at group level but a...
Qinghua Zou, Shaorong Liu, Wesley W. Chu
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
14 years 9 months ago
Efficient Evaluation of All-Nearest-Neighbor Queries
The All Nearest Neighbor (ANN) operation is a commonly used primitive for analyzing large multi-dimensional datasets. Since computing ANN is very expensive, in previous works R*-t...
Yun Chen, Jignesh M. Patel
WWW
2005
ACM
14 years 9 months ago
Three-level caching for efficient query processing in large Web search engines
Large web search engines have to answer thousands of queries per second with interactive response times. Due to the sizes of the data sets involved, often in the range of multiple...
Xiaohui Long, Torsten Suel
ICDE
2012
IEEE
239views Database» more  ICDE 2012»
11 years 10 months ago
Provenance-based Indexing Support in Micro-blog Platforms
Abstract— Recently, lots of micro-blog message sharing applications have emerged on the web. Users can publish short messages freely and get notified by the subscriptions instan...
Junjie Yao, Bin Cui, Zijun Xue, Qingyun Liu
CIKM
2005
Springer
14 years 1 months ago
Static score bucketing in inverted indexes
Maintaining strict static score order of inverted lists is a heuristic used by search engines to improve the quality of query results when the entire inverted lists cannot be proc...
Chavdar Botev, Nadav Eiron, Marcus Fontoura, Ning ...