Sciweavers

28 search results - page 4 / 6
» Pipelined spatial join processing for quadtree-based indexes
Sort
View
GEOINFO
2003
13 years 9 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, ...
VLDB
1997
ACM
134views Database» more  VLDB 1997»
13 years 11 months ago
Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations
R-tree based spatial join is useful because of both its superior performance and the wide spread implementation of R-trees. We present a new R-tree join method called BFRJ (Breadt...
Yun-Wu Huang, Ning Jing, Elke A. Rundensteiner
DASFAA
2004
IEEE
169views Database» more  DASFAA 2004»
13 years 11 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, ...
SIGMOD
2000
ACM
173views Database» more  SIGMOD 2000»
13 years 7 months ago
javax.XXL: A prototype for a Library of Query processing Algorithms
In this paper we describe XXL (eXtensible and fleXible Library), a toolkit for rapid prototyping query processing algorithms. XXL is a flexible, high-level, platform independent J...
Jochen Van den Bercken, Jens-Peter Dittrich, Bernh...
SIGMOD
2009
ACM
250views Database» more  SIGMOD 2009»
14 years 7 months ago
Query processing techniques for solid state drives
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...
Dimitris Tsirogiannis, Stavros Harizopoulos, Mehul...