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

DOI10.1016/0020-0190(90)90043-WzbMath0706.68032MaRDI QIDQ918665

Gabriel Matsliach

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

file organizationsmulti-bucket data leaves

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Data structures (68P05)

Related Items (2)

Bounded disorder: The effect of the index ⋮ Analysis of bounded disorder

Cites Work

• Unnamed Item
• On random 2-3 trees
• Computing the probability of hash table/urn overflow
• A simple bounded disorder file organization with good performance
• Kantorovich-Type Inequalities
• Multidimensional binary search trees used for associative searching
• The theory of fringe analysis and its application to 23 trees and b-trees

This page was built for publication: Performance analysis of file organizations that use multi-bucket data leaves