Progress in Machines and Systems

DLINE Journals portal

Home

New Journals

Browse Journals

Journal Prices

For Authors

Print ISSN:
Online ISSN:

About JIO
	DLINE Portal Home Home Aims & Scope Editorial Board Current Issue Next Issue Previous Issue Sample Issue Upcoming Conferences Self-archiving policy Alert Services Be a Reviewer Publisher Paper Submission Subscription Contact us

How To Order
	Order Online Price Information Request for Complimentary Print Copy

For Authors
	Guidelines for Contributors Online Submission Call for Papers Author Rights

RELATED JOURNALS

Journal of Digital Information Management (JDIM)

Journal of Multimedia Processing and Technologies (JMPT)

International Journal of Web Application (IJWA)

Progress in Machines and Systems

New Index Structure with External Merges of Unlimited Data Volume

Iliya Tronkov
Faculty of Computer Systems and Technologies Technical University of Gabrovo Bulgaria

Abstract: In the current paper, we have described a new index data structure that can integrate external merges. The proposed index is based on intervals of keys. The system is based on the message system that draw from buffer based trees and also allows the multiway merging of buffers. It further permits the merging of limited number of input output functions. We have introduced the approach that includes the single system that indicate the relations. In this study we have added the analysis of B+-tree, Buffer Trees, LSM-tree, Fractal Index Tree, WaterfallTree, where the current one studies the number of input/output functions. The proposed index structure allows the more volume of input data and can respond to multiple queries.

Keywords: Database, Benchmark, Index Data Structure, Indexing, Comparative Analysis New Index Structure with External Merges of Unlimited Data Volume

DOI:https://doi.org/10.6025/pms/2022/11/1/1-8

Full_Text PDF 1.14 MB Download: 5 times

References:

[1] Bayer, R., McCreight, E. (1972). Organization and Maintenance of Large Ordered Indexes, Acta Informatica, Volume 1, 173–189, 1972.
[2] Comer, D. (1979). The Ubiquitous B-Tree, Computing Surveys, 11 (2) June 1979.
[3] Knuth. D. E. (1973). Sorting and Searching, volume 3 of The Art of Computer Programming, vol. 3, Massachusetts: Addison- Wesley.
[4] Arge, L. (1995). The Buffer Tree: A New Technique for Optimal, Algorithms and Data Structures, 955, 334-345.
[5] Arge, L. (2003). The buffer tree: A technique for designing, Algorithmica, vol. 37, pp. 1-24, September.
[6] Bender, M. A., Farach-Colton, M., Fineman, J. T., Fogel, B. C. K. Y., Nelson, J. (2007). Cache-oblivious streaming B-trees. In: Proceedings of the Nineteenth ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 81-92, June 9–11, 2007.
[7] Tronkov, I. (2014). WaterfallTree — External indexing data structure, in Automation, Quality and Testing, Robotics, 2014 IEEE, Cluj-Napoca.
[8] Tronkov, I. (2014). Mathematics behind WaterfallTree, in International scientific conference UNITECH, Gabrovo.
[9] Tronkov, I. (2014). WaterfallTree implementation details, in International scientific conference UNITECH, Gabrovo.
[10] O’Neil, P., Cheng, E., Gawlick, D., O’Neil, E. The logstructured merge-tree (LSM-tree), Acta Informatica, 33, 351-385, June.
[11] Chang, F., Dean, J., Ghemawat, S., Hsieh, W. C., Wallach, D. A., Burrows, M., Chadra, T., Fikes, A., Gruber, R. E. Bigtable: A distributed storage system for structured data, ACM Transactions on Computer Systems, 26 (2) June.

DLINE Journals portal