69 search results - page 13 / 14 » Compressed Inverted Indexes for In-Memory Search Engines |
IR
2008
14 years 11 months ago
2008
We consider the following autocompletion search scenario: imagine a user of a search engine typing a query; then with every keystroke display those completions of the last query wo...
194
click to vote
SIGMOD
2009
ACM
15 years 12 months ago
2009
ACM
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
DEXAW
2008
IEEE
15 years 6 months ago
2008
IEEE
— One of the critical issues in search engines is the size of search indexes: as the number of documents handled by an engine increases, the search must preserve its efficiency,...
110
click to vote
FOCS
2009
IEEE
15 years 3 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...
115
click to vote
ICDE
2002
IEEE
15 years 4 months ago
2002
IEEE
We consider the use of wavelet transformations as a dimensionality reduction technique to permit efficient similarity search over high-dimensional time-series data. While numerou...