.png){kind=icon}
返回
ESTIMATING BLOCK ACCESSES IN DATABASE ORGANIZATIONS
.png){kind=icon}
PRE
AI
DOI：10.1109/69.334866.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The exact expression for the expected number of disk accesses required to retrieve a given number of records, called the Yao function, requires iterative computations. Several authors have developed approximations to the Yao function, all of which have substantial errors in some situations. We derive and evaluate simple upper and lower bounds that never differ by more than a small fraction of a disk access.
Keyword:
BLOCK ACCESS ESTIMATION
YAO FUNCTION
ACCESS PATH SELECTION
PHYSICAL DATABASE DESIGN
PERFORMANCE ESTIMATION
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.8K
被引数:
3.2W
机构
暂无机构信息
引用论文
Resistance, reluctance and radicalism: A study of staff reaction to
the adoption of CALL/C&IT in modern languages departments.png)
ReCALL
ReCALLIF0
PREAI
分享收藏 没有更多内容
没有更多内容