139 search results - page 25 / 28 » Compression of inverted indexes for fast query evaluation |
VLDB
1999
ACM
13 years 11 months ago
1999
ACM
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
CIKM
1998
Springer
13 years 11 months ago
1998
Springer
An important investigation of time series involves searching for \movement" patterns, such as \going up" or \going down" or some combinations of them. Movement patt...
MIR
2004
ACM
14 years 26 days ago
2004
ACM
We present in this paper a CBIR system for use in a psychological study of the relationship between human movement and Dyslexia. The system allows access to up to 500 hours of vid...
SIGMOD
2010
ACM
13 years 5 months ago
2010
ACM
We consider fast two-sided error-tolerant search that is robust against errors both on the query side (type alogrithm, find documents with algorithm) as well as on the document si...