Abstract
It is well known that under random insertions the space utilisation of B-trees is approximately ln 2. This paper provides a simple proof. Copyright
| Original language | English |
|---|---|
| Pages (from-to) | 356-359 |
| Number of pages | 4 |
| Journal | Journal of Research and Practice in Information Technology |
| Volume | 33 |
| Issue number | 4 |
| Publication status | Published - 2001 |