返回
摘要
En 中文
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.,
Keyword:
B-trees
B(+)-trees
database management system
secondary storage management
replication
persistent caching
complex objects
indexing structure
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.8K
被引数:
3.2W
机构
暂无机构信息
引用论文
Hippocampal polyamine levels and transglutaminase activity are paralleling spatial memory retrieval in the C57BL/6J mouse
Hippocampus
IF0
Resistance, reluctance and radicalism: A study of staff reaction to
the adoption of CALL/C&IT in modern languages departments
ReCALL
IF0

