메뉴 건너뛰기




Volumn , Issue , 2011, Pages 56-66

Scalable analysis of conceptual data models

Author keywords

conceptual modeling; databases; ORM; test data generation

Indexed keywords

CONCEPTUAL DATA MODELS; CONCEPTUAL MODEL; CONCEPTUAL MODELING; EMPIRICAL STUDIES; FOLLOW-UP STUDIES; MODELING NOTATION; MODELING TOOL; ORM; SCALABLE ANALYSIS; TEST DATA; TEST DATA GENERATION;

EID: 80051920135     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2001420.2001428     Document Type: Conference Paper
Times cited : (10)

References (22)
  • 5
    • 1842453058 scopus 로고    scopus 로고
    • An AGENDA for testing relational database applications
    • D. Chays et al. An AGENDA for testing relational database applications. Software Testing, Verification and Reliability, 14(1):17-44, 2004.
    • (2004) Software Testing, Verification and Reliability , vol.14 , Issue.1 , pp. 17-44
    • Chays, D.1
  • 6
    • 84976766949 scopus 로고
    • The entity-relationship model-toward a unified view of data
    • P. P.-S. Chen. The entity-relationship model-toward a unified view of data. ACM Transactions on Database Systems, 1(1):9-36, 1976.
    • (1976) ACM Transactions on Database Systems , vol.1 , Issue.1 , pp. 9-36
    • Chen, P.P.-S.1
  • 11
    • 33646695974 scopus 로고    scopus 로고
    • ORM 2 on the Move to Meaningful Internet Systems: OTM Workshop
    • Springer
    • T. Halpin. ORM 2. In On the Move to Meaningful Internet Systems: OTM Workshop, volume 3762 of LNCS, pages 676-687. Springer, 2005.
    • (2005) LNCS , vol.3762 , pp. 676-687
    • Halpin, T.1
  • 13
    • 77956762250 scopus 로고    scopus 로고
    • On interactions of cardinality constraints, key, and functional dependencies
    • Springer Berlin
    • S. Hartmann. On interactions of cardinality constraints, key, and functional dependencies. In Foundations of Information and Knowledge Systems, volume 1762, pages 136-155. Springer Berlin, 2000.
    • (2000) Foundations of Information and Knowledge Systems , vol.1762 , pp. 136-155
    • Hartmann, S.1
  • 16
    • 0003037529 scopus 로고
    • Reducibility among combinatorial problems
    • R. E. Miller and J. W. Thatcher, editors Plenum
    • R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85-103. Plenum, 1972.
    • (1972) Complexity of Computer Computations , pp. 85-103
    • Karp, R.M.1
  • 19
    • 0000149921 scopus 로고
    • Generating consistent test data: Restricting the search space by a generator formula
    • A. Neufeld, G. Moerkotte, and P. C. Lockemann. Generating consistent test data: restricting the search space by a generator formula. The VLDB Journal, 2(2):173-214, 1993.
    • (1993) VLDB Journal , vol.2 , Issue.2 , pp. 173-214
    • Neufeld, A.1    Moerkotte, G.2    Lockemann, P.C.3
  • 20
    • 60349086827 scopus 로고    scopus 로고
    • Scalable satisfiability checking and test data generation from modeling diagrams
    • Y. Smaragdakis, C. Csallner, and R. Subramanian. Scalable satisfiability checking and test data generation from modeling diagrams. Automated Software Engineering, 16:73-99, 2009.
    • (2009) Automated Software Engineering , vol.16 , pp. 73-99
    • Smaragdakis, Y.1    Csallner, C.2    Subramanian, R.3
  • 21
    • 85028449223 scopus 로고
    • Enhancing the quality of conceptual database specifications through validation
    • Springer Berlin
    • A. Zamperoni and P. Löhr-Richter. Enhancing the quality of conceptual database specifications through validation. In Proc. Entity-Relationship Approach, volume 823, pages 85-98. Springer Berlin, 1994.
    • (1994) Proc. Entity-Relationship Approach , vol.823 , pp. 85-98
    • Zamperoni, A.1    Löhr-Richter, P.2


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