External memory data structures

Authors:
Lars Arge
Affiliations:
Department of Computer Science, Duke University, Durham, NC
Venue:
Handbook of massive data sets
Year:
2002

Citing 114
Cited 51

The power of geometric duality

BIT - Ellis Horwood series in artificial intelligence
Planar point location using persistent search trees

Communications of the ACM
Filtering search: a new approach to query answering

SIAM Journal on Computing
Spatial query processing in an object-oriented database system

SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
The input/output complexity of sorting and related problems

Communications of the ACM
Priority search trees in secondary memory (extended abstract)

Proceedings of the International Workshop WG '87 on Graph-theoretic concepts in computer science
Making data structures persistent

Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Applications of spatial data structures: Computer graphics, image processing, and GIS

Applications of spatial data structures: Computer graphics, image processing, and GIS
The design and analysis of spatial data structures

The design and analysis of spatial data structures
Lower bounds for orthogonal range searching: I. The reporting case

Journal of the ACM (JACM)
Introduction to algorithms

Introduction to algorithms
The buddy tree: an efficient and robust access method for spatial data base

Proceedings of the sixteenth international conference on Very large databases
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
A comparison of spatial query processing techniques for native and parameter spaces

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
The hB-tree: a multiattribute indexing method with good guaranteed performance

ACM Transactions on Database Systems (TODS)
New results on dynamic planar point location

SIAM Journal on Computing
Efficient partition trees

Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
On packing R-trees

CIKM '93 Proceedings of the second international conference on Information and knowledge management
An introduction to disk drive modeling

Computer
Path caching (extended abstract): a technique for optimal external searching

PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Dynamic point location in general subdivisions

SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields

Journal of the ACM (JACM)
Nearest neighbor queries

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
A fully-dynamic data structure for external substring search

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Indexing for data models with constraints and classes

Journal of Computer and System Sciences
Efficient 3-D range searching in external memory

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
The SR-tree: an index structure for high-dimensional nearest neighbor queries

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
On sorting strings in external memory (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Space-filling curves and their use in the design of geometric data structures

Theoretical Computer Science - Special issue: Latin American theoretical informatics
A cost model for nearest neighbor search in high-dimensional data space

PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the analysis of indexing schemes

PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
I/O optimal isosurface extraction (extended abstract)

VIS '97 Proceedings of the 8th conference on Visualization '97
A lower bound theorem for indexing schemes and its application to multidimensional range queries

PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Tight bounds for 2-dimensional indexing schemes

PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Randomized external-memory algorithms for some geometric problems

Proceedings of the fourteenth annual symposium on Computational geometry
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
Point location

Handbook of discrete and computational geometry
Interactive out-of-core isosurface extraction

Proceedings of the conference on Visualization '98
Dynamic dictionary matching in external memory

Information and Computation
On indexing mobile objects

PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
Heaps and heapsort on secondary storage

Theoretical Computer Science
A data structure for dynamically maintaining rooted trees

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
External-memory graph algorithms

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for dynamic closest pair and n-body potential fields

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
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
Fast string searching in secondary storage: theoretical developments and experimental results

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Data structures for mobile data

Journal of Algorithms
I/O-efficient dynamic point location in monotone planar subdivisions

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
An optimal algorithm for approximate nearest neighbor searching

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
I/O-efficient algorithms for contour-line extraction and planar graph blocking

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
I/O-complexity of graph algorithms

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
The Grid File: An Adaptable, Symmetric Multikey File Structure

ACM Transactions on Database Systems (TODS)
Direct spatial search on pictorial databases using packed R-trees

SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Comparison of access methods for time-evolving data

ACM Computing Surveys (CSUR)
Efficient splitting and merging algorithms for order decomposable problems

Information and Computation
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric

Journal of the ACM (JACM)
Range searching in a set of line segments

SCG '85 Proceedings of the first annual symposium on Computational geometry
External memory algorithms and data structures

External memory algorithms
Efficient cross-trees for external memory

External memory algorithms
External memory techniques for isosurface extraction in scientific visualization

External memory algorithms
Updating and Querying Databases that Track Mobile Units

Distributed and Parallel Databases - Special issue on mobile data management and applications
Indexing moving points (extended abstract)

PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Indexing the positions of continuously moving objects

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
I/O-efficient dynamic planar point location (extended abstract)

Proceedings of the sixteenth annual symposium on Computational geometry
On external memory graph traversal

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Ubiquitous B-Tree

ACM Computing Surveys (CSUR)
Efficient searching with linear constraints

Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
I/O-efficient algorithms for graphs of bounded treewidth

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Efficient computation of temporal aggregates with range predicates

PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
Random Sampling, Halfspace Range Reporting, and Construction of \lowercase$(\le k)$-Levels in Three Dimensions

SIAM Journal on Computing
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
An Efficient Multiversion Access Structure

IEEE Transactions on Knowledge and Data Engineering
Improving the Query Performance of High-Dimensional Index Structures by Bulk-Load Operations

EDBT '98 Proceedings of the 6th International Conference on Extending Database Technology: Advances in Database Technology
STR: A Simple and Efficient Algorithm for R-Tree Packing

ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Fast Nearest Neighbor Search in High-Dimensional Space

ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
An Implementation and Performance Analysis of Spatial Data Access Methods

Proceedings of the Fifth International Conference on Data Engineering
The Design of the Cell Tree: An Object-Oriented Index Structure for Geometric Databases

Proceedings of the Fifth International Conference on Data Engineering
Similarity Indexing with the SS-tree

ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Efficient Indexing for Constraint and Temporal Databases

ICDT '97 Proceedings of the 6th International Conference on Database Theory
Performance of Nearest Neighbor Queries in R-Trees

ICDT '97 Proceedings of the 6th International Conference on Database Theory
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
A Generic Approach to Bulk Loading Multidimensional Index Structures

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects

VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Novel Approaches in Query Processing for Moving Object Trajectories

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Worst-Case External-Memory Priority Queues

SWAT '98 Proceedings of the 6th Scandinavian Workshop on Algorithm Theory
The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract)

WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Topology B-Trees and Their Applications

WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Client-Server Paradise

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Hilbert R-tree: An Improved R-tree using Fractals

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Fast Nearest Neighbor Search in Medical Image Databases

VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
The X-tree: An Index Structure for High-Dimensional Data

VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Efficient User-Adaptable Similarity Search in Large Multimedia Databases

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Memory Paging for Connectivity and Path Problems in Graphs

ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation

ISAAC '95 Proceedings of the 6th International Symposium on Algorithms and Computation
Orders, k-sets and Fast Halfplane Search on Paged Memory

ORDAL '94 Proceedings of the International Workshop on Orders, Algorithms, and Applications
Moving Objects Databases: Issues and Solutions

SSDBM '98 Proceedings of the 10th International Conference on Scientific and Statistical Database Management
Ranking in Spatial Databases

SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
External-Memory Algorithms for Processing Line Segments in Geographic Information Systems (Extended Abstract)

ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
On Constructing Suffix Arrays in External Memory

ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Spatial Data Structures: Concepts and Design Choices

Algorithmic Foundations of Geographic Information Systems, this book originated from the CISM Advanced School on the Algorithmic Foundations of Geographic Information Systems
The hB $^\Pi$-tree: a multi-attribute index supporting concurrency, recovery and node consolidation

The VLDB Journal — The International Journal on Very Large Data Bases
An asymptotically optimal multiversion B-tree

The VLDB Journal — The International Journal on Very Large Data Bases
Overcoming the Memory Bottleneck in Suffix Tree Construction

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Cache-Oblivious Algorithms

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Cache-oblivious B-trees

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Improved Algorithms and Data Structures for Solving Graph Problems in External Memory

SPDP '96 Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)
Optimal dynamic interval management in external memory

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Sorting and Searching (Eatcs Monographs on Theoretical Computer Science)

Sorting and Searching (Eatcs Monographs on Theoretical Computer Science)
An external memory data structure for shortest path queries (extended abstract)

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics

Cache-oblivious priority queue and graph algorithm applications

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On R-trees with low query complexity

Computational Geometry: Theory and Applications
CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries

ICDT '03 Proceedings of the 9th International Conference on Database Theory
Time Responsive External Data Structures for Moving Points

WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
A Framework for Index Bulk Loading and Dynamization

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Exponential Structures for Efficient Cache-Oblivious Algorithms

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
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
Incremental constructions con BRIO

Proceedings of the nineteenth annual symposium on Computational geometry
Cache-oblivious data structures for orthogonal range searching

Proceedings of the nineteenth annual symposium on Computational geometry
External memory algorithms

Handbook of massive data sets
Indexing moving points

Journal of Computer and System Sciences - Special issue on PODS 2000
Efficient Flow Computation on Massive Grid Terrain Datasets

Geoinformatica
I/O-efficient point location using persistent B-trees

Journal of Experimental Algorithmics (JEA)
I/O-efficient dynamic planar point location

Computational Geometry: Theory and Applications
Range Aggregate Processing in Spatial Databases

IEEE Transactions on Knowledge and Data Engineering
Cache-oblivious planar orthogonal range searching and counting

SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Cache-oblivious R-trees

SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Estimating arbitrary subset sums with few probes

Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Cache-oblivious string dictionaries

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Simple and semi-dynamic structures for cache-oblivious planar orthogonal range searching

Proceedings of the twenty-second annual symposium on Computational geometry
I/O-efficient batched union-find and its applications to terrain analysis

Proceedings of the twenty-second annual symposium on Computational geometry
TerraCost: a versatile and scalable approach to computing least-cost-path surfaces for massive grid-based terrains

Proceedings of the 2006 ACM symposium on Applied computing
Skewed binary search trees

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
TerraStream: from elevation data to watershed hierarchies

Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
Terracost: Computing least-cost-path surfaces for massive grid terrains

Journal of Experimental Algorithmics (JEA)
I/o-efficient efficient algorithms for computing contours on a terrain

Proceedings of the twenty-fourth annual symposium on Computational geometry
Algorithms and data structures for external memory

Foundations and Trends® in Theoretical Computer Science
Cache-Oblivious Red-Blue Line Segment Intersection

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
B-tries for disk-based string management

The VLDB Journal — The International Journal on Very Large Data Bases
Worst-case efficient range search indexing: invited tutorial

Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A Heuristic Strong Connectivity Algorithm for Large Graphs

SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Recent Advances in Worst-Case Efficient Range Search Indexing

SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Fault Tolerant External Memory Algorithms

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Algorithms for memory hierarchies: advanced lectures

Algorithms for memory hierarchies: advanced lectures
Approximate range searching in external memory

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies

Journal of Discrete Algorithms
I/O-efficient batched union-find and its applications to terrain analysis

ACM Transactions on Algorithms (TALG)
Cleaning massive sonar point clouds

Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
External-memory algorithms and data structures

Algorithms and theory of computation handbook
Algorithm engineering: bridging the gap between algorithm theory and practice

Algorithm engineering: bridging the gap between algorithm theory and practice
An efficient strategy for storing and searching binary trees in WORM external memory

Journal of Information Science
External string sorting: faster and cache-oblivious

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
I/O-Efficiently pruning dense spanners

JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
Cache-aware and cache-oblivious adaptive sorting

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
I/O-efficient contour queries on terrains

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A parallel buffer tree

Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Sketching and streaming algorithms for processing massive data

XRDS: Crossroads, The ACM Magazine for Students - Big Data
An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries

SIAM Journal on Computing
Efficient external memory structures for range-aggregate queries

Computational Geometry: Theory and Applications
Simplifying massive contour maps

ESA'12 Proceedings of the 20th Annual European conference on Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

In many massive dataset applications the data must be stored in space and query efficient data structures on external storage devices. Often the data needs to be changed dynamically. In this chapter we discuss recent advances in the development of provably worst-case efficient external memory dynamic data structures. We also briefly discuss some of the most popular external data structures used in practice.