Bottom-up nearest neighbor search for R-trees. (English) Zbl 1185.68300
References:
| [1] | Cheung, K. L.; Fu, A., Enhanced nearest neighbour search on the R-tree, ACM SIGMOD Record, 27, 3 (1998) |
| [2] | A. Guttman, R-trees: A dynamic index structure for spatial searching, in: Proc. of SIGMOD, 1984; A. Guttman, R-trees: A dynamic index structure for spatial searching, in: Proc. of SIGMOD, 1984 |
| [3] | Hjaltason, G. R.; Samet, H., Distance browsing in spatial databases, ACM Trans. Database Systems, 24, 2 (1999) |
| [4] | A. Papadopoulos, Y. Manolopoulos, Performance of nearest neighbor queries in R-trees, in: Proc. of ICDT, 1997; A. Papadopoulos, Y. Manolopoulos, Performance of nearest neighbor queries in R-trees, in: Proc. of ICDT, 1997 |
| [5] | N. Roussopoulos, S. Kelley, F. Vincent, Nearest neighbor queries, in: Proc. of SIGMOD, 1995; N. Roussopoulos, S. Kelley, F. Vincent, Nearest neighbor queries, in: Proc. of SIGMOD, 1995 |
| [6] | Spatial Dataset |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
