Partial expansions for file organizations with an index
ACM Transactions on Database Systems (TODS)
Expected behaviour of B+-trees under random insertions
Acta Informatica
Performance enhancement through replication in an object-oriented DBMS
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Index scans using a finite LRU buffer: a validated I/O model
ACM Transactions on Database Systems (TODS)
Persistent Caching: An Implementation Technique for Complex Objects with Object Identity
IEEE Transactions on Software Engineering
ACM Computing Surveys (CSUR)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Time- and space-optimality in B-trees
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
Database System Concepts
Performance of B±Trees with Partial Expansions
IEEE Transactions on Knowledge and Data Engineering
B-tries for disk-based string management
The VLDB Journal — The International Journal on Very Large Data Bases
A rule based approach to network fault and security diagnosis with agent collaboration
AIS'04 Proceedings of the 13th international conference on AI, Simulation, and Planning in High Autonomy Systems
| Hi-index | 0.00 |
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.