Computational geometry: an introduction
Computational geometry: an introduction
A practical divide-and-conquer algorithm for the rectangle intersection problem
Information Sciences: an International Journal
Redundancy in spatial databases
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
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
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
Efficient processing of spatial joins using R-trees
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
CIKM '93 Proceedings of the second international conference on Information and knowledge management
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
A model for the prediction of R-tree performance
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Multidimensional access methods
ACM Computing Surveys (CSUR)
Sibling clustering of tree-based spatial indexes for efficient spatial query processing
Proceedings of the seventh international conference on Information and knowledge management
Integration of spatial join algorithms for processing multiple inputs
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Selectivity estimation in spatial databases
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Direct spatial search on pictorial databases using packed R-trees
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Database System Concepts
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
The Design and Implementation of Seeded Trees: An Efficient Method for Spatial Joins
IEEE Transactions on Knowledge and Data Engineering
Spatial Databases-Accomplishments and Research Needs
IEEE Transactions on Knowledge and Data Engineering
STR: A Simple and Efficient Algorithm for R-Tree Packing
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Efficient Computation of Spatial Joins
Proceedings of the Ninth International Conference on Data Engineering
Cost Models for Join Queries in Spatial Databases
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
A Generic Approach to Bulk Loading Multidimensional Index Structures
VLDB '97 Proceedings of the 23rd 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
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
A Cost Model for Estimating the Performance of Spatial Joins Using R-trees
SSDBM '97 Proceedings of the Ninth International Conference on Scientific and Statistical Database Management
Early Separation of Filter and Refinement Steps in Spatial Query Optimization
DASFAA '99 Proceedings of the Sixth International Conference on Database Systems for Advanced Applications
Generating Seeded Trees from Data Sets
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
A Performance Evaluation of Spatial Join Processing Strategies
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
ACM Transactions on Database Systems (TODS)
Multi-Way Distance Join Queries in Spatial Databases
Geoinformatica
IEEE Transactions on Knowledge and Data Engineering
Efficient trajectory joins using symbolic representations
Proceedings of the 6th international conference on Mobile data management
Transform-Space View: Performing Spatial Join in the Transform Space Using Original-Space Indexes
IEEE Transactions on Knowledge and Data Engineering
Query optimizer for spatial join operations
GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
ACM Transactions on Database Systems (TODS)
Indexing Spatio-Temporal Trajectories with Efficient Polynomial Approximations
IEEE Transactions on Knowledge and Data Engineering
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
The VLDB Journal — The International Journal on Very Large Data Bases
Continuous Spatiotemporal Trajectory Joins
GeoSensor Networks
Predictive Join Processing between Regions and Moving Objects
ADBIS '08 Proceedings of the 12th East European conference on Advances in Databases and Information Systems
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Medoid queries in large spatial databases
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
TOUCH: in-memory spatial join by hierarchical data-oriented partitioning
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
GIPSY: joining spatial datasets with contrasting density
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
The k closest pairs in spatial databases
Geoinformatica
| Hi-index | 0.00 |
Efficient processing of spatial joins is very important due to their high cost and frequent application in spatial databases and other areas involving multidimensional data. This paper proposes slot index spatial join (SISJ), an algorithm that joins a nonindexed data set with one indexed by an R-tree. We explore two optimization techniques that reduce the space requirements and the computational cost of SISJ and we compare it, analytically and experimentally, with other spatial join methods for two cases: 1) when the nonindexed input is read from disk and 2) when it is an intermediate result of a preceding database operator in a complex query plan. The importance of buffer splitting between consecutive join operators is also demonstrated through a two-join case study and a method that estimates the optimal splitting is proposed. Our evaluation shows that SISJ outperforms alternative methods in most cases and is suitable for limited memory conditions.