This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Storage Efficient and Secure Replicated Distributed Databases
April 1994 (vol. 6 no. 2)
pp. 337-341

Data availability and security are two important issues in a distributed database system. Existing schemes achieve high availability at the expense of higher storage cost and data security at the expense of higher processing cost. We develop an integrated methodology that combines the features of some existing schemes dealing with data fragmentation, data encoding, partial replication, and quorum consensus concepts to achieve storage efficient, highly available, and secure distributed database systems.

[1] A. El Abbadi and S. Toueg, "Maintaining availability in partitioned replicated databases,"ACM Trans. Database Syst., vol. 14, no. 2, pp. 264-290, June 1989.
[2] D. Agrawal and A. El Abbadi, "Integrating security with fault-tolerant distributed databases,"Comput. J., vol. 33, no. 1, pp. 71-78, Feb. 1990.
[3] D. Agrawal and A. El Abbadi, "Storage efficient replicated databases,"IEEE Trans. Knowledge Data Eng., vol. 2, no. 3, pp. 342-352, Sept. 1990.
[4] S. Y. Cheung, M. Ahamad, and M. H. Ammar, "Optimizing vote and quorum assignments for reading and writing replicated data,"IEEE Trans. Knowledge Data Eng., vol. 1, no. 3, pp. 387-397, Sept. 1989.
[5] D.E. Denning,Cryptography and Data Security, Addison-Wesley Publishing Co., Reading, Mass., 1982.
[6] H. Garcia-Molina and D. Barbara, "How to assign votes in a distributed systems,"J. ACM, vol. 32, no. 4, pp. 841-860, Oct. 1985.
[7] D. Gifford, "Weighted voting for replicated data," inProc. 7th ACM Symp. Oper. Syst. Principles, Dec. 1979, pp. 150-162.
[8] S. Jajodia and D. Mutchler, "Dynamic voting algorithms for maintaining consistency of a replicated database,"ACM Trans. Database Syst., vol. 15, no. 2, June 1990.
[9] T. F. Lunt, D. E. Denning, R. R. Schell, M. Heckman, and W. R. Shockley, "The Sea View security model,"IEEE Trans. Software Eng., vol. 16, pp. 593-607, June 1990.
[10] J.-F. Paris, "Voting with witnesses: A consistency scheme for replicated files," inProc. 6th Conf. Dist. Comput. Syst., June 1986, pp. 606-612.
[11] J. F. Paris and D. Long, "Efficient dynamic voting," inProc. Fourth IEEE Int. Conf. Data Eng., Los Angeles, CA, Jan. 1988.
[12] M. O. Rabin, "Efficient dispersal of information for security, load balancing, and fault tolerance,"J. ACM, vol. 36, no. 2, Apr. 1989.
[13] B. Randell and J. Dobson, "Reliability and security issues in distributed computing systems," inProc. 5th Symp. Reliability in Distributed Software and Database Syst., 1986, pp. 113-118.
[14] R. Thomas, "A majority consensus approach to concurrency control,"ACM Trans. Database Syst., vol. 4, pp. 180-209, June 1979.
[15] G. T. Wuu and A. J. Bernstein, "Efficient solutions to the replicated log and dictionary problems," inProc. Third ACM Symp. Priniciples Distributed Comput., Aug. 1984, pp. 233-242.

Index Terms:
distributed databases; software reliability; security of data; data integrity; encoding; storage allocation; storage efficient distributed DBMS; secure replicated distributed databases; data availability; distributed database system; storage cost; processing cost; integrated methodology; data fragmentation; data encoding; partial replication; quorum consensus concepts; secure distributed DBMS
Citation:
R. Mukkamala, "Storage Efficient and Secure Replicated Distributed Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 6, no. 2, pp. 337-341, April 1994, doi:10.1109/69.277777
Usage of this product signifies your acceptance of the Terms of Use.