Article

Free access

Optimal response time retrieval of replicated data (extended abstract)

Authors:

Ling Tony Chen,

Doron RotemAuthors Info & Claims

PODS '94: Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

Pages 36 - 44

https://doi.org/10.1145/182591.182596

Published: 24 May 1994 Publication History

PDF eReader

Abstract

This work deals with the problem of finding efficient access plans for retrieving a set of pages from a multi-disk system with replicated data. This paper contains two results related to this problem: (a) We solve the problem of finding an optimal access path by transforming it into a network flow problem. We also indicate how our method may be employed in dynamic environments where some (or all) of the disks have a preexisting load, are heterogeneous, and reside on different servers. (b) We present a lower bound for the worst case response time of a request under all replication schemes, and also discuss the replication scheme that results in this lower bound. We then use simulation to show how this replication scheme can also greatly reduce the average case response time.

References

[1]

D. Bitton and J. Gray. Disk Shadowing. In Proceedings of the i#th Conference on Very Large Data Bases, pages 331-338# August 1988.

Digital Library

Google Scholar

[2]

T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, 1990.

Digital Library

Google Scholar

[3]

L.T. Chen and D, Rotem. Declustering Objects for VisuMization. In Proceedings of the 19th VLDB, pages 85-96, August 1993.

Digital Library

Google Scholar

[4]

L. R. Ford and D. R. Fulkerson. Flows #n Networks. Princton University Press, 1962.

Crossref

Google Scholar

[5]

A. V. Goldberg, E. Tardos, and R. E. Tat'- jan. Network Flow Algorithms. Technical Report STAN-CS-89-1252, Computert Science Department, Stanford University, 1989.

Google Scholar

[6]

R. Lo and N. S. Matloff. A Probabilistic Limit on the Virtual Size of Replicated Disk Systems. IEEE Transactions on Knowledge Engineemng, 4(1):862-871, 1992.

Digital Library

Google Scholar

[7]

C. A. Polyzois, A. Bhide, and D. Dias. Disk Mirroring with Alternating Deferred Updates. In Proceedings of the 19th VLDB, pages 604-617, August 1993.

Digital Library

Google Scholar

[8]

D. Rotem and G. Schloss. I/C) Performance of Fully-Replicated Disk Systems. In Proceedings of the Second Workshop on the Management of Replicated Data, pages 68-73, November 1992.

Crossref

Google Scholar

Cited By

View all

Hall LHarris BTomes EAltiparmak NAnjum ASill AZhao XFarid MPallickara SCao J(2017)Big Data Aware Virtual Machine Placement in Cloud Data CentersProceedings of the Fourth IEEE/ACM International Conference on Big Data Computing, Applications and Technologies10.1145/3148055.3148057(209-218)Online publication date: 5-Dec-2017
https://dl.acm.org/doi/10.1145/3148055.3148057
Chen LZhao YYang YLv MChen DWu YWang J(2017)A query execution scheduling scheme for Impala systemConcurrency and Computation: Practice and Experience10.1002/cpe.439230:8Online publication date: 11-Dec-2017
https://doi.org/10.1002/cpe.4392
Ho LWu JLiu P(2017)Workload prediction and balance for distributed reachability processing for large‐scale attribute graphsConcurrency and Computation: Practice and Experience10.1002/cpe.434430:6Online publication date: 10-Oct-2017
https://doi.org/10.1002/cpe.4344
Show More Cited By

Index Terms

Optimal response time retrieval of replicated data (extended abstract)

Recommendations

Generalized Optimal Response Time Retrieval of Replicated Data from Storage Arrays

Declustering techniques reduce query response times through parallel I/O by distributing data among parallel disks. Recently, replication-based approaches were proposed to further reduce the response time. Efficient retrieval of replicated data from ...
Low cost management of replicated data
Data availability in replicated databases

Comments

Information & Contributors

Information

Published In

PODS '94: Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems

May 1994

313 pages

ISBN:0897916425

DOI:10.1145/182591

Chairman:
Victor Vianu
Univ. of California at San Diego, La Jolla

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 May 1994

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD/PODS94

Sponsor:

SIGMOD/PODS94: Joint ACM SIGMOD International Conference on Management of Data and ACM SIGMOD & ACM Symposium Principles of Database Systems

May 24 - 27, 1994

Minnesota, Minneapolis, USA

Acceptance Rates

PODS '94 Paper Acceptance Rate 28 of 117 submissions, 24%;

Overall Acceptance Rate 642 of 2,707 submissions, 24%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

18
Total Citations
View Citations
292
Total Downloads

Downloads (Last 12 months)24
Downloads (Last 6 weeks)3

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Hall LHarris BTomes EAltiparmak NAnjum ASill AZhao XFarid MPallickara SCao J(2017)Big Data Aware Virtual Machine Placement in Cloud Data CentersProceedings of the Fourth IEEE/ACM International Conference on Big Data Computing, Applications and Technologies10.1145/3148055.3148057(209-218)Online publication date: 5-Dec-2017
https://dl.acm.org/doi/10.1145/3148055.3148057
Chen LZhao YYang YLv MChen DWu YWang J(2017)A query execution scheduling scheme for Impala systemConcurrency and Computation: Practice and Experience10.1002/cpe.439230:8Online publication date: 11-Dec-2017
https://doi.org/10.1002/cpe.4392
Ho LWu JLiu P(2017)Workload prediction and balance for distributed reachability processing for large‐scale attribute graphsConcurrency and Computation: Practice and Experience10.1002/cpe.434430:6Online publication date: 10-Oct-2017
https://doi.org/10.1002/cpe.4344
Altiparmak NTosun A(2013)Generalized Optimal Response Time Retrieval of Replicated Data from Storage ArraysACM Transactions on Storage10.1145/2491472.24914749:2(1-36)Online publication date: 1-Jul-2013
https://dl.acm.org/doi/10.1145/2491472.2491474
Turk AOktay KAykanat C(2013)Query-Log Aware Replicated DeclusteringIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2012.11324:5(987-995)Online publication date: 1-May-2013
https://dl.acm.org/doi/10.1109/TPDS.2012.113
Ho LWu JLiu P(2013)Data Replication for Distributed Graph ProcessingProceedings of the 2013 IEEE Sixth International Conference on Cloud Computing10.1109/CLOUD.2013.55(319-326)Online publication date: 28-Jun-2013
https://dl.acm.org/doi/10.1109/CLOUD.2013.55
Altiparmak NTosun A(2012)Integrated Maximum Flow Algorithm for Optimal Response Time Retrieval of Replicated DataProceedings of the 2012 41st International Conference on Parallel Processing10.1109/ICPP.2012.34(11-20)Online publication date: 10-Sep-2012
https://dl.acm.org/doi/10.1109/ICPP.2012.34
Tosun A(2009)Divide-and-conquer scheme for strictly optimal retrieval of range queriesACM Transactions on Storage10.1145/1629075.16290775:3(1-32)Online publication date: 30-Nov-2009
https://dl.acm.org/doi/10.1145/1629075.1629077
Oktay KTurk AAykanat C(2009)Selective Replicated Declustering for Arbitrary QueriesProceedings of the 15th International Euro-Par Conference on Parallel Processing10.1007/978-3-642-03869-3_37(375-386)Online publication date: 23-Aug-2009
https://dl.acm.org/doi/10.1007/978-3-642-03869-3_37
Tosun A(2008)Multi-Site Retrieval of Declustered DataProceedings of the 2008 The 28th International Conference on Distributed Computing Systems10.1109/ICDCS.2008.72(486-493)Online publication date: 17-Jun-2008
https://dl.acm.org/doi/10.1109/ICDCS.2008.72
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Generalized Optimal Response Time Retrieval of Replicated Data from Storage Arrays

Low cost management of replicated data

Data availability in replicated databases

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Index Terms

Recommendations

Generalized Optimal Response Time Retrieval of Replicated Data from Storage Arrays

Low cost management of replicated data

Data availability in replicated databases

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations