Incremental distance join algorithms for spatial databases
- 1 June 1998
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 27 (2) , 237-248
- https://doi.org/10.1145/276304.276326
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Processing queries for first-few answersPublished by Association for Computing Machinery (ACM) ,1996
- An optimal algorithm for closest pair maintenance (extended abstract)Published by Association for Computing Machinery (ACM) ,1995
- Spatial joins using seeded treesPublished by Association for Computing Machinery (ACM) ,1994
- Multi-step processing of spatial joinsPublished by Association for Computing Machinery (ACM) ,1994
- Efficient processing of spatial joins using R-treesPublished by Association for Computing Machinery (ACM) ,1993
- Probabilistic analysis of an algorithm for solving thek-dimensional all-nearest-neighbors problem by projectionBIT Numerical Mathematics, 1991
- AnO(n logn) algorithm for the all-nearest-neighbors ProblemDiscrete & Computational Geometry, 1989
- The pairing heap: A new form of self-adjusting heapAlgorithmica, 1986
- R-treesPublished by Association for Computing Machinery (ACM) ,1984
- Ubiquitous B-TreeACM Computing Surveys, 1979