17 search results - page 2 / 4 » Fast In-Memory XPath Search using Compressed Indexes |
SIGIR
2006
ACM
15 years 3 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...
102
Voted
SIGIR
2011
ACM
14 years 15 days ago
2011
ACM
Inverted indexes are the most fundamental and widely used data structures in information retrieval. For each unique word occurring in a document collection, the inverted index sto...
DBKDA
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract—XML indexing and search has become an important topic, and twig joins are key building blocks in XML search systems. This paper describes a novel approach using a nested...
67
Voted
WWW
2005
ACM
15 years 10 months ago
2005
ACM
The unarguably fast, and continuous, growth of the volume of indexed (and indexable) documents on the Web poses a great challenge for search engines. This is true regarding not on...
ALENEX
2007
14 years 11 months ago
2007
Inverted index data structures are the key to fast search engines. The predominant operation on inverted indices asks for intersecting two sorted lists of document IDs which might...