Tree Data Structures and Efficient Indexing Techniques for Big Data Management: A Comprehensive Study

In the modern era where data is produced from multivariate sources, there is an urge to handle such data in an efficient yet effective manner. Therefore, applications that necessitate such capabilities shall make use of data structures and indexing mechanisms that can perform fast index operations along with low complexity as per insertion, deletion, and search. In this work, we survey B+ Tree, QuadTree, kD Tree, R Tree, and others along with efficient indexing techniques for big data management in order to provide a generic overview of the field to readers. Ultimately, we provide some indexing experiments as per insert operations and response times.