Postprint version. Published in Third International Conference on Advances in Databases, Knowledge, and Data Applications Proceedings: St. Maarten, The Netherlands Antilles, January 23, 2011, pages 181-185.
The original version of this article may be found at https://www.thinkmind.org/index.php?view=article&articleid=dbkda_2011_9_10_30111.
NOTE: At the time of publication, the author was not yet affiliated with Cal Poly.
This article describes how a search tree can be extended in order to allow efﬁcient access to predeﬁned 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 beneﬁcial because the modiﬁed search tree can now efﬁciently support requests on predeﬁned subsets of the search elements that it previously could not.
© 2011 IARIA
Number of Pages
The author(s) of a manuscript agree that, if the manuscript is accepted for publication in IARIA journals, the published article will be copyrighted using a Creative Commons "Attribution-Non Commercial-Share Alike" license. This license allows the author(s) to retain the copyright, but also allows others to freely copy, distribute, and display the copyrighted work, and derivative works based upon it, under certain specified conditions.