339 search results - page 8 / 68 » Improved Query Performance with Variant Indexes |
104
click to vote
SBBD
2001
15 years 1 months ago
2001
There are several auxiliary pre-computed access structures that allow faster answers by reading less base data. Examples are materialized views, join indexes, B-tree and bitmap in...
EDBT
2000
ACM
15 years 3 months ago
2000
ACM
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
131
click to vote
SAC
2003
ACM
15 years 5 months ago
2003
ACM
Query-by-example is the most popular query model for today’s image retrieval systems. A typical query image contains not only relevant objects (e.g., Eiffel Tower), but also ir...
100
click to vote
DAGSTUHL
2004
15 years 1 months ago
2004
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
VLDB
2002
ACM
14 years 11 months ago
2002
ACM
We present a method for efficiently performing deletions and updates of records when the records to be deleted or updated are chosen by a range scan on an index. The traditional m...