Computational geometry: an introduction
Computational geometry: an introduction
Spatial query processing in an object-oriented database system
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Gray Codes for Partial Match and Range Queries
IEEE Transactions on Software Engineering
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
Linear clustering of objects with multiple attributes
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Symbolic and spatial database for structural biology
OOPSLA '91 Conference proceedings on Object-oriented programming systems, languages, and applications
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
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 of the Cell Tree: An Object-Oriented Index Structure for Geometric Databases
Proceedings of the Fifth International Conference on Data Engineering
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
The Performance of Object Decomposition Techniques for Spatial Query Processing
SSD '91 Proceedings of the Second International Symposium on Advances in Spatial Databases
A Storage and Access Architecture for Efficient Query Processing in Spatial Database Systems
SSD '93 Proceedings of the Third International Symposium on Advances in Spatial Databases
The TR*-Tree: A New Representation of Polygonal Objects Supporting Spatial Queries and Operations
CG '91 Proceedings of the International Workshop on Computational Geometry - Methods, Algorithms and Applications
Proceedings of the Sixth International Conference on Data Engineering
GENESYS: a system for efficient spatial query processing
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Topological relations in the world of minimum bounding rectangles: a study with R-trees
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
SIGMOD '95 Proceedings of the 1995 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
Spatial query processing using object decomposition method
CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
The SR-tree: an index structure for high-dimensional nearest neighbor queries
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Two phase query processing with fuzzy approximations
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)
Transformation-based spatial join
Proceedings of the eighth international conference on Information and knowledge management
Spot: distance based join indices for spatial data
Proceedings of the 7th ACM international symposium on Advances in geographic information systems
Adaptive multi-stage distance join processing
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Experimental evaluation of filter effectiveness (extended abstract)
Proceedings of the 8th ACM international symposium on Advances in geographic information systems
Approximate spatio-temporal retrieval
ACM Transactions on Information Systems (TOIS)
Optimizing multidimensional index trees for main memory access
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Querying the trajectories of on-line mobile objects
Proceedings of the 2nd ACM international workshop on Data engineering for wireless and mobile access
Box-trees and R-trees with near-optimal query time
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Tie-breaking strategies for fast distance join processing
Data & Knowledge Engineering
Density-Based Clustering in Spatial Databases: The Algorithm GDBSCAN and Its Applications
Data Mining and Knowledge Discovery
An introduction to spatial database systems
The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems
Similarity Searching in Medical Image Databases
IEEE Transactions on Knowledge and Data Engineering
Spatial Join Processing Using Corner Transformation
IEEE Transactions on Knowledge and Data Engineering
Efficient Cost Models for Spatial Queries Using R-Trees
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
Efficient Join-Index-Based Spatial-Join Processing: A Clustering Approach
IEEE Transactions on Knowledge and Data Engineering
Data page layouts for relational databases on deep memory hierarchies
The VLDB Journal — The International Journal on Very Large Data Bases
A Parallel Spatial Join Processing for Distributed Spatial Databases
FQAS '02 Proceedings of the 5th International Conference on Flexible Query Answering Systems
Algorithms for Querying by Spatial Structure
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
VLDB '98 Proceedings of the 24rd 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
Extending Rectangle Join Algorithms for Rectilinear Polygons
WAIM '00 Proceedings of the First International Conference on Web-Age Information Management
High Level Indexing of User-Defined Types
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Weaving Relations for Cache Performance
Proceedings of the 27th International Conference on Very Large Data Bases
The Impact of Global Clustering on Spatial Database Systems
VLDB '94 Proceedings of the 20th 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
Generalized Search Trees for Database Systems
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Efficient User-Adaptable Similarity Search in Large Multimedia Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Computational Indexes for Time Series
SSDBM '96 Proceedings of the Eighth International Conference on Scientific and Statistical Database Management
Development of Multi-step Filtering Processor
DASFAA '99 Proceedings of the Sixth International Conference on Database Systems for Advanced Applications
Efficiently Matching Proximity Relationships in Spatial Databases
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial 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
Knowledge Discovery in Spatial Databases
KI '99 Proceedings of the 23rd Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
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
Extending the constraint database framework
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
Data management in environmental information systems
Handbook of massive data sets
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
Implementing Geospatial Operations in an Object-Relational Database System
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
Information Processing and Management: an International Journal
Hardware acceleration for spatial selections and joins
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Polyline Spatial Join Evaluation Using Raster Approximation
Geoinformatica
Adaptive and Incremental Processing for Distance Join Queries
IEEE Transactions on Knowledge and Data Engineering
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)
Efficient relational database management using graphics processors
DaMoN '05 Proceedings of the 1st international workshop on Data management on new hardware
A multi-step strategy for approximate similarity search in image databases
ADC '06 Proceedings of the 17th Australasian Database Conference - Volume 49
Filtering with raster signatures
GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
ACM Transactions on Database Systems (TODS)
Fast computation of spatial selections and joins using graphics hardware
Information Systems
Hardware acceleration in commercial databases: a case study of spatial operations
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Efficient processing of spatial joins with DOT-based indexing
Information Sciences: an International Journal
Vector model in support of versatile georeferenced video search
MMSys '10 Proceedings of the first annual ACM SIGMM conference on Multimedia systems
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
New concepts for parallel object-relational query processing
New concepts for parallel object-relational query processing
High-dimensional indexing: transformational approaches to high-dimensional range and similarity searches
Design and implementation of geo-tagged video search framework
Journal of Visual Communication and Image Representation
Estimating the overlapping area of polygon join
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Topological relationship query processing for complex regions in Oracle Spatial
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Hi-index | 0.00 |
Spatial joins are one of the most important operations for combining spatial objects of several relations. In this paper, spatial join processing is studied in detail for extended spatial objects in two-dimensional data space. We present an approach for spatial join processing that is based on three steps. First, a spatial join is performed on the minimum bounding rectangles of the objects returning a set of candidates. Various approaches for accelerating this step of join processing have been examined at the last year's conference [BKS 93a]. In this paper, we focus on the problem how to compute the answers from the set of candidate which is handled by the following two steps. First of all, sophisticated approximations are used to identify answers as well as to filter out false hits from the set of candidates. For this purpose, we investigate various types of conservative and progressive approximations. In the last step, the exact geometry of the remaining candidates has to be tested against the join predicate. The time required for computing spatial join predicates can essentially be reduced when objects are adequately organized in main memory. In our approach, objects are first decomposed into simple components which are exclusively organized by a main-memory resident spatial data structure. Overall, we present a complete approach of spatial join processing on complex spatial objects. The performance of the individual steps of our approach is evaluated with data sets from real cartographic applications. The results show that our approach reduces the total execution time of the spatial join by factors.