Bpoint-tree: An Indexing Structure for Efficient Search in Data Retrieval

The amount of cheap memory growing enables all data to be in main memory databases, this adds a critical performance advantage to the main memory databases. In order to keep and retrieve data effectively, indexing schemes/ systems have been proposed. However, existing indexing algorithms are poorly suited for effective search, not just because of the space efficiency, but also due to the fact that they are unable to execute per every query within a tight time budget. Satisfying such a standard requires a B-tree indexing algorithm to be capable of controlling its memory response time to provide superior search performance. The goal of this research is to present a new technique Bpoint-tree to enhance the effectiveness of indexing search with a new data structure to the conventional B-tree algorithm. The results of the Bpoint-tree performance have been compared to the conventional B-tree, they show that Bpoint-tree exceed the conventional B-tree. The results show that the Bpointtree is able to improve the indexing performance effectiveness.

[1]  C. Mohan,et al.  ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes , 1990, VLDB.

[2]  Ilsoo Ahn.  Performance modeling and access methods for temporal database management systems , 1986 .

[3]  Gerhard Weikum,et al.  Principles and realization strategies of multilevel transaction management , 1991, TODS.

[4]  Andreas Reuter,et al.  Transaction Processing: Concepts and Techniques , 1992 .

[5]  Elisa Bertino,et al.  An indexing techniques for object-oriented databases , 1991, [1991] Proceedings. Seventh International Conference on Data Engineering.

[6]  S. B. Yao,et al.  Efficient locking for concurrent operations on B-trees , 1981, TODS.

[7]  Bratin Saha,et al.  Open nesting in software transactional memory , 2007, PPOPP.

[8]  Jeffrey Scott Vitter,et al.  An efficient I/O interface for optical disks , 1985, TODS.

[9]  Volker Markl,et al.  Integrating the UB-Tree into a Database System Kernel , 2000, VLDB.

[10]  Dennis Shasha,et al.  A framework for the performance analysis of concurrent B-tree algorithms , 1990, PODS '90.

[11]  J. T. Robinson,et al.  On optimistic methods for concurrency control , 1979, TODS.

[12]  David B. Lomet,et al.  Key Range Locking Strategies for Improved Concurrency , 1993, VLDB.

[13]  Malcolm C. Easton,et al.  Key-Sequence Data Sets on Inedible Storage , 1986, IBM J. Res. Dev..

[14]  Amit Gupta,et al.  Implementing and Evaluating R-Tree Techniques on Concurrency Control and Recovery with Modifications on Nonspatial Domains , 2018 .

[15]  Weimin Li,et al.  Top-K Frequent Spatial-Temporal Words Query Based on R-Tree , 2018, 2018 IEEE 16th Intl Conf on Dependable, Autonomic and Secure Computing, 16th Intl Conf on Pervasive Intelligence and Computing, 4th Intl Conf on Big Data Intelligence and Computing and Cyber Science and Technology Congress(DASC/PiCom/DataCom/CyberSciTech).

[16]  Sethuraman Panchanathan,et al.  Review of Image and Video Indexing Techniques , 1997, J. Vis. Commun. Image Represent..

[17]  Peter Dadam,et al.  Designing DBMS support for the temporal dimension , 1984, SIGMOD '84.

[18]  Marios Hadjieleftheriou,et al.  R-Trees - A Dynamic Index Structure for Spatial Searching , 2008, ACM SIGSPATIAL International Workshop on Advances in Geographic Information Systems.

[19]  Kothuri Venkata Ravi Kanth,et al.  Quadtree and R-tree indexes in oracle spatial: a comparison using GIS data , 2002, SIGMOD '02.

[20]  Badrish Chandramouli,et al.  FASTER: An Embedded Concurrent Key-Value Store for State Management , 2018, Proc. VLDB Endow..

[21]  Sufyan Almajali,et al.  An Efficient Search for Context-Based Chatbots , 2018, 2018 8th International Conference on Computer Science and Information Technology (CSIT).

[22]  Rudolf Bayer,et al.  The Universal B-Tree for Multidimensional Indexing: general Concepts , 1997, WWCA.

[23]  Bingsheng He,et al.  Tree Indexing on Flash Disks , 2009, 2009 IEEE 25th International Conference on Data Engineering.

[24]  Dennis Shasha,et al.  A Symmetric Concurrent B-Tree Algorithm , 2011, Fall Joint Computer Conference.

[25]  Beng Chin Ooi,et al.  Query and Update Efficient B+-Tree Based Indexing of Moving Objects , 2004, VLDB.

[26]  Sufyan Almajali,et al.  A traffic tracking algorithm for a fast detection of active network sources , 2018, ICFNDS.

[27]  Tobin J. Lehman,et al.  The Design and Performance Evaluation of a Lock Manager for a Memory-Resident Database System , 1996, Performance of Concurrency Control Mechanisms in Centralized Database Systems.

[28]  Alistair Moffat,et al.  An Efficient Indexing Technique for Full Text Databases , 1992, Very Large Data Bases Conference.

[29]  Niklaus Wirth,et al.  Algorithms + Data Structures = Programs , 1976 .

[30]  Sunil Kumar Khatri,et al.  NLCS based string approximation for searching indexing keywords in B-tree , 2017, 2017 2nd International Conference on Telecommunication and Networks (TEL-NET).

[31]  Hans-Jörg Schek,et al.  Concepts and Applications of Multilevel Transactions and Open Nested Transactions , 1992, Database Transaction Models for Advanced Applications.

[32]  Rudolf Bayer,et al.  Concurrency of operations on B-trees , 1994, Acta Informatica.

[33]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[34]  R. Bayer,et al.  Organization and maintenance of large ordered indices , 1970, SIGFIDET '70.

[35]  Sam H. Noh,et al.  WORT: Write Optimal Radix Tree for Persistent Memory Storage Systems , 2017, FAST.