Ranking and unranking of B-trees |
| |
| Authors: | UI Gupta DT Lee CK Wong |
| |
| Institution: | Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, Illinois 60201, USA;IBM T. J. Watson Research Center, Yorktown Heights, New York 10598, USA |
| |
| Abstract: | Algorithms are presented for the ranking, unranking, and generation of all B-trees of order m with n leaves. The algorithms take time proportional to the sizes of their output. It is shown how a search graph can be constructed to aid in the ranking and unranking of B-trees. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
