Sciweavers

60 search results - page 11 / 12
» Data-Parallel Spatial Join Algorithms
Sort
View
GEOINFO
2003
14 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, ...
SIGMOD
2000
ACM
173views Database» more  SIGMOD 2000»
14 years 9 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...
KDD
2001
ACM
253views Data Mining» more  KDD 2001»
15 years 10 months ago
GESS: a scalable similarity-join algorithm for mining large data sets in high dimensional spaces
The similarity join is an important operation for mining high-dimensional feature spaces. Given two data sets, the similarity join computes all tuples (x, y) that are within a dis...
Jens-Peter Dittrich, Bernhard Seeger
SIGMOD
2004
ACM
241views Database» more  SIGMOD 2004»
15 years 9 months ago
SINA: Scalable Incremental Processing of Continuous Queries in Spatio-temporal Databases
This paper introduces the Scalable INcremental hash-based Algorithm (SINA, for short); a new algorithm for evaluating a set of concurrent continuous spatio-temporal queries. SINA ...
Mohamed F. Mokbel, Xiaopeng Xiong, Walid G. Aref
96
Voted
SSDBM
2009
IEEE
119views Database» more  SSDBM 2009»
15 years 4 months ago
Identifying the Most Endangered Objects from Spatial Datasets
Abstract. Real-life spatial objects are usually described by their geographic locations (e.g., longitude and latitude), and multiple quality attributes. Conventionally, spatial dat...
Hua Lu, Man Lung Yiu