6004 search results - page 874 / 1201 » Parallelizing query optimization |
132
click to vote
WADS
1997
Springer
15 years 7 months ago
1997
Springer
We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in R2 or R3. Our planar structures are actually fitted for a more ...
167
click to vote
CISM
1993
15 years 7 months ago
1993
The weak instance model is a framework to consider the relations in a database as a whole, regardless of the way attributes are grouped in the individual relations. Queries and upd...
176
click to vote
EDBT
1994
ACM
15 years 7 months ago
1994
ACM
Abstract. Good estimates of join result sizes are critical for query optimization in relational database management systems. We address the problem of incrementally obtaining accur...
140
click to vote
FQAS
2004
Springer
15 years 7 months ago
2004
Springer
In the context of relational as well as deductive databases, correct and efficient integrity checking is a crucial issue, as, without any guarantee of data consistency, the answers...
115
click to vote
PODS
2000
ACM
15 years 6 months ago
2000
ACM
In this paper, we propose a new tunable index scheme, called iMinMax , that maps points in high dimensional spaces to single dimension values determined by their maximum or minimu...