Efficient disk allocation schemes for parallel retrieval of multidimensional grid data

Chung-Min Chen, R. Sinha, R. Bhatia
{"title":"Efficient disk allocation schemes for parallel retrieval of multidimensional grid data","authors":"Chung-Min Chen, R. Sinha, R. Bhatia","doi":"10.1109/SSDM.2001.938553","DOIUrl":null,"url":null,"abstract":"Declustering schemes enable parallel data retrieval by placing data blocks across multiple disk devices. Various declustering schemes have been proposed for multidimensional data to reduce the response time of range queries. However, efficient schemes, which must be easy to compute and provide good performance, are only known for a restricted number of disks and dimensions. In this paper, we propose a novel technique to construct efficient multidimensional declustering schemes, for any number of disks and dimensions. Simulation results show that the new schemes outperform the best previously-known non-exhaustive search-based multidimensional declustering schemes.","PeriodicalId":129323,"journal":{"name":"Proceedings Thirteenth International Conference on Scientific and Statistical Database Management. SSDBM 2001","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Thirteenth International Conference on Scientific and Statistical Database Management. SSDBM 2001","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SSDM.2001.938553","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Declustering schemes enable parallel data retrieval by placing data blocks across multiple disk devices. Various declustering schemes have been proposed for multidimensional data to reduce the response time of range queries. However, efficient schemes, which must be easy to compute and provide good performance, are only known for a restricted number of disks and dimensions. In this paper, we propose a novel technique to construct efficient multidimensional declustering schemes, for any number of disks and dimensions. Simulation results show that the new schemes outperform the best previously-known non-exhaustive search-based multidimensional declustering schemes.
多维网格数据并行检索的高效磁盘分配方案
聚类方案通过在多个磁盘设备上放置数据块来实现并行数据检索。为了减少范围查询的响应时间,针对多维数据提出了多种聚类方案。然而,高效的方案(必须易于计算并提供良好的性能)只适用于有限数量的磁盘和维度。在本文中,我们提出了一种新的技术来构造有效的多维聚类方案,适用于任意数量的磁盘和维度。仿真结果表明,新方案优于目前已知的基于非穷举搜索的最佳多维聚类方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信