Blocking for external graph searching
From MaRDI portal
Publication:1920428
DOI10.1007/BF01940646zbMath0851.68022MaRDI QIDQ1920428
Michael T. Goodrich, Jeffrey Scott Vitter, Mark H. Nodine
Publication date: 12 August 1996
Published in: Algorithmica (Search for Journal in Brave)
68P10: Searching and sorting
68P15: Database theory
68R10: Graph theory (including graph drawing) in computer science
Related Items
Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep, Paging more than one page, An external memory data structure for shortest path queries
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Data encodings and their costs
- The input/output complexity of transitive closure
- Competitive paging with locality of reference
- Perfect Storage Representations for Families of Data Structures
- Encoding Data Structures in Trees
- On Embedding Rectangular Grids in Square Grids
- Preserving Proximity in Arrays
- Space and Time Hierarchies for Classes of Control Structures and Data Structures
- Preserving average proximity in arrays
- Bounds on the costs of data encodings