Dissemin is shutting down on January 1st, 2025

Published in

Foundation of Computer Science, International Journal of Computer Applications, 2(41), p. 11-21

DOI: 10.5120/5512-7504

Links

Tools

Export citation

Search in Google Scholar

Comparison of Advance Tree Data Structures

Journal article published in 2012 by Parth Patel, Deepak Garg ORCID
This paper is made freely available by the publisher.
This paper is made freely available by the publisher.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Green circle
Postprint: archiving allowed
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

Abstract

Btree and Rtree are two basic index structures; many different variants of them are proposed after them. Different variants are used in specific application for the performance optimization. In this paper different variants of Btree and Rtree are discussed and compared. Index structures are different in terms of structure, query support, data type support and application. Index structures are discussed first. Btree and its variants are discussed and them Rtree and its variants are discussed. Some structures example is also shown for the more clear idea. Then comparison is made between all structure with respect to complexity, query type support, data type support and application.