DocumentCode
2084562
Title
Kakkot Tree — A Binary Search Tree with caching
Author
Ramachandran, R.
Author_Institution
Dept. of MCA, Sree Narayana Gurukulam Coll. of Eng., Ernakulam, India
fYear
2012
fDate
18-20 Dec. 2012
Firstpage
1
Lastpage
6
Abstract
Kakkot Tree is a Binary Searching Tree with the caching concept added. It is used to speed up the searching process that is carried on a Binary Search Tree. The time complexity of BST varies between O(n) and O(log n) depends upon the number of nodes that are present in left and right children. Kakkot Tree is a new data structure which is a variant of BST with some initial nodes which act like caching.
Keywords
cache storage; computational complexity; tree data structures; tree searching; Kakkot tree; binary search tree; caching concept; data structure; time complexity; Binary Search Tree; Caching; Data Structure; Kakkot Tree; Searching;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence & Computing Research (ICCIC), 2012 IEEE International Conference on
Conference_Location
Coimbatore
Print_ISBN
978-1-4673-1342-1
Type
conf
DOI
10.1109/ICCIC.2012.6510247
Filename
6510247
Link To Document