Planar point location using persistent search trees
Communications of the ACM
The input/output complexity of sorting and related problems
Communications of the ACM
Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Randomized external-memory algorithms for some geometric problems
Proceedings of the fourteenth annual symposium on Computational geometry
Handbook of discrete and computational geometry
I/O-efficient dynamic point location in monotone planar subdivisions
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
I/O-efficient dynamic planar point location (extended abstract)
Proceedings of the sixteenth annual symposium on Computational geometry
ACM Computing Surveys (CSUR)
A new point-location algorithm and its practical efficiency: comparison with existing algorithms
ACM Transactions on Graphics (TOG)
An Efficient Multiversion Access Structure
IEEE Transactions on Knowledge and Data Engineering
A Generic Approach to Bulk Loading Multidimensional Index Structures
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Implementing I/O-efficient Data Structures Using TPIE
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
An asymptotically optimal multiversion B-tree
The VLDB Journal — The International Journal on Very Large Data Bases
External memory data structures
Handbook of massive data sets
A survey of persistent data structures
ICCOMP'05 Proceedings of the 9th WSEAS International Conference on Computers
External memory planar point location with logarithmic updates
Proceedings of the twenty-fourth annual symposium on Computational geometry
The complexity of flow on fat terrains and its i/o-efficient computation
Computational Geometry: Theory and Applications
FIFO indexes for decomposable problems
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Ordered and unordered top-K range reporting in large data sets
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
We present an external planar point location data structure that is I/O-efficient both in theory and practice.The developed structure uses linear space and answers a query in optimal O(log BN) I/Os, where B is the disk block size. It is based on a persistent B-tree, and all previously developed such structures assume a total order on the elements in the structure. As a theoretical result of independent interest, we show how to remove this assumption.Most previous theoretical I/O-efficient planar point location structures are relatively complicated and have not been implemented. Based on a bucket approach, Vahrenhold and Hinrichs therefore developed a simple and practical, but theoretically non-optimal, heuristic structure. We present an extensive experimental evaluation that shows that, on a range of real-world Geographic Information Systems (GIS) data, our structure uses a similar number of I/Os as the structure of Vahrenhold and Hinrichs to answer a query. On a synthetically generated worst-case dataset our structure uses significantly fewer I/Os.