An Approach to Adaptive Locality Based Maintenance of Correlated Data

Abstract

Operations performed in a Binary Search Tree generally starts from root node. As result search space (total number of nodes) constitutes entire tree, where a normal users intention is only certain part of the tree. In this paper we propose a noble method for performing operations such as insertion, deletion and retrieval within the local search space of a lookup node rather than the root node. To define local search space of a node, we implement leaf nodes null pointers, which are generally remains unused. These local search spaces divides the actual search space which generally constitutes entire tree. Hence complexity reduced to O(log m) from O(log n) for a local node, where m is the number of nodes present in sub tree formed by local search space and n is the number of nodes present in the tree.