DocumentCode
1197042
Title
Persistently cached B-trees
Author
Kato, Kazuhiko
Author_Institution
Inst. of Inf. Sci. & Electron., Tsukuba Univ., Ibaraki, Japan
Volume
15
Issue
3
fYear
2003
Firstpage
706
Lastpage
720
Abstract
This paper presents an approach to enhancing B-tree indexing performance by using a replication technique called persistent caching. A notable feature of the approach is its compatibility with ordinary B-trees; it exploits only the otherwise unused area of each B-tree page, and the basic behavior of B-trees need not be changed. This paper evaluates the performance of persistently cached B-trees by showing the result of mathematical analysis and of experimental investigations.
Keywords
cache storage; database indexing; software performance evaluation; tree data structures; B-tree indexing performance; B-tree page; experiment; indexing structure; mathematical analysis; persistent caching; persistently cached B-trees; replication technique; storage management; Acceleration; Computer Society; Content management; Database systems; Indexing; Mathematical analysis; Navigation; Organizing; Performance analysis; Terminology;
fLanguage
English
Journal_Title
Knowledge and Data Engineering, IEEE Transactions on
Publisher
ieee
ISSN
1041-4347
Type
jour
DOI
10.1109/TKDE.2003.1198400
Filename
1198400
Link To Document