Multi-Site Retrieval of Declustered Data

A. Tosun
{"title":"Multi-Site Retrieval of Declustered Data","authors":"A. Tosun","doi":"10.1109/ICDCS.2008.72","DOIUrl":null,"url":null,"abstract":"Declustering techniques reduce query response times through parallel I/O by distributing data among multiple devices. Recently, replication based approaches were proposed to further reduce the response time. All of the replication based schemes assume that replication is done at a single site. In this paper, we consider replicated data stored at multiple sites. We formulate multi-site retrieval problem as a maximum flow problem and solve it using maximum flow techniques. We propose a low complexity online algorithm for the problem. We investigate the proposed scheme using various replication schemes, query types and query loads. Proposed scheme can easily be extended to nonuniform data and to any number of sites. Experimental results show that replication using orthogonal allocation performs the best under various settings.","PeriodicalId":240205,"journal":{"name":"2008 The 28th International Conference on Distributed Computing Systems","volume":"62 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 The 28th International Conference on Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS.2008.72","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

Declustering techniques reduce query response times through parallel I/O by distributing data among multiple devices. Recently, replication based approaches were proposed to further reduce the response time. All of the replication based schemes assume that replication is done at a single site. In this paper, we consider replicated data stored at multiple sites. We formulate multi-site retrieval problem as a maximum flow problem and solve it using maximum flow techniques. We propose a low complexity online algorithm for the problem. We investigate the proposed scheme using various replication schemes, query types and query loads. Proposed scheme can easily be extended to nonuniform data and to any number of sites. Experimental results show that replication using orthogonal allocation performs the best under various settings.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
聚类数据的多站点检索
集群技术通过在多个设备之间分布数据,从而通过并行I/O减少查询响应时间。最近提出了基于复制的方法来进一步缩短响应时间。所有基于复制的模式都假设复制是在单个站点上完成的。在本文中,我们考虑存储在多个站点的复制数据。我们将多站点检索问题表述为最大流量问题,并利用最大流量技术进行求解。我们提出了一种低复杂度的在线算法。我们使用各种复制方案、查询类型和查询负载来研究所提出的方案。该方案可以很容易地扩展到非均匀数据和任意数量的站点。实验结果表明,在不同的条件下,正交分配的复制效果最好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Relative Network Positioning via CDN Redirections Compiler-Assisted Application-Level Checkpointing for MPI Programs Exploring Anti-Spam Models in Large Scale VoIP Systems Correlation-Aware Object Placement for Multi-Object Operations Probing Queries in Wireless Sensor Networks
×
引用
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