Sciweavers

13 search results - page 2 / 3
» Overlapping Linear Quadtrees and Spatio-Temporal Query Proce...
Sort
View
GEOINFO
2003
13 years 7 months ago
Efficient Query Processing on the Relational Quadtree
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
SSD
1999
Springer
99views Database» more  SSD 1999»
13 years 10 months ago
Algorithms for Joining R-Trees and Linear Region Quadtrees
The family of R-trees is suitable for storing various kinds of multidimensional objects and is considered an excellent choice for indexing a spatial database. Region Quadtrees are ...
Antonio Corral, Michael Vassilakopoulos, Yannis Ma...
DASFAA
2004
IEEE
169views Database» more  DASFAA 2004»
13 years 10 months ago
Statistic Driven Acceleration of Object-Relational Space-Partitioning Index Structures
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...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
SSDBM
2003
IEEE
136views Database» more  SSDBM 2003»
13 years 11 months ago
Acceleration of Relational Index Structures Based on Statistics
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
14 years 6 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...