|Title:||PERFORMANCE ANALYSIS OF' FILE ORGANIZATIONS THAT USE MULTI-BUCKET DATA LEAVES WITH PARTIAL EXPANSIONS
|Abstract:||We present an exact performance analysis, under random insertions, of file organizations that use multi-bucket data leaves and perform partial expansions before splitting. We evaluate the expected disk space utilization of the file, and show how the expected search and insert costs can be estimated. The analytical results are confirmed by simulations. The analysis can be used to investigate both the dynamic and the asymptotic behaviors.
Keywords: search structures, performance analysis, multi-bucket data leaves, partial expansions.
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1990/CS/CS0643), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1990
To the main CS technical reports page
Computer science department, Technion