메뉴 건너뛰기




Volumn 53, Issue 1, 2000, Pages 73-82

Optimal binary vote assignment for replicated data

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA REDUCTION; DATA STRUCTURES;

EID: 0034225286     PISSN: 01641212     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0164-1212(00)00056-X     Document Type: Article
Times cited : (3)

References (14)
  • 1
    • 0024649607 scopus 로고
    • Performance characterization of quorum consensus algorithms for replicated data
    • Ahamad M., Ammar M.H. Performance characterization of quorum consensus algorithms for replicated data. IEEE Trans. Soft. Eng. 15:1989;492-496.
    • (1989) IEEE Trans. Soft. Eng. , vol.15 , pp. 492-496
    • Ahamad, M.1    Ammar, M.H.2
  • 2
    • 0000820549 scopus 로고    scopus 로고
    • Optimal availability quorum systems: Theory and practice
    • Amir Y., Wool A. Optimal availability quorum systems: theory and practice. Information Process. Lett. 65:1998;223-228.
    • (1998) Information Process. Lett. , vol.65 , pp. 223-228
    • Amir, Y.1    Wool, A.2
  • 4
    • 0019575397 scopus 로고
    • Concurrency control in distributed database systems
    • Bernstein P.A., Goodman N. Concurrency control in distributed database systems. ACM Computing Surveys. 13:1981;185-221.
    • (1981) ACM Computing Surveys , vol.13 , pp. 185-221
    • Bernstein, P.A.1    Goodman, N.2
  • 5
    • 0022216309 scopus 로고
    • Serializability theory for replicated databases
    • Bernstein P.A., Goodman N. Serializability theory for replicated databases. J. Comput. Syst. Sci. 31:1985;355-374.
    • (1985) J. Comput. Syst. Sci. , vol.31 , pp. 355-374
    • Bernstein, P.A.1    Goodman, N.2
  • 6
    • 0024733692 scopus 로고
    • Optimizing vote and quorum assignments for reading and writing replicated data
    • Cheung S.Y., Ahamad M., Ammar M.H. Optimizing vote and quorum assignments for reading and writing replicated data. IEEE Trans. Knowledge Data Eng. 1:1989;387-397.
    • (1989) IEEE Trans. Knowledge Data Eng. , vol.1 , pp. 387-397
    • Cheung, S.Y.1    Ahamad, M.2    Ammar, M.H.3
  • 8
    • 0022145769 scopus 로고
    • How to assign votes in a distributed system
    • Garcia-Molina H., Barbara D. How to assign votes in a distributed system. J. ACM. 32:1985;841-860.
    • (1985) J. ACM , vol.32 , pp. 841-860
    • Garcia-Molina, H.1    Barbara, D.2
  • 10
    • 0028336366 scopus 로고
    • Voting as the optimal pessimistic scheme for managing replicated data
    • Spasojevic M., Berman P. Voting as the optimal pessimistic scheme for managing replicated data. IEEE Trans. Parallel Distributed Syst. 5:1994;64-73.
    • (1994) IEEE Trans. Parallel Distributed Syst. , vol.5 , pp. 64-73
    • Spasojevic, M.1    Berman, P.2
  • 12
    • 0027578545 scopus 로고
    • Obtaining coteries that optimizing the availability of replicated databases
    • Tang J., Natarajan N. Obtaining coteries that optimizing the availability of replicated databases. IEEE Trans. Knowledge Data Eng. 5:1993;309-321.
    • (1993) IEEE Trans. Knowledge Data Eng. , vol.5 , pp. 309-321
    • Tang, J.1    Natarajan, N.2
  • 13
    • 0018480001 scopus 로고
    • A majority consensus approach to concurrency control for multiple copy databases
    • Thomas R.H. A majority consensus approach to concurrency control for multiple copy databases. ACM Trans. Database Syst. 4:1979;180-209.
    • (1979) ACM Trans. Database Syst. , vol.4 , pp. 180-209
    • Thomas, R.H.1
  • 14
    • 0026151577 scopus 로고
    • Vote assignments in weighted voting mechanisms
    • Tong Z., Kain R.Y. Vote assignments in weighted voting mechanisms. IEEE Trans. Comput. 40:1991;664-667.
    • (1991) IEEE Trans. Comput. , vol.40 , pp. 664-667
    • Tong, Z.1    Kain, R.Y.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.