Topology B-trees and their applications

This publication has 14 references indexed in Scilit:

• Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• The buffer tree: A new technique for optimal I/O-algorithms
  Published by Springer Nature ,1995
• Blocking for external graph searching
  Published by Association for Computing Machinery (ACM) ,1993
• Reporting points in halfspaces
  Computational Geometry, 1992
• Advances in Spatial Databases
  Published by Springer Nature ,1991
• Skip lists: a probabilistic alternative to balanced trees
  Communications of the ACM, 1990
• Maintaining range trees in secondary memory
  Acta Informatica, 1990
• The input/output complexity of sorting and related problems
  Communications of the ACM, 1988
• Hysterical B-trees
  Information Processing Letters, 1981
• Ubiquitous B-Tree
  ACM Computing Surveys, 1979