Sciweavers

15 search results - page 2 / 3
» Faster top-k document retrieval using block-max indexes
Sort
View
SIGMOD
2001
ACM
213views Database» more  SIGMOD 2001»
14 years 6 months ago
Bit-Sliced Index Arithmetic
The bit-sliced index (BSI) was originally defined in [ONQ97]. The current paper introduces the concept of BSI arithmetic. For any two BSI's X and Y on a table T, we show how ...
Denis Rinfret, Patrick E. O'Neil, Elizabeth J. O'N...
FOCS
2009
IEEE
13 years 9 months ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
CIKM
2005
Springer
13 years 7 months ago
Fast on-line index construction by geometric partitioning
Inverted index structures are the mainstay of modern text retrieval systems. They can be constructed quickly using off-line mergebased methods, and provide efficient support for ...
Nicholas Lester, Alistair Moffat, Justin Zobel
HIKM
2006
ACM
13 years 11 months ago
Automatic document indexing in large medical collections
Term extraction relates to extracting the most characteristic or important terms (words or phrases) in a document. This information is commonly used for improving the accuracy of ...
Angelos Hliaoutakis, Kalliopi Zervanou, Euripides ...
WEBI
2010
Springer
13 years 3 months ago
On Using Query Logs for Static Index Pruning
Static index pruning techniques aim at removing from the posting lists of an inverted file the references to documents which are likely to be not relevant for answering user querie...
Hoang Thanh Lam, Raffaele Perego, Fabrizio Silvest...