Optimal Allocation for Partially Replicated Database Systems on Ring Networks.

@article{DBLP:journals/tkde/StephensYH94,
  author    = {A. B. Stephens and
               Yelena Yesha and
               Keith E. Humenik},
  title     = {Optimal Allocation for Partially Replicated Database Systems
               on Ring Networks},
  journal   = {IEEE Trans. Knowl. Data Eng.},
  volume    = {6},
  number    = {6},
  year      = {1994},
  pages     = {975-982},
  ee        = {db/journals/tkde/StephensYH94.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1994 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

Joint ACM SIGMOD / IEEE Computer Society Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An3-3 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD2 or /dvd

References

[1]

Amr El Abbadi, Sam Toueg: Maintaining Availability in Partitioned Replicated Databases. ACM Trans. Database Syst. 14(2): 264-290(1989) BibTeX

[2]

Hagit Attiya, Marc Snir, Manfred K. Warmuth: Computing on an anonymous ring. J. ACM 35(4): 845-875(1988) BibTeX

[3]

Philip A. Bernstein, Nathan Goodman: Serializability Theory for Replicated Databases. J. Comput. Syst. Sci. 31(3): 355-374(1985) BibTeX

[4]

...

[5]

Stefano Ceri, Giancarlo Martella, Giuseppe Pelagatti: Optimal File Allocation in a Computer Network: a Solution Method Based on the Knapsack Problem. Computer Networks 6(5): 345-357(1982) BibTeX

[6]

...

[7]

Susan B. Davidson: Optimism and Consistency In Partitioned Distributed Database Systems. ACM Trans. Database Syst. 9(3): 456-481(1984) BibTeX

[8]

Lawrence W. Dowdy, Derrell V. Foster: Comparative Models of the File Assignment Problem. ACM Comput. Surv. 14(2): 287-313(1982) BibTeX

[9]

Derek L. Eager, Kenneth C. Sevcik: Achieving Robustness in Distributed Database Systems. ACM Trans. Database Syst. 8(3): 354-381(1983) BibTeX

[10]

Marshall L. Fisher, Dorit S. Hochbaum: Database Location in Computer Networks. J. ACM 27(4): 718-735(1980) BibTeX

[11]

David K. Gifford: Weighted Voting for Replicated Data. SOSP 1979: 150-162 BibTeX

[12]

Oded Goldreich, Liuba Shrira: On the Complexity of Computation in the Presence of Link Failures: The Case of a Ring. Distributed Computing 5: 121-131(1991) BibTeX

[13]

...

[14]

Samy A. Mahmoud, J. Spruce Riordon: Optimal Allocation of Resources in Distributed Information Networks. ACM Trans. Database Syst. 1(1): 66-78(1976) BibTeX

[15]

Howard L. Morgan, K. Dan Levin: Optimal Program and Data Locations in Computer Networks. Commun. ACM 20(5): 315-322(1977) BibTeX

[16]

C. V. Ramamoorthy, Benjamin W. Wah: The Isomorphism of Simple File Allocation. IEEE Trans. Computers 32(3): 221-232(1983) BibTeX

[17]

...

[18]

Ouri Wolfson, Amir Milo: The Multicast Policy and Its Relationship to Replicated Data Placement. ACM Trans. Database Syst. 16(1): 181-205(1991) BibTeX