649 search results - page 78 / 130 » Improved and Optimized Partitioning Techniques in Database Q... |
131
Voted
SIGMOD
1998
ACM
15 years 8 months ago
1998
ACM
For an increasing number of modern database applications, efficient support of similarity search becomes an important task. Along with the complexity of the objects such as images...
137
Voted
SIGGRAPH
1995
ACM
15 years 7 months ago
1995
ACM
We present a method for searching in an image database using a query image that is similar to the intended target. The query image may be a hand-drawn sketch or a (potentially low...
122
Voted
SSDBM
2007
IEEE
15 years 10 months ago
2007
IEEE
Space-partitioning trees, like the disk-based trie, quadtree, kd-tree and their variants, are a family of access methods that index multi-dimensional objects. In the case of index...
126
Voted
SIGMOD
1996
ACM
15 years 7 months ago
1996
ACM
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
135
click to vote
IDEAS
2000
IEEE
15 years 8 months ago
2000
IEEE
Today many applications routinely generate large quantities of data. The data often takes the form of (time) series, or more generally streams, i.e. an ordered sequence of records...