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 条
  • [31] NLCS Based String Approximation For Searching Indexing Keywords in B-tree
    Sharma, Sahil
    Sharma, Mayank
    Jain, Rachna
    Khatri, Sunil Kumar
    2017 2ND INTERNATIONAL CONFERENCE ON TELECOMMUNICATION AND NETWORKS (TEL-NET), 2017, : 461 - 464
  • [32] A B-Tree Employing a Cascade Memory Node on NAND Flash SSDs
    Kim, Bo-Kyeong
    Yeo, Chang-Jun
    Lee, Dong-Ho
    2014 INTERNATIONAL CONFERENCE ON ELECTRONICS, INFORMATION AND COMMUNICATIONS (ICEIC), 2014,
  • [33] An efficient B-tree layer for flash-memory storage systems
    Wu, CH
    Chang, LP
    Kuo, TW
    REAL-TIME AND EMBEDDED COMPUTING SYSTEMS AND APPLICATIONS, 2003, 2968 : 409 - 430
  • [34] A Write-Optimized B-Tree Layer for NAND Flash Memory
    Gong, Xiaona
    Chen, Shuyu
    Lin, Mingwei
    Liu, Haozhang
    2011 7TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING (WICOM), 2011,
  • [35] Integer Representation and B-Tree for Classification of Text Documents: An Integrated Approach
    Bhushan, S. N. Bharath
    Danti, Ajit
    Fernandes, Steven Lawrence
    INFORMATION AND DECISION SCIENCES, 2018, 701 : 481 - 490
  • [36] An efficient B-tree layer implementation for flash-memory storage systems
    Wu, Chin-Hsien
    Kuo, Tei-Wei
    Chang, Li Ping
    ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS, 2007, 6 (03) : 19
  • [37] An efficient buffer management scheme for implementing a B-tree on NAND flash memory
    Lee, Hyun-Seob
    Park, Sangwon
    Song, Hajoo
    Lee, Dong-Ho
    EMBEDDED SOFTWARE AND SYSTEMS, PROCEEDINGS, 2007, 4523 : 181 - +
  • [38] TB±tree: Index Structure for Information Retrieval Systems
    Fekihal, Mabruk
    Jaluta, Ibrahim
    Saini, Dinesh Kumar
    2015 SECOND INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE, COMPUTER ENGINEERING, AND SOCIAL MEDIA (CSCESM), 2015, : 182 - 186
  • [39] A Proposal of B-Tree Based Routing Algorithm for Monitoring Systems with Regular Movements in MANETs
    Kim, Byoung-Kug
    Eom, Doo-Seop
    WIRELESS PERSONAL COMMUNICATIONS, 2013, 73 (03) : 517 - 534
  • [40] Group Key Management Scheme Based on B-Tree Topology in Ad Hoc Networks
    Ye, Yongfei
    Liu, Minghe
    Sun, Xinghua
    Gao, Yan
    PROCEEDINGS OF 2012 2ND INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT 2012), 2012, : 1676 - 1680