Sciweavers

145 search results - page 2 / 29
» On Using Query Logs for Static Index Pruning
Sort
View
AINA
2009
IEEE
13 years 3 months ago
Document-Oriented Pruning of the Inverted Index in Information Retrieval Systems
Searching very large collections can be costly in both computation and storage. To reduce this cost, recent research has focused on reducing the size (pruning) of the inverted ind...
Lei Zheng, Ingemar J. Cox
PODS
2009
ACM
119views Database» more  PODS 2009»
14 years 5 months ago
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
Ke Yi
CIKM
2006
Springer
13 years 9 months ago
A document-centric approach to static index pruning in text retrieval systems
We present a static index pruning method, to be used in ad-hoc document retrieval tasks, that follows a documentcentric approach to decide whether a posting for a given term shoul...
Stefan Büttcher, Charles L. A. Clarke
DEXAW
2005
IEEE
125views Database» more  DEXAW 2005»
13 years 7 months ago
Exploiting Local Popularity to Prune Routing Indices in Peer-to-Peer Systems
Routing in unstructured peer-to-peer systems relies either on broadcasting (also called flooding) or on routing indices. An approach using routing indices is only scalable if the...
Stéphane Bressan, Achmad Nizar Hidayanto, Z...