Sciweavers

50 search results - page 8 / 10
» Compressing Bitmap Indexes for Faster Search Operations
Sort
View
ALENEX
2007
127views Algorithms» more  ALENEX 2007»
13 years 8 months ago
Intersection in Integer Inverted Indices
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...
Peter Sanders, Frederik Transier
FAST
2009
13 years 4 months ago
Spyglass: Fast, Scalable Metadata Search for Large-Scale Storage Systems
The scale of today's storage systems has made it increasingly difficult to find and manage files. To address this, we have developed Spyglass, a file metadata search system t...
Andrew W. Leung, Minglong Shao, Timothy Bisson, Sh...
WECWIS
2007
IEEE
131views ECommerce» more  WECWIS 2007»
14 years 29 days ago
Event Cloud - Searching for Correlated Business Events
Market players that can respond to critical business events faster than their competitors will end up as winners in the fast moving economy. Event-based systems have been develope...
Szabolcs Rozsnyai, Roland Vecera, Josef Schiefer, ...
ICDE
1999
IEEE
134views Database» more  ICDE 1999»
14 years 8 months ago
On Similarity-Based Queries for Time Series Data
We study similarity queries for time series data where similarity is defined in terms of a set of linear transformations on the Fourier series representation of a sequence. We hav...
Davood Rafiei
SPIRE
2010
Springer
13 years 5 months ago
Dual-Sorted Inverted Lists
Several IR tasks rely, to achieve high efficiency, on a single pervasive data structure called the inverted index. This is a mapping from the terms in a text collection to the docu...
Gonzalo Navarro, Simon J. Puglisi