29 search results - page 4 / 6 » Inverted index compression and query processing with optimiz... |
137
click to vote
ICDE
2010
IEEE
16 years 2 months ago
2010
IEEE
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
141
click to vote
SIGIR
2011
ACM
14 years 5 months ago
2011
ACM
Versioned textual collections are collections that retain multiple versions of a document as it evolves over time. Important large-scale examples are Wikipedia and the web collect...
140
Voted
FOCS
2009
IEEE
15 years 6 months ago
2009
IEEE
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...
126
click to vote
SIGIR
2006
ACM
15 years 8 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...
115
click to vote
CN
2010
15 years 2 months ago
2010
Distributed hash tables (DHTs) are very efficient for querying based on key lookups. However, building huge term indexes, as required for IR-style keyword search, poses a scalabil...