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

被引：0
|
作者：
Zhaoyang Ren
Tamamoto Hideo
机构：
[1] Central South University of Technology,College of Information Engineering
[2] Akita University,Department of Information Engineering
来源：
Journal of Central South University of Technology | 1999年 / 6卷 / 1期
关键词：
B-tree; B; -tree; data structure; file organization; retrieval method;
D O I：
10.1007/s11771-999-0037-z
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：67 / 72
页数：5
相关论文
共 50 条
  • [21] A Reliable B-Tree Implementation over Flash Memory
    Xiang, Xiaoyan
    Yue, Lihua
    Liu, Zhanzhan
    Wei, Peng
    APPLIED COMPUTING 2008, VOLS 1-3, 2008, : 1487 - 1491
  • [22] clfB-tree: Cacheline Friendly Persistent B-tree for NVRAM
    Kim, Wook-Hee
    Seo, Jihye
    Kim, Jinwoong
    Nam, Beomseok
    ACM TRANSACTIONS ON STORAGE, 2018, 14 (01)
  • [23] Engineering a High-Performance GPU B-Tree
    Awad, Muhammad A.
    Ashkiani, Saman
    Johnson, Rob
    Farach-Colton, Martin
    Owens, John D.
    PROCEEDINGS OF THE 24TH SYMPOSIUM ON PRINCIPLES AND PRACTICE OF PARALLEL PROGRAMMING (PPOPP '19), 2019, : 145 - 157
  • [24] ON GENERATING B-TREES WITH CONSTANT AVERAGE DELAY AND IN LEXICOGRAPHIC ORDER
    BELBARAKA, M
    STOJMENOVIC, I
    INFORMATION PROCESSING LETTERS, 1994, 49 (01) : 27 - 32
  • [25] A Case for Space Compaction of B-Tree Nodes on Flash Storage
    Lee, Bo-Hyun
    An, Mijin
    Lee, Sang-Won
    IEEE ACCESS, 2023, 11 : 38149 - 38156
  • [26] Analysis and Comparison of Binary and Interpolation Search Algorithms in a B-tree
    Salakos, Sotirios
    Ploskas, Nikolaos
    25TH PAN-HELLENIC CONFERENCE ON INFORMATICS WITH INTERNATIONAL PARTICIPATION (PCI2021), 2021, : 74 - 78
  • [27] Hybridization of B-Tree and HashMap for Optimized Search Engine Indexing
    Jantkal, Bhagyashri Anand
    Deshpande, Santosh L.
    PROCEEDINGS OF THE 2017 INTERNATIONAL CONFERENCE ON SMART TECHNOLOGIES FOR SMART NATION (SMARTTECHCON), 2017, : 401 - 404
  • [28] Concurrency control and performance evaluation of parallel B-tree structures
    Miyazaki, J
    Yokota, H
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2002, E85D (08) : 1269 - 1283
  • [29] Secondary Indexing in One Dimension: Beyond B-trees and Bitmap Indexes
    Pagh, Rasmus
    Satti, Srinivasa Rao
    PODS'09: PROCEEDINGS OF THE TWENTY-EIGHTH ACM SIGMOD-SIGACT-SIGART SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS, 2009, : 177 - 185
  • [30] The string B-tree: A new data structure for string search in external memory and its applications
    Ferragina, P
    Grossi, R
    JOURNAL OF THE ACM, 1999, 46 (02) : 236 - 280
12345