Trees as data and file structures

This publication has 19 references indexed in Scilit:

• Minimal perfect hash functions made simple
  Communications of the ACM, 1980
• Extendible hashing—a fast access method for dynamic files
  ACM Transactions on Database Systems, 1979
• Multidimensional Binary Search Trees in Database Applications
  IEEE Transactions on Software Engineering, 1979
• Ubiquitous B-Tree
  ACM Computing Surveys, 1979
• Decomposable searching problems
  Information Processing Letters, 1979
• A dichromatic framework for balanced trees
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1978
• Concurrency of operations on B-trees
  Acta Informatica, 1977
• Systems with state re-set
  The Computer Journal, 1975
• Organization and maintenance of large ordered indexes
  Acta Informatica, 1972
• Trie memory
  Communications of the ACM, 1960