Efficient processing of spatial joins using R-trees
- 1 June 1993
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMOD Record
- Vol. 22 (2) , 237-246
- https://doi.org/10.1145/170036.170075
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A qualitative comparison study of data structures for large line segment databasesPublished by Association for Computing Machinery (ACM) ,1992
- Parallel R-treesPublished by Association for Computing Machinery (ACM) ,1992
- Join processing in relational databasesACM Computing Surveys, 1992
- The implementation of POSTGRESIEEE Transactions on Knowledge and Data Engineering, 1990
- Optimal secondary storage access sequence for performing relational joinIEEE Transactions on Knowledge and Data Engineering, 1989
- Redundancy in spatial databasesPublished by Association for Computing Machinery (ACM) ,1989
- Gray codes for partial match and range queriesIEEE Transactions on Software Engineering, 1988
- R-treesPublished by Association for Computing Machinery (ACM) ,1984
- A class of data structures for associative searchingPublished by Association for Computing Machinery (ACM) ,1984
- An effective way to represent quadtreesCommunications of the ACM, 1982