Sequential retrieval of B-trees and a file structure with a dense B-tree index

Autor:	Tamamoto Hideo, Zhaoyang Ren
Rok vydání:	1999
Předmět:	Information retrieval Indexed file Computer science Flat file database Mechanical Engineering Key Sequenced Data Set computer.software_genre File format Data structure Inverted index B-tree Mechanics of Materials Data file Data_FILES General Materials Science Data mining computer
Zdroj:	Journal of Central South University of Technology. 6:67-72
ISSN:	1993-0666 1005-9784
DOI:	10.1007/s11771-999-0037-z
Popis:	A simple fast method is given for sequentially retrieving all the records in a B-tree. A file structure for database is proposed. The records in its primary data file are sorted according to the key order. A B-tree is used as its dense index. It is easy to insert, delete or search a record, and it is also convenient to retrieve records in the sequential order of the keys. The merits and efficiencies of these methods or structures are discussed in detail.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::daad02413cc825654c6021db596579fe https://doi.org/10.1007/s11771-999-0037-z Zobrazit plný text záznamu Full text from SpringerLink