Abstract
The abstract logical data structure for the BANG file directory is a multiway tree structure with one node for each bucket in the file. Under assumptions of “perfect hashing” or “growth on data principle”, we model the growth of the tree. The average cost for search and insertion is found to be logarithmic in the file size. The order constant is small and depends on the capacity of a bucket. Simulation confirms the analytic results. Similar assumptions should be applicable to the analysis of other multi-dimensional file structures.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
