Spatial query processing in an object-oriented database system
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
ACM Transactions on Database Systems (TODS)
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
Multi-table joins through bitmapped join indices
ACM SIGMOD Record
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
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Object Relational DBMSs: The Next Great Wave
Object Relational DBMSs: The Next Great Wave
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
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Filter Trees for Managing Spatial Data over a Range of Size Granularities
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Generating Seeded Trees from Data Sets
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
Constraint-based algorithms for computing clique intersection joins
Proceedings of the 6th ACM international symposium on Advances in geographic information systems
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
Spatial join selectivity using power laws
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Hill climbing algorithms for content-based retrieval of similar configurations
SIGIR '00 Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval
High performance clustering based on the similarity join
Proceedings of the ninth international conference on Information and knowledge management
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
GESS: a scalable similarity-join algorithm for mining large data sets in high dimensional spaces
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
ACM Transactions on Database Systems (TODS)
Holistic twig joins: optimal XML pattern matching
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
High Dimensional Similarity Joins: Algorithms and Performance Evaluation
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
Heuristic approach for early separated filter and refinement strategy in spatial query optimization
Journal of Systems and Software
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
Parallel Algorithms for High-dimensional Similarity Joins for Data Mining Applications
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
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
Multi-way Spatial Joins Using R-Trees: Methodology and Performance Evaluation
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Algorithms for Joining R-Trees and Linear Region Quadtrees
SSD '99 Proceedings of the 6th 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
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
The Sort/Sweep Algorithm: A New Method for R-tree Based Spatial Joins
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
ACM Transactions on Database Systems (TODS)
Polyline Spatial Join Evaluation Using Raster Approximation
Geoinformatica
Algorithms for processing K-closest-pair queries in spatial databases
Data & Knowledge Engineering
Complex Spatial Query Processing
Geoinformatica
Multi-Way Distance Join Queries in Spatial Databases
Geoinformatica
Object-based and image-based object representations
ACM Computing Surveys (CSUR)
A spatial hash join algorithm suited for small buffer size
Proceedings of the 12th annual ACM international workshop on Geographic information systems
Decoupling partitioning and grouping: Overcoming shortcomings of spatial indexing with bucketing
ACM Transactions on Database Systems (TODS)
IEEE Transactions on Knowledge and Data Engineering
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
Journal of Systems and Software
Hypercube sweeping algorithm for subsequence motion matching in large motion databases
Proceedings of the 2006 ACM international conference on Virtual reality continuum and its applications
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)
A performance comparison of distance-based query algorithms using R-trees in spatial databases
Information Sciences: an International Journal
Progressive merge join: a generic and non-blocking sort-based join algorithm
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
ACM Transactions on Database Systems (TODS)
Continuous Spatiotemporal Trajectory Joins
GeoSensor Networks
From trajectories to activities: a spatio-temporal join approach
Proceedings of the 2009 International Workshop on Location Based Social Networks
Efficient joins with compressed bitmap indexes
Proceedings of the 18th ACM conference on Information and knowledge management
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Similarity joins as stronger metric operations
SIGSPATIAL Special
Probabilistic similarity join on uncertain data
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Star-Join: spatio-textual similarity join
Proceedings of the 21st ACM international conference on Information and knowledge management
Accelerating spatial join operations using bit-indices
ADC '11 Proceedings of the Twenty-Second Australasian Database Conference - Volume 115
20 years of data quality research: themes, trends and synergies
ADC '11 Proceedings of the Twenty-Second Australasian Database Conference - Volume 115
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
Hi-index | 0.00 |
We introduce a new algorithm to compute the spatial join of two or more spatial data sets, when indexes are not available on them. Size Separation Spatial Join (S3J) imposes a hierarchical decomposition of the data space and, in contrast with previous approaches, requires no replication of entities from the input data sets. Thus its execution time depends only on the sizes of the joined data sets.We describe S3J and present an analytical evaluation of its I/O and processor requirements comparing them with those of previously proposed algorithms for the same problem. We show that S3J has relatively simple cost estimation formulas that can be exploited by a query optimizer. S3J can be efficiently implemented using software already present in many relational systems. In addition, we introduce Dynamic Spatial Bitmaps (DSB), a new technique that enables S3J to dynamically or statically exploit bitmap query processing techniques.Finally, we present experimental results for a prototype implementation of S3J involving real and synthetic data sets for a variety of data distributions. Our experimental results are consistent with our analytical observations and demonstrate the performance benefits of S3J over alternative approaches that have been proposed recently.