The average height of a node in the BANG abstract directory tree
β Scribed by Stephen Taylor; Nabil Hachem; Stanley Selkow
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 467 KB
- Volume
- 61
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
β¦ Synopsis
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.
π SIMILAR VOLUMES
## Abstract ## Background: Sentinel node biopsies (SNBs) have been clinically applied in melanoma and breast cancer for limited lymphadenectomy. However, the use of SNB remains controversial in gastric cancer due to unsatisfactory sensitivity and variability. This metaβanalysis was performed to de