Sciweavers

165 search results - page 9 / 33
» Parallel Processing of Spatial Joins Using R-trees
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, ...
SIGMOD
2004
ACM
161views Database» more  SIGMOD 2004»
14 years 8 months ago
Approximation Techniques for Spatial Data
Spatial Database Management Systems (SDBMS), e.g., Geographical Information Systems, that manage spatial objects such as points, lines, and hyper-rectangles, often have very high ...
Abhinandan Das, Johannes Gehrke, Mirek Riedewald
SIGMOD
2000
ACM
173views Database» more  SIGMOD 2000»
13 years 8 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...
GIS
2006
ACM
14 years 9 months ago
Filtering with raster signatures
Efficient evaluation of spatial queries is an important issue in spatial database. Among spatial operations, spatial join is very useful, intersection being the most common predic...
Leonardo Guerreiro Azevedo, Ralf Hartmut Güti...
SSDBM
2006
IEEE
197views Database» more  SSDBM 2006»
14 years 2 months ago
InterJoin: Exploiting Indexes and Materialized Views in XPath Evaluation
XML has become the standard for data exchange for a wide variety of applications, particularly in the scientific community. In order to efficiently process queries on XML repres...
Derek Phillips, Ning Zhang 0002, Ihab F. Ilyas, M....