Bg-Tree--An Extended B-tree with Group Data Manipulating Abilities--
Summary :
This paper, presents an extended B-tree data structure and a series of algorithms for satisfying a new requirement of manipulating the concurrent group data at real time. By new algorithm the amount of readings and writings in the manipulation has been decreased greatly, and the efficiency of storage utilization has been increased. Discussion indicates that a database formed by the new data structure and new algorithm has the advantages of a lower tree height, a better efficiency of page utilization, and a little cost of operating overhead as compared to a database formed by B-tree and general algorithm.
- Publication
- IEICE TRANSACTIONS on Information Vol.E74-D No.8 pp.2419-2431
- Publication Date
- 1991/08/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Databases
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Wen GAO, Masao SAITO, "Bg-Tree--An Extended B-tree with Group Data Manipulating Abilities--" in IEICE TRANSACTIONS on Information,
vol. E74-D, no. 8, pp. 2419-2431, August 1991, doi: .
Abstract: This paper, presents an extended B-tree data structure and a series of algorithms for satisfying a new requirement of manipulating the concurrent group data at real time. By new algorithm the amount of readings and writings in the manipulation has been decreased greatly, and the efficiency of storage utilization has been increased. Discussion indicates that a database formed by the new data structure and new algorithm has the advantages of a lower tree height, a better efficiency of page utilization, and a little cost of operating overhead as compared to a database formed by B-tree and general algorithm.
URL: https://global.ieice.org/en_transactions/information/10.1587/e74-d_8_2419/_p
Copy
@ARTICLE{e74-d_8_2419,
author={Wen GAO, Masao SAITO, },
journal={IEICE TRANSACTIONS on Information},
title={Bg-Tree--An Extended B-tree with Group Data Manipulating Abilities--},
year={1991},
volume={E74-D},
number={8},
pages={2419-2431},
abstract={This paper, presents an extended B-tree data structure and a series of algorithms for satisfying a new requirement of manipulating the concurrent group data at real time. By new algorithm the amount of readings and writings in the manipulation has been decreased greatly, and the efficiency of storage utilization has been increased. Discussion indicates that a database formed by the new data structure and new algorithm has the advantages of a lower tree height, a better efficiency of page utilization, and a little cost of operating overhead as compared to a database formed by B-tree and general algorithm.},
keywords={},
doi={},
ISSN={},
month={August},}
Copy
TY - JOUR
TI - Bg-Tree--An Extended B-tree with Group Data Manipulating Abilities--
T2 - IEICE TRANSACTIONS on Information
SP - 2419
EP - 2431
AU - Wen GAO
AU - Masao SAITO
PY - 1991
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E74-D
IS - 8
JA - IEICE TRANSACTIONS on Information
Y1 - August 1991
AB - This paper, presents an extended B-tree data structure and a series of algorithms for satisfying a new requirement of manipulating the concurrent group data at real time. By new algorithm the amount of readings and writings in the manipulation has been decreased greatly, and the efficiency of storage utilization has been increased. Discussion indicates that a database formed by the new data structure and new algorithm has the advantages of a lower tree height, a better efficiency of page utilization, and a little cost of operating overhead as compared to a database formed by B-tree and general algorithm.
ER -
English
