649 search results - page 7 / 130 » Improved and Optimized Partitioning Techniques in Database Q... |
91
Voted
VLDB
2005
ACM
15 years 3 months ago
2005
ACM
Query optimizers in current database systems are designed to pick a single efficient plan for a given query based on current statistical properties of the data. However, different...
112
click to vote
DASFAA
2004
IEEE
15 years 1 months ago
2004
IEEE
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
ICDE
2007
IEEE
15 years 3 months ago
2007
IEEE
Main memory is a critical resource when processing non-blocking queries with state intensive operators that require real-time responses. While partitioned parallel processing can ...
SIGMOD
1998
ACM
15 years 1 months ago
1998
ACM
In this paper, we propose the Pyramid-Technique, a new indexing method for high-dimensional data spaces. The PyramidTechnique is highly adapted to range query processing using the...
SIGMOD
1995
ACM
15 years 1 months ago
1995
ACM
Text is a pervasive information type, and many applications require querying over text sources in addition to structured data. This paper studies the problem of query processing i...