ACM Transactions on Database Systems (TODS)
Analysis of object oriented spatial access methods
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Redundancy in spatial databases
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
The design and analysis of spatial data structures
The design and analysis of spatial data structures
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
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Proceedings of the Seventh International Conference on Data Engineering
Distance-Associated Join Indices for Spatial Range Search
Proceedings of the Eighth International Conference on Data Engineering
Sampling from Spatial Databases
Proceedings of the Ninth International Conference on Data Engineering
Efficient Computation of Spatial Joins
Proceedings of the Ninth International Conference on Data Engineering
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
An Algorithm for Computing the Overlay of k-Dimensional Spaces
SSD '91 Proceedings of the Second International Symposium on Advances in Spatial Databases
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
Parallel processing of nearest neighbor queries in declustered spatial data
GIS '96 Proceedings of the 4th ACM international workshop on Advances in geographic information systems
Incremental distance join algorithms for spatial databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Multidimensional access methods
ACM Computing Surveys (CSUR)
Processing and optimization of multiway spatial joins using R-trees
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Integration of spatial join algorithms for processing multiple inputs
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Transformation-based spatial join
Proceedings of the eighth international conference on Information and knowledge management
Spatial join selectivity using power laws
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Adaptive multi-stage distance join processing
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
High performance clustering based on the similarity join
Proceedings of the ninth international conference on Information and knowledge management
Clone join and shadow join: two parallel spatial join algorithms
Proceedings of the 8th ACM international symposium on Advances in geographic information systems
Approximate spatio-temporal retrieval
ACM Transactions on Information Systems (TOIS)
Epsilon grid order: an algorithm for the similarity join on massive high-dimensional data
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
ACM Transactions on Database Systems (TODS)
Tie-breaking strategies for fast distance join processing
Data & Knowledge Engineering
Nearest Neighbor Queries in Shared-Nothing Environments
Geoinformatica
Data Partitioning for Parallel Spatial Join Processing
Geoinformatica
An introduction to spatial database systems
The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
The Design and Implementation of Seeded Trees: An Efficient Method for Spatial Joins
IEEE Transactions on Knowledge and Data Engineering
Spatial Join Processing Using Corner Transformation
IEEE Transactions on Knowledge and Data Engineering
Exploiting Spatial Indexes for Semijoin-Based Join Processing in Distributed Spatial Databases
IEEE Transactions on Knowledge and Data Engineering
High-Dimensional Similarity Joins
IEEE Transactions on Knowledge and Data Engineering
Efficient Join-Index-Based Spatial-Join Processing: A Clustering Approach
IEEE Transactions on Knowledge and Data Engineering
A Unified Approach for Indexed and Non-Indexed Spatial Joins
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
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
Benchmarking Spatial Join Operations with Spatial Output
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Size Estimation of the Intersection Join between Two Line Segment Datasets
ADBIS-DASFAA '00 Proceedings of the East-European Conference on Advances in Databases and Information Systems Held Jointly with International Conference on Database Systems for Advanced Applications: Current Issues in Databases and Information Systems
Optimal Dimension Order: A Generic Technique for the Similarity Join
DaWaK 2000 Proceedings of the 4th International Conference on Data Warehousing and Knowledge Discovery
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
Multi-way Spatial Joins Using R-Trees: Methodology and Performance Evaluation
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Efficient OLAP Operations in Spatial Data Warehouses
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Selectivity Estimation of Complex Spatial Queries
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Plug&Join: An easy-to-use Generic Algorithm for Efficiently Processing Equi and Non-Equi Joins
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
Algorithms for Performing Polygonal Map Overlay and Spatial Join on Massive Data Sets
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
ACM Transactions on Database Systems (TODS)
Adaptive and Incremental Processing for Distance Join Queries
IEEE Transactions on Knowledge and Data Engineering
Multi-Way Distance Join Queries in Spatial Databases
Geoinformatica
Object-based and image-based object representations
ACM Computing Surveys (CSUR)
Decoupling partitioning and grouping: Overcoming shortcomings of spatial indexing with bucketing
ACM Transactions on Database Systems (TODS)
IEEE Transactions on Knowledge and Data Engineering
Join operations in temporal databases
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient trajectory joins using symbolic representations
Proceedings of the 6th international conference on Mobile data management
Time relaxed spatiotemporal trajectory joins
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Transform-Space View: Performing Spatial Join in the Transform Space Using Original-Space Indexes
IEEE Transactions on Knowledge and Data Engineering
Bulk insertion for R-trees by seeded clustering
Data & Knowledge Engineering
ACM Transactions on Database Systems (TODS)
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
High-dimensional indexing: transformational approaches to high-dimensional range and similarity searches
Probabilistic similarity join on uncertain data
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
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 |
Existing methods for spatial joins assume the existence of indices for the participating data sets. This assumption is not realistic for applications involving multiple map layer overlays or for queries involving non-spatial selections. In this paper, we explore a spatial join method that dynamically constructs index trees called seeded trees at join time. This methods uses knowledge of the data sets involved in the join process.Seeded trees are R-tree like structures, and are divided into the seed levels and the grown levels. The nodes in the seed levels are used to guide tree growth during tree construction. The seed levels can also be used to filter out some input data during construction, thereby reducing tree size. We develop a technique that uses intermediate linked lists during tree construction and significantly speeds up the tree construction process. The technique allows a large number of random disk accesses during tree construction to be replaced by smaller numbers of sequential accesses.Our performance studies show that spatial joins using seeded trees outperform those using other methods significantly in terms of disk I/O. The CPU penalties incurred are also lower except when seed-level filtering is used.