The input/output complexity of sorting and related problems
Communications of the ACM
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
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
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
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
A Unified Approach for Indexed and Non-Indexed Spatial Joins
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
A Framework for Index Bulk Loading and Dynamization
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
LEDA-SM Extending LEDA to Secondary Memory
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
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
Supporting I/O-efficient scientific computation in TPIE
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Asynchronous parallel disk sorting
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
I/O-efficient point location using persistent B-trees
Journal of Experimental Algorithmics (JEA)
The Priority R-tree: a practically efficient and worst-case optimal R-tree
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
BOXes: Efficient Maintenance of Order-Based Labeling for Dynamic XML Data
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
A computational study of external-memory BFS algorithms
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
I/O-efficient batched union-find and its applications to terrain analysis
Proceedings of the twenty-second annual symposium on Computational geometry
The priority R-tree: A practically efficient and worst-case optimal R-tree
ACM Transactions on Algorithms (TALG)
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
Better external memory suffix array construction
Journal of Experimental Algorithmics (JEA)
Design and Engineering of External Memory Traversal Algorithms for General Graphs
Algorithmics of Large and Complex Networks
Reducing the memory required to find a geodesic shortest path on a large mesh
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
I/O-efficient batched union-find and its applications to terrain analysis
ACM Transactions on Algorithms (TALG)
Top-k queries on temporal data
The VLDB Journal — The International Journal on Very Large Data Bases
Privacy-preserving queries over relational databases
PETS'10 Proceedings of the 10th international conference on Privacy enhancing technologies
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
I/O-efficient construction of constrained delaunay triangulations
ESA'05 Proceedings of the 13th annual European conference on Algorithms
STXXL: standard template library for XXL data sets
ESA'05 Proceedings of the 13th annual European conference on Algorithms
An update-aware storage system for low-locality update-intensive workloads
ASPLOS XVII Proceedings of the seventeenth international conference on Architectural Support for Programming Languages and Operating Systems
Proceedings of the VLDB Endowment
Hybrid MPI/GPU interpolation for grid DEM construction
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Optimal splitters for temporal and multi-version databases
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
| Hi-index | 0.00 |
In recent years, many theoretically I/O-efficient algorithms and data structures have been developed. The TPIE project at Duke University was started to investigate the practical importance of these theoretical results. The goal of this ongoing project is to provide a portable, extensible, flexible, and easy to use C++ programming environment for efficiently implementing I/O-algorithms and data structures. The TPIE library has been developed in two phases. The first phase focused on supporting algorithms with a sequential I/O pattern, while the recently developed second phase has focused on supporting on-line I/O-efficient data structures, which exhibit a more random I/O pattern. This paper describes the design and implementation of the second phase of TPIE.