Sciweavers

237 search results - page 1 / 48
» Efficient Query Processing on the Relational Quadtree
Sort
View
GEOINFO
2003
13 years 11 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, ...
DASFAA
2004
IEEE
169views Database» more  DASFAA 2004»
14 years 1 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»
14 years 3 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, ...
ICC
2007
IEEE
180views Communications» more  ICC 2007»
14 years 4 months ago
Distributed Quad-Tree for Spatial Querying in Wireless Sensor Networks
— In contrast to the traditional wireless sensor network (WSN) applications that perform only data collection and aggregation, new generation of information processing applicatio...
Murat Demirbas, Xuming Lu
SSD
2001
Springer
162views Database» more  SSD 2001»
14 years 2 months ago
Interval Sequences: An Object-Relational Approach to Manage Spatial Data
The design of external index structures for one- and multidimensional extended objects is a long and well studied subject in basic database research. Today, more and more commercia...
Hans-Peter Kriegel, Marco Pötke, Thomas Seidl