Performance analysis of file organizations that use multi-bucket data leaves

This publication has 11 references indexed in Scilit:

• Performance of B/sup +/-trees with partial expansions
  IEEE Transactions on Knowledge and Data Engineering, 1989
• A simple bounded disorder file organization with good performance
  ACM Transactions on Database Systems, 1988
• Partial expansions for file organizations with an index
  ACM Transactions on Database Systems, 1987
• Computing the probability of hash table/urn overflow
  Communications in Statistics - Theory and Methods, 1987
• The Grid File
  ACM Transactions on Database Systems, 1984
• The theory of fringe analysis and its application to 23 trees and b-trees
  Information and Control, 1982
• Kantorovich-Type Inequalities
  The American Mathematical Monthly, 1982
• Extendible hashing—a fast access method for dynamic files
  ACM Transactions on Database Systems, 1979
• Ubiquitous B-Tree
  ACM Computing Surveys, 1979
• Multidimensional binary search trees used for associative searching
  Communications of the ACM, 1975