Set-oriented disk access to large complex objects

G. Weikum
{"title":"Set-oriented disk access to large complex objects","authors":"G. Weikum","doi":"10.1109/ICDE.1989.47246","DOIUrl":null,"url":null,"abstract":"The use of set-oriented disk access whereby a variable-sized set of pages can be fetched or flushed to disk in a single call to the I/O system is proposed. This solution provides fast access to variable-length complex objects, yet retains the advantages of a page-structured buffer pool with a conventional frame size. A set-oriented I/O manager has been implemented in the Darmstadt database kernel system using the data-chained I/O method. Performance management indicate considerable enhancement of throughput as well as response time. In the experiments, set-oriented disk access for very large objects performed up to 25 times faster than conventional I/O.<<ETX>>","PeriodicalId":329505,"journal":{"name":"[1989] Proceedings. Fifth International Conference on Data Engineering","volume":"180 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"39","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1989] Proceedings. Fifth International Conference on Data Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDE.1989.47246","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 39

Abstract

The use of set-oriented disk access whereby a variable-sized set of pages can be fetched or flushed to disk in a single call to the I/O system is proposed. This solution provides fast access to variable-length complex objects, yet retains the advantages of a page-structured buffer pool with a conventional frame size. A set-oriented I/O manager has been implemented in the Darmstadt database kernel system using the data-chained I/O method. Performance management indicate considerable enhancement of throughput as well as response time. In the experiments, set-oriented disk access for very large objects performed up to 25 times faster than conventional I/O.<>
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
面向集的磁盘访问大型复杂对象
建议使用面向集合的磁盘访问,即在对I/O系统的单个调用中可以提取或刷新一组可变大小的页面到磁盘。该解决方案提供了对可变长度复杂对象的快速访问,同时保留了具有常规帧大小的页面结构缓冲池的优点。在Darmstadt数据库内核系统中,采用数据链式I/O方法实现了一个面向集合的I/O管理器。性能管理表明吞吐量和响应时间有了很大的提高。在实验中,对于非常大的对象,面向集合的磁盘访问执行速度比传统的I/ o快25倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Regeneration protocols for replicated objects SDDM-a prototype of a distributed architecture for database security Towards efficient algorithms for deadlock detection and resolution in distributed systems Performing operations over mismatched domains Relational division: four algorithms and their performance
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1