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 条
  • [41] Modern B-tree techniques
    Graefe, Goetz
    Kuno, Harumi
    IEEE 27TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2011), 2011, : 1370 - 1373
  • [42] B-TREE ISAM CONCEPTS
    DEPPE, C
    BARTHOLOMEW, A
    DR DOBBS JOURNAL, 1983, 8 (06): : 18 - 21
  • [43] A GPU Multiversion B-Tree
    Awad, Muhammad A.
    Porumbescu, Serban D.
    Owens, John D.
    PROCEEDINGS OF THE 2022 31ST INTERNATIONAL CONFERENCE ON PARALLEL ARCHITECTURES AND COMPILATION TECHNIQUES, PACT 2022, 2022, : 481 - 493
  • [44] An analysis of anti-forensic capabilities of B-tree file system (Btrfs)
    Wani, Mohamad Ahtisham
    Bhat, Wasim Ahmad
    Dehghantanha, Ali
    AUSTRALIAN JOURNAL OF FORENSIC SCIENCES, 2020, 52 (04) : 371 - 386
  • [45] OPTIMAL B-TREE PACKING
    KLEIN, TM
    PARZYGNAT, KJ
    THARP, AL
    INFORMATION SYSTEMS, 1991, 16 (02) : 239 - 243
  • [46] Implicit B-trees:: a new data structure for the dictionary problem
    Franceschini, G
    Grossi, R
    Munro, JI
    Pagli, L
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2004, 68 (04) : 788 - 807
  • [47] AS B-tree: A Study of an Efficient B+-tree for SSDs
    Roh, Hongchan
    Kim, Sungho
    Lee, Daewook
    Park, Sanghyun
    JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2014, 30 (01) : 85 - 106
  • [48] B-TREES WITH LAZY PARENT SPLIT
    MANOLOPOULOS, Y
    INFORMATION SCIENCES, 1994, 79 (1-2) : 73 - 88
  • [49] Modern B-Tree Techniques
    Graefe, Goetz
    FOUNDATIONS AND TRENDS IN DATABASES, 2010, 3 (04): : 203 - 402
  • [50] Deleting keys of B-trees in parallel
    Park, H
    Park, K
    Cho, Y
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2004, 64 (09) : 1041 - 1050