Sciweavers

69 search results - page 13 / 14
» Compressed Inverted Indexes for In-Memory Search Engines
Sort
View
IR
2008
13 years 5 months ago
Output-sensitive autocompletion search
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...
Holger Bast, Christian Worm Mortensen, Ingmar Webe...
SIGMOD
2009
ACM
155views Database» more  SIGMOD 2009»
14 years 6 months ago
Efficient top-k algorithms for fuzzy search in string collections
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...
Rares Vernica, Chen Li
DEXAW
2008
IEEE
120views Database» more  DEXAW 2008»
14 years 7 days ago
Self-Similarity Metric for Index Pruning in Conceptual Vector Space Models
— 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,...
Dario Bonino, Fulvio Corno
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
ICDE
2002
IEEE
162views Database» more  ICDE 2002»
13 years 10 months ago
Similarity Search Over Time-Series Data Using Wavelets
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...
Ivan Popivanov, Renée J. Miller