PK+ tree: An improved spatial index structure of PK tree

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Spatial index is very important in GIS. PK tree and Hilbert R tree are two well-known spatial index structures. Comparison operations are very little in PK tree, while disk I/O operations are quite little in Hilbert R tree. PK+ Tree is an improved spatial index structure from PK tree. In PK+ tree, Comparison operations are less than in Hilbert R tree, while disk I/O operations are almost the same as in Hilbert R tree. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Wang, X., Luo, Y., Yu, L., & Xu, Z. (2005). PK+ tree: An improved spatial index structure of PK tree. In Lecture Notes in Computer Science (Vol. 3516, pp. 511–514). Springer Verlag. https://doi.org/10.1007/11428862_70

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free