메뉴 건너뛰기




Volumn 26, Issue 1, 2001, Pages 1-40

Applying an update method to a set of receivers

Author keywords

Algorithms; Database Management; Database update; Languages; Order independence; Parallel update; Relational algebra; Schema coloring; Theory; Verification

Indexed keywords


EID: 0040152048     PISSN: 03625915     EISSN: None     Source Type: Journal    
DOI: 10.1145/383734.383735     Document Type: Article
Times cited : (2)

References (24)
  • 2
    • 0025499147 scopus 로고
    • Procedural languages for database queries and updates
    • ABITEBOUL, S. AND VIANU, V. 1990. Procedural languages for database queries and updates. J. Comput. Syst. Sci. 41, 2, 181-229.
    • (1990) J. Comput. Syst. Sci. , vol.41 , Issue.2 , pp. 181-229
    • Abiteboul, S.1    Vianu, V.2
  • 3
    • 0000808583 scopus 로고
    • Equivalences among relational expressions
    • AHO, A., SAGIV, Y., AND ULLMAN, J. 1979. Equivalences among relational expressions. SIAM. Comput. 8, 2, 218-246.
    • (1979) SIAM. Comput. , vol.8 , Issue.2 , pp. 218-246
    • Aho, A.1    Sagiv, Y.2    Ullman, J.3
  • 6
    • 84976850429 scopus 로고
    • Logical and computational aspects of programming with sets/bags/lists
    • LNCS 510, Springer
    • BREAZU-TANNEN, V. AND SUBRAHMANYAM, R. 1991. Logical and computational aspects of programming with sets/bags/lists. In Automata, Languages, and Programming, LNCS 510, Springer, 60-75.
    • (1991) Automata, Languages, and Programming , pp. 60-75
    • Breazu-Tannen, V.1    Subrahmanyam, R.2
  • 12
    • 84976745536 scopus 로고
    • On accessing object-oriented databases: Expressive power, complexity, and restrictions
    • Proceedings of the 1989 ACM SIGMOD International Conference on the Management of Data, J. Clifford, B. Lindsay, and D. Maier Eds.
    • HULL, R. AND SU, J. 1989. On accessing object-oriented databases: Expressive power, complexity, and restrictions. In Proceedings of the 1989 ACM SIGMOD International Conference on the Management of Data, J. Clifford, B. Lindsay, and D. Maier Eds. SIGMOD Rec. 18, 2 147-158.
    • (1989) SIGMOD Rec. , vol.18 , Issue.2 , pp. 147-158
    • Hull, R.1    Su, J.2
  • 13
    • 0003074949 scopus 로고
    • ILOG: Declarative creation and manipulation of object identifiers
    • D. McLeod, R. Sacks-Davis, and H. Schek Eds., Morgan Kaufmann
    • HULL, R. AND YOSHIKAWA, M. 1990. ILOG: Declarative creation and manipulation of object identifiers. In Proceedings of the 16th International Conference on Very Large Data Bases D. McLeod, R. Sacks-Davis, and H. Schek Eds., 455-468. Morgan Kaufmann.
    • (1990) Proceedings of the 16th International Conference on Very Large Data Bases , pp. 455-468
    • Hull, R.1    Yoshikawa, M.2
  • 14
    • 0021375730 scopus 로고
    • Testing containment of conjunctive queries under functional and inclusion dependencies
    • JOHNSON, D. AND KLUG, A. 1984. Testing containment of conjunctive queries under functional and inclusion dependencies. J. Comput. Syst. Sci. 28, 167-189.
    • (1984) J. Comput. Syst. Sci. , vol.28 , pp. 167-189
    • Johnson, D.1    Klug, A.2
  • 15
    • 0023827554 scopus 로고
    • On conjunctive queries containing inequalities
    • KLUG, A. 1988. On conjunctive queries containing inequalities. J. ACM 35, 1, 146-160.
    • (1988) J. ACM , vol.35 , Issue.1 , pp. 146-160
    • Klug, A.1
  • 17
    • 84976852216 scopus 로고
    • Mapping a semantic database model to the relational model
    • Proceedings of the ACM SIGMOD 1987 Annual Conference, U. Dayal and I. Traiger Eds.
    • LYNGBAEK, P. AND VIANU, V. 1987. Mapping a semantic database model to the relational model. In Proceedings of the ACM SIGMOD 1987 Annual Conference, U. Dayal and I. Traiger Eds. SIGMOD Rec. 16, 3 132-142.
    • (1987) SIGMOD Rec. , vol.16 , Issue.3 , pp. 132-142
    • Lyngbaek, P.1    Vianu, V.2
  • 19
    • 0003729926 scopus 로고
    • The expressive power of the bounded-iteration construct
    • QIAN, X. 1991. The expressive power of the bounded-iteration construct. Acta Informatica 28, 631-656.
    • (1991) Acta Informatica , vol.28 , pp. 631-656
    • Qian, X.1
  • 20
    • 84976685263 scopus 로고
    • Equivalence among relational expressions with the union and difference operators
    • SAGIV, Y. AND YANNAKAKIS, M. 1980. Equivalence among relational expressions with the union and difference operators. J. ACM 27, 4, 633-655.
    • (1980) J. ACM , vol.27 , Issue.4 , pp. 633-655
    • Sagiv, Y.1    Yannakakis, M.2
  • 22
    • 85034855624 scopus 로고
    • Deciding whether a production rule is relational computable
    • LNCS 326 M. Gyssens, J. Paredaens, and D. Van Gucht Eds. Springer
    • SIMON, E. AND DE MAINDREVILLE, C. 1988. Deciding whether a production rule is relational computable. In ICDT'88, LNCS 326 M. Gyssens, J. Paredaens, and D. Van Gucht Eds. Springer, 205-222.
    • (1988) ICDT'88 , pp. 205-222
    • Simon, E.1    De Maindreville, C.2
  • 24
    • 22044442681 scopus 로고    scopus 로고
    • Converting untyped formulas into typed ones
    • VAN DEN BUSSCHE, J. AND CABIBBO, L. 1998. Converting untyped formulas into typed ones. Acta Informatica 35, 8, 637-643.
    • (1998) Acta Informatica , vol.35 , Issue.8 , pp. 637-643
    • Van Den Bussche, J.1    Cabibbo, L.2


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