Online Data Structures in External Memory

No abstract is available for this paper.

• Publication year

  1999

• Venue

  Workshop on Algorithms and Data Structures

• Publication date

  1999-08-11

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/3-540-48447-7_35
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Efficient Splitting and Merging Algorithms for Order Decomposable Problems

  1999cited by this paper
• Optimal Dynamic Range Searching in Non-replicating Index Structures

  1999cited by this paper
• Efficient Bulk Operations on Dynamic R-Trees

  1999cited by this paper
• Efficient cross-trees for external memory

  1999cited by this paper
• Modeling and optimizing I/O throughput of multiple disks on a bus

  1999cited by this paper
• External memory algorithms and data structures

  1999cited by this paper
• Advances in Discrete and Computational Geometry

  1999cited by this paper
• E cient Bulk Operations on Dynamic R-trees

  1999cited by this paper
• On two-dimensional indexability and optimal range search indexing

  1999influential reference
• I/O-efficient dynamic point location in monotone planar subdivisions

  1999cited by this paper
• I/O-efficient algorithms for contour-line extraction and planar graph blocking

  1998cited by this paper
• Worst-Case Efficient External-Memory Priority Queues

  1998cited by this paper
• Multidimensional access methods

  1998cited by this paper
• Modeling and optimizing I/O throughput of multiple disks on a bus (summary)

  1998cited by this paper
• Tight bounds for 2-dimensional indexing schemes

  1998cited by this paper
• External Memory Algorithms with Dynamically Changing Memory Allocations .

  1998cited by this paper
• Improving the Query Performance of High-Dimensional Index Structures by Bulk-Load Operations

  1998cited by this paper
• Efficient searching with linear constraints

  1998cited by this paper
• The art of computer programming, volume 3: (2nd ed.) sorting and searching

  1998cited by this paper
• A lower bound theorem for indexing schemes and its application to multidimensional range queries

  1998cited by this paper
• Eecient Cross-trees for External Memory

  1998cited by this paper
• An analytic behavior model for disk drives with readahead caches and request reordering

  1998cited by this paper
• Worst-Case External-Memory Priority Queues

  1998cited by this paper
• The hB Π-tree : a multi-attribute index supporting concurrency , recovery and node consolidation

  1997cited by this paper
• Eecient Searching with Linear Constraints

  1997cited by this paper
• On the analysis of indexing schemes

  1997cited by this paper
• A Generic Approach to Bulk Loading Multidimensional Index Structures

  1997cited by this paper
• An Efficient Multiversion Access STructure

  1997cited by this paper
• Concurrency and recovery for index trees

  1997cited by this paper
• The hB $^\Pi$-tree: a multi-attribute index supporting concurrency, recovery and node consolidation

  1997cited by this paper
• Efficient Splitting and Merging Algorithms for Order Decomposable Problems (Extended Abstract)

  1997cited by this paper
• EÆcient Searching with Linear Constraints

  1997cited by this paper
• Spatial Data Structures: Concepts and Design Choices

  1996cited by this paper
• Optimal dynamic interval management in external memory

  1996influential reference
• Strategic directions in storage I/O issues in large-scale computing

  1996cited by this paper
• Report of the Working Group on Storage I/O Issues in Large-Scale Computing

  1996cited by this paper
• Bulk insertion in dynamic r-trees

  1996cited by this paper
• Efficient 3-D range searching in external memory

  1996cited by this paper
• Indexing for Data Models with Constraints and Classes

  1996cited by this paper
• Topology B-Trees and Their Applications

  1995cited by this paper
• The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract)

  1995cited by this paper
• The P-range tree: a new data structure for range searching in secondary memory

  1995influential reference
• The Buuer Tree: a New Technique for Optimal I/o-algorithms ?

  1995cited by this paper
• Eecient 3-d Range Searching in External Memory

  1995cited by this paper
• RAID: high-performance, reliable secondary storage

  1994cited by this paper
• An introduction to disk drive modeling

  1994cited by this paper
• Path Caching: a Technique for Optimal External Searching Path Caching: a Technique for Optimal External Searching

  1994cited by this paper
• Path caching (extended abstract): a technique for optimal external searching

  1994influential reference
• Hilbert R-tree: An Improved R-tree using Fractals

  1994cited by this paper
• On packing R-trees

  1993cited by this paper
• Information Retrieval: Data Structures and Algorithms

  1992cited by this paper
• Efficient Memory Access in Large-Scale Computation

  1991cited by this paper
• Efficient memory access in large-scale computation (invited paper)

  1991cited by this paper
• The hB-tree: a multiattribute indexing method with good guaranteed performance

  1990cited by this paper
• The R*-tree: an efficient and robust access method for points and rectangles

  1990cited by this paper
• Lower bounds for orthogonal range searching: I. The reporting case

  1990cited by this paper
• The Buddy-Tree: An Efficient and Robust Access Method for Spatial Data Base Systems

  1990cited by this paper
• An implementation and performance analysis of spatial data access methods

  1989cited by this paper
• Dynamic hashing schemes

  1988cited by this paper
• Linear space data structures for two types of range search

  1987cited by this paper
• Adding range restriction capability to dynamic data structures

  1985cited by this paper
• Priority Search Trees

  1985cited by this paper
• The grid file system

  1985cited by this paper
• The grid file system: implementation and case studies of applications

  1985cited by this paper
• The Grid File

  1984cited by this paper
• R-trees: a dynamic index structure for spatial searching

  1984cited by this paper
• The art of computer programming

  1983cited by this paper
• A new approach to rectangle intersections part I

  1983cited by this paper
• Filtering search: A new approach to query-answering

  1983influential reference
• Analysis of Extendible Hashing

  1982cited by this paper
• The K-D-B-tree: a search structure for large multidimensional dynamic indexes

  1981cited by this paper
• Linear Hashing: A New Tool for File and Table Addressing

  1980cited by this paper
• Multidimensional divide-and-conquer

  1980cited by this paper
• Extendible hashing—a fast access method for dynamic files

  1979cited by this paper
• Ubiquitous B-Tree

  1979cited by this paper
• Sorting and Searching

  1973cited by this paper
• The VLDB Journal c ○ Springer-Verlag 1996 An asymptotically optimal multiversion B-tree

  year unknowncited by this paper
• DIMACS Series in Discrete Mathematics and Theoretical Computer Science External Memory Techniques for Isosurface Extraction in

  year unknowncited by this paper

• A group testing algorithm with online informational learning

  2014cites this paper
• DiskTrie: An Efficient Data Structure using Flash Memory for Mobile Devices

  2007cites this paper
• Density-Based Data Clustering Algorithms for Lower Dimensions Using Space-Filling Curves

  2007cites this paper
• An upper bound on the weight-balanced testing procedure with multiple testers

  2004cites this paper
• Indexing Moving Points

  2003cites this paper
• The Buffer Tree: A Technique for Designing Batched External Data Structures

  2003cites this paper
• Algorithms for Memory Hierarchies

  2003cites this paper
• I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries

  2003cites this paper
• An upper bound of the weight-balanced testing procedure with multiple testers

  2002cites this paper
• Basic External Memory Data Structures

  2002cites this paper
• Distributed Paged Hash Tables

  2002cites this paper
• Time Responsive Indexing Schemes for Moving

  2001cites this paper
• Time Responsive External Data Structures for Moving Points

  2001cites this paper
• External memory algorithms and data structures: dealing with massive data

  2001cites this paper
• External Memory Data Structures (invited Paper)

  2001cites this paper
• External Memory Data Structures

  2001cites this paper
• A Framework for Index Bulk Loading and Dynamization

  2001cites this paper
• I/O-efficient dynamic planar point location (extended abstract)

  2000cites this paper
• Indexing moving points (extended abstract)

  2000cites this paper
• I/o-eecient Dynamic Planar Point Location

  2000cites this paper
• Efficient Searching with Linear Constraints 1

  1999cites this paper
• I/o-eecient Dynamic Planar Point Location

  1999cites this paper
• External memory algorithms

  1998cites this paper
• Efficient searching with linear constraints

  1998cites this paper
• Eecient Searching with Linear Constraints

  1997cites this paper
• Eecient Searching with Linear Constraints

  1997cites this paper
• Paradigms for EÆcient Design of External Memory Algorithms

  year unknowncites this paper
• cient Searching with Linear Constraints

  year unknowncites this paper