Computational geometry: an introduction
Computational geometry: an introduction
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
A comparison of spatial query processing techniques for native and parameter spaces
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Efficient processing of spatial joins using R-trees
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Multi-step processing of spatial joins
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Spatial joins using seeded trees
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Accounting for boundary effects in nearest neighbor searching
Proceedings of the eleventh annual symposium on Computational geometry
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Partition based spatial-merge join
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
On saying “Enough already!” in SQL
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Optimal multi-step k-nearest neighbor search
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Incremental distance join algorithms for spatial databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Fast Nearest Neighbor Search in High-Dimensional Space
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Reducing the Braking Distance of an SQL Query Engine
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Scalable Sweeping-Based Spatial Join
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Probabilistic Optimization of Top N Queries
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Fast Nearest Neighbor Search in Medical Image Databases
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
The X-tree: An Index Structure for High-Dimensional Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
Tie-breaking strategies for fast distance join processing
Data & Knowledge Engineering
Approximate Algorithms for Distance-Based Queries in High-Dimensional Data Spaces Using R-Trees
ADBIS '02 Proceedings of the 6th East European Conference on Advances in Databases and Information Systems
Partition-Based Similarity Join in High Dimensional Data Spaces
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
Index-driven similarity search in metric spaces (Survey Article)
ACM Transactions on Database Systems (TODS)
Algorithms for processing K-closest-pair queries in spatial databases
Data & Knowledge Engineering
Multi-Way Distance Join Queries in Spatial Databases
Geoinformatica
An approximate algorithm for top-k closest pairs join query in large high dimensional data
Data & Knowledge Engineering
Relaxing join and selection queries
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Distance join queries on spatial networks
GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
A performance comparison of distance-based query algorithms using R-trees in spatial databases
Information Sciences: an International Journal
An empirical study on selective partitioning dimensions for partition-based similarity joins
Data & Knowledge Engineering
A Bayesian method for guessing the extreme values in a data set?
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Ring-constrained join: deriving fair middleman locations from pointsets via a geometric constraint
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Guessing the extreme values in a data set: a Bayesian method and its applications
The VLDB Journal — The International Journal on Very Large Data Bases
Design and evaluation of trajectory join algorithms
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Processing distance-based queries in multidimensional data spaces using R-trees
PCI'01 Proceedings of the 8th Panhellenic conference on Informatics
Ad-hoc distributed spatial joins on mobile devices
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Finding the sites with best accessibilities to amenities
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
An incremental Hausdorff distance calculation algorithm
Proceedings of the VLDB Endowment
Similarity search on a large collection of point sets
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Closest pair queries with spatial constraints
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Partition-Based similarity joins using diagonal dimensions in high dimensional data spaces
IDEAL'06 Proceedings of the 7th international conference on Intelligent Data Engineering and Automated Learning
Efficient top-k spatial distance joins
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
Hi-index | 0.00 |
A spatial distance join is a relatively new type of operation introduced for spatial and multimedia database applications. Additional requirements for ranking and stopping cardinality are often combined with the spatial distance join in on-line query processing or internet search environments. These requirements pose new challenges as well as opportunities for more efficient processing of spatial distance join queries. In this paper, we first present an efficient k-distance join algorithm that uses spatial indexes such as R-trees. Bi-directional node expansion and plane-sweeping techniques are used for fast pruning of distant pairs, and the plane-sweeping is further optimized by novel strategies for selecting a sweeping axis and direction. Furthermore, we propose adaptive multi-stage algorithms for k-distance join and incremental distance join operations. Our performance study shows that the proposed adaptive multi-stage algorithms outperform previous work by up to an order of magnitude for both k-distance join and incremental distance join queries, under various operational conditions.