Home // DBKDA 2011, The Third International Conference on Advances in Databases, Knowledge, and Data Applications // View article

Efficient Access to Non-Sequential Elements of a Search Tree

Authors:
Lubomir Stanchev

Keywords: marker bits; search trees; data structures

Abstract:
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.

Pages: 181 to 185

Copyright: Copyright (c) IARIA, 2011

Publication date: January 23, 2011

Published in: conference

ISSN: 2308-4332

ISBN: 978-1-61208-115-1

Location: St. Maarten, The Netherlands Antilles

Dates: from January 23, 2011 to January 28, 2011