The input/output complexity of sorting and related problems
Communications of the ACM
The design and analysis of spatial data structures
The design and analysis of spatial data structures
Paging binary trees with external balancing
WG '89 Proceedings of the fifteenth international workshop on Graph-theoretic concepts in computer science
The hB-tree: a multiattribute indexing method with good guaranteed performance
ACM Transactions on Database Systems (TODS)
Multidimensional access methods
ACM Computing Surveys (CSUR)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM (JACM)
On two-dimensional indexability and optimal range search indexing
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The P-range tree: a new data structure for range searching in secondary memory
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Balanced aspect ratio trees: combining the advantages of k-d trees and octrees
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
External memory algorithms and data structures
External memory algorithms
Efficient cross-trees for external memory
External memory algorithms
I/O-efficient dynamic planar point location (extended abstract)
Proceedings of the sixteenth annual symposium on Computational geometry
ACM Computing Surveys (CSUR)
Multidimensional binary search trees used for associative searching
Communications of the ACM
Design of Dynamic Data Structures
Design of Dynamic Data Structures
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Optimal Dynamic Range Searching in Non-replicating Index Structures
ICDT '99 Proceedings of the 7th International Conference on Database Theory
The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
External memory data structures
Handbook of massive data sets
Optimal dynamic interval management in external memory
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
External Memory Data Structures
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Implementing I/O-efficient Data Structures Using TPIE
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Bulk Operations for Space-Partitioning Trees
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Bulk construction of dynamic clustered metric trees
Knowledge and Information Systems
External-memory algorithms and data structures
Algorithms and theory of computation handbook
A fast and robust bulk-loading algorithm for indexing very large digital elevation datasets
Computers & Geosciences
Hybrid MPI/GPU interpolation for grid DEM construction
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
| Hi-index | 0.00 |
In this paper we investigate automated methods for externalizing internal memory data structures.We consider a class of balanced trees that we call weight-balanced partitioning trees (or wp-trees) for indexing a set of points in Rd.Well-known examples of wp-trees include kd-trees, BBD-trees, pseudo-quad-trees, and BAR-trees. Given an efficient external wp-tree construction algorithm, we present a general framework for automatically obtaining a dynamic external data structure. Using this framework together with a new general construction (bulk loading) technique of independent interest, we obtain data structures with guaranteed good update performance in terms of I/O transfers. Our approach gives considerably improved construction and update I/O bounds for e.g. external kd-trees and BBD-trees.