Join processing in database systems with large main memories
ACM Transactions on Database Systems (TODS)
A practical divide-and-conquer algorithm for the rectangle intersection problem
Information Sciences: an International Journal
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 effect of bucket size tuning in the dynamic hybrid GRACE hash join method
VLDB '89 Proceedings of the 15th international conference on Very large data bases
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
Join processing in relational 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
Spatial joins using seeded trees
SIGMOD '94 Proceedings of the 1994 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
Implementation techniques for main memory database systems
SIGMOD '84 Proceedings of the 1984 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
DOT: A Spatial Access Method Using Fractals
Proceedings of the Seventh International Conference on Data Engineering
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
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
Hash-Partitioned Join Method Using Dynamic Destaging Strategy
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
VLDB '94 Proceedings of the 20th 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
Generating Seeded Trees from Data Sets
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
Partition based spatial-merge join
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
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
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
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
Tie-breaking strategies for fast distance join processing
Data & Knowledge Engineering
Data Partitioning for Parallel Spatial Join Processing
Geoinformatica
Caching Strategies for Spatial Joins
Geoinformatica
Spatial Join Processing Using Corner Transformation
IEEE Transactions on Knowledge and Data Engineering
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
Hashing Methods for Temporal Data
IEEE Transactions on Knowledge and Data Engineering
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
Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Parallel Algorithms for High-dimensional Similarity Joins for Data Mining Applications
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
A Raster Approximation For Processing of Spatial Joins
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
Extending Rectangle Join Algorithms for Rectilinear Polygons
WAIM '00 Proceedings of the First International Conference on Web-Age Information Management
Set Containment Joins: The Good, The Bad and The Ugly
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Evaluation of Main Memory Join Algorithms for Joins with Set Comparison Join Predicates
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
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
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
Evaluation of Buffer Queries in Spatial Databases
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
On Multi-way Spatial Joins with Direction Predicates
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Partition-Based Similarity Join in High Dimensional Data Spaces
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
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
Toward Spatial Joins for Polygons
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
Adaptive and Incremental Processing for Distance Join Queries
IEEE Transactions on Knowledge and Data Engineering
Towards scalable location-aware services: requirements and research issues
GIS '03 Proceedings of the 11th ACM international symposium on Advances in geographic information systems
Algorithms for processing K-closest-pair queries in spatial databases
Data & Knowledge Engineering
Joining interval data in relational databases
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
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
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
Transform-Space View: Performing Spatial Join in the Transform Space Using Original-Space Indexes
IEEE Transactions on Knowledge and Data Engineering
Journal of Systems and Software
Maintenance of K-nn and spatial join queries on continuously moving points
ACM Transactions on Database Systems (TODS)
Summarizing level-two topological relations in large spatial datasets
ACM Transactions on Database Systems (TODS)
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)
Fast similarity join for multi-dimensional data
Information Systems
An empirical study on selective partitioning dimensions for partition-based similarity joins
Data & Knowledge Engineering
Gorder: an efficient method for KNN join processing
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
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
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
Solving similarity joins and range queries in metric spaces with the list of twin clusters
Journal of Discrete Algorithms
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
Anchoring millions of distinct reads on the human genome within seconds
Proceedings of the 13th International Conference on Extending Database Technology
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
High-dimensional indexing: transformational approaches to high-dimensional range and similarity searches
Privacy-preserving matching of spatial datasets with protection against background knowledge
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Optimizing the pre-processing of scientific visualization techniques using QEF
Proceedings of the 8th International Workshop on Middleware for Grids, Clouds and e-Science
Ad-hoc distributed spatial joins on mobile devices
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Probabilistic similarity join on uncertain data
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
An adaptive distributed query processing grid service
DMG 2005 Proceedings of the First VLDB conference on Data Management in Grids
Estimating the overlapping area of polygon join
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
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
Star-Join: spatio-textual similarity join
Proceedings of the 21st ACM international conference on Information and knowledge management
Processing multi-way spatial joins on map-reduce
Proceedings of the 16th International Conference on Extending Database Technology
Accelerating spatial join operations using bit-indices
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
Super-EGO: fast multi-dimensional similarity join
The VLDB Journal — The International Journal on Very Large Data Bases
Hadoop GIS: a high performance spatial data warehousing system over mapreduce
Proceedings of the VLDB Endowment
The k closest pairs in spatial databases
Geoinformatica
Hi-index | 0.00 |
We examine how to apply the hash-join paradigm to spatial joins, and define a new framework for spatial hash-joins. Our spatial partition functions have two components: a set of bucket extents and an assignment function, which may map a data item into multiple buckets. Furthermore, the partition functions for the two input datasets may be different.We have designed and tested a spatial hash-join method based on this framework. The partition function for the inner dataset is initialized by sampling the dataset, and evolves as data are inserted. The partition function for the outer dataset is immutable, but may replicate a data item from the outer dataset into multiple buckets. The method mirrors relational hash-joins in other aspects. Our method needs no pre-computed indices. It is therefore applicable to a wide range of spatial joins.Our experiments show that our method outperforms current spatial join algorithms based on tree matching by a wide margin. Further, its performance is superior even when the tree-based methods have pre-computed indices. This makes the spatial hash-join method highly competitive both when the input datasets are dynamically generated and when the datasets have pre-computed indices.