Efficient Access to Non-Sequential Elements of a Search Tree
The Third International Conference on Advances in Databases, Knowledge, and Data Applications
International Academy, Research , and Industry Association
Place of Publication
St. MaartenThe Netherlands Antilles
This article describes how a search tree can be extended in order to allow efficient access to predefined subsets of the stored elements. This is achieved by marking some of the elements of the search tree with marker bits. We show that our approach does not affect the asymptotic logarithmic complexity for existing operations. At the same time, it is beneficial because the modified search tree can now efficiently support requests on predefined subsets of the search elements that it previously could not.
marker bits; search trees; data structures
Lubomir Stanchev (2011).
Efficient Access to Non-Sequential Elements of a Search Tree. The Third International Conference on Advances in Databases, Knowledge, and Data Applications. 181-185. St. MaartenThe Netherlands Antilles: International Academy, Research , and Industry Association.