Blocking for external graph searching

DOI10.1007/BF01940646MaRDI QIDQ1920428zbMATH OpenOpenAlexFDO

Authors Mark H. Nodine, Michael T. Goodrich, Jeffrey Scott Vitter

Publication date 12 August 1996

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01940646

zbMATH Keywords

redundancyisothetic hypercubes

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Searching and sorting (68P10) Database theory (68P15)

Recommendations

• Planar graph blocking for external searching
• scientific article; zbMATH DE number 2080207
• Blocking in parallel multisearch problems
• An external memory data structure for shortest path queries
• Publication:4952710

Cites work

• scientific article; zbMATH DE number 139784 (Why is no real title available?)
• scientific article; zbMATH DE number 3606484 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 219265 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Bounds on the costs of data encodings
• Competitive paging with locality of reference
• Data encodings and their costs
• Encoding Data Structures in Trees
• On Embedding Rectangular Grids in Square Grids
• Perfect Storage Representations for Families of Data Structures
• Preserving Proximity in Arrays
• Preserving average proximity in arrays
• Space and Time Hierarchies for Classes of Control Structures and Data Structures
• The input/output complexity of transitive closure

Cited in

(14)

• An external memory data structure for shortest path queries
• Data replication in static tree structures
• Worst-case optimal tree layout in external memory
• An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional Grid Graphs and Its Applications
• Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep
• Succinct and I/O efficient data structures for traversal in trees
• Paging more than one page
• Topology B-trees and their applications
• Planar graph blocking for external searching
• scientific article; zbMATH DE number 2080207 (Why is no real title available?)
• The complexity of node blocking for dags
• Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep
• I/O-efficient path traversal in succinct planar graphs
• Optimal cache-oblivious mesh layouts

This page was built for publication: Blocking for external graph searching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1920428)