139 search results - page 4 / 28 » Compression of inverted indexes for fast query evaluation |
192
click to vote
CIKM
2005
Springer
15 years 6 months ago
2005
Springer
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 ...
114
click to vote
CIKM
2007
Springer
15 years 10 months ago
2007
Springer
Compression of term frequency lists and very long document-id lists within an inverted file search engine are examined. Several compression schemes are compared including Elias γ...
137
click to vote
WIDM
2004
ACM
15 years 9 months ago
2004
ACM
In this paper, we propose a novel compact tree (Ctree) for XML indexing, which provides not only concise path summaries at the group level but also detailed child-parent links at ...
268
click to vote
SIGIR
2011
ACM
14 years 7 months ago
2011
ACM
Large search engines process thousands of queries per second over billions of documents, making query processing a major performance bottleneck. An important class of optimization...
149
click to vote
SIGIR
2006
ACM
15 years 10 months ago
2006
ACM
We consider the following full-text search autocompletion feature. Imagine a user of a search engine typing a query. Then with every letter being typed, we would like an instant d...