메뉴 건너뛰기




Volumn 23, Issue 1, 1998, Pages 58-99

Safe Query Languages for Constraint Databases

Author keywords

Algorithms; H.2.1 Database Management : Logical Design; H.2.3 Database Management : Languages Datalog; Languages; Query languages; Theory; Verification

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; DISTRIBUTED DATABASE SYSTEMS; ALGORITHMIC LANGUAGES; COMPUTER SIMULATION; LOGIC PROGRAMMING;

EID: 0032010247     PISSN: 03625915     EISSN: None     Source Type: Journal    
DOI: 10.1145/288086.288088     Document Type: Article
Times cited : (23)

References (45)
  • 3
    • 0002198395 scopus 로고
    • Towards a theory of declarative knowledge
    • J. Minker, Ed. Morgan Kaufmann Publishers Inc., San Francisco, CA
    • APT, K. R., BLAIR, H. A., AND WALKER, A. 1988. Towards a theory of declarative knowledge. In Foundations of Deductive Databases and Logic Programming. J. Minker, Ed. Morgan Kaufmann Publishers Inc., San Francisco, CA., 89-148.
    • (1988) Foundations of Deductive Databases and Logic Programming , pp. 89-148
    • Apt, K.R.1    Blair, H.A.2    Walker, A.3
  • 4
    • 78449296490 scopus 로고
    • On the representation of infinite temporal data and queries
    • (Denver, CO, May 29-31, 1991). ACM Press, New York, NY
    • BAUDINET, M., NIÉZETTE, M., AND WOLPER, P. 1991. On the representation of infinite temporal data and queries (extended abstract). In Proceedings of the Conference on the Principles of Database Systems (Denver, CO, May 29-31, 1991). ACM Press, New York, NY, 280-290.
    • (1991) Proceedings of the Conference on the Principles of Database Systems , pp. 280-290
    • Baudinet, M.1    Niézette, M.2    Wolper, P.3
  • 7
    • 84976709371 scopus 로고
    • The Lyric language: Querying constraint objects
    • (San Jose, CA, May 23-25, 1995). M. Carey and D. Schneider, Eds. ACM Press, New York, NY
    • BRODSKY, A. AND KORNATZKY, Y. 1995. The Lyric language: querying constraint objects. In Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data (San Jose, CA, May 23-25, 1995). M. Carey and D. Schneider, Eds. ACM Press, New York, NY, 35-46.
    • (1995) Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data , pp. 35-46
    • Brodsky, A.1    Kornatzky, Y.2
  • 9
    • 0020166926 scopus 로고
    • Structure and complexity of relational queries
    • CHANDRA, A. AND HAREL, D. 1982. Structure and complexity of relational queries. J. Comput. Syst. Sci. 25, 99-128.
    • (1982) J. Comput. Syst. Sci. , vol.25 , pp. 99-128
    • Chandra, A.1    Harel, D.2
  • 11
    • 0027609181 scopus 로고
    • Finite representation of infinite query answers
    • June
    • CHOMICKI, J. AND IMIELINSKI, T. 1993. Finite representation of infinite query answers. ACM Trans. Database Syst. 18, 2 (June), 181-223.
    • (1993) ACM Trans. Database Syst. , vol.18 , Issue.2 , pp. 181-223
    • Chomicki, J.1    Imielinski, T.2
  • 12
    • 0025451309 scopus 로고
    • Constraint logic programming languages
    • July
    • COHEN, J. 1990. Constraint logic programming languages. Commun. ACM 33, 7 (July), 52-68.
    • (1990) Commun. ACM , vol.33 , Issue.7 , pp. 52-68
    • Cohen, J.1
  • 13
    • 0345371010 scopus 로고
    • Decision procedure for constraint based extensions of Datalog
    • F. Benhamou and A. Colmerauer, Eds. MIT Press series in logic programming. MIT Press, Cambridge, MA
    • COX, J. AND MCALOON, K. 1993. Decision procedure for constraint based extensions of Datalog. In Constraint Logic Programming: Selected Research. F. Benhamou and A. Colmerauer, Eds. MIT Press series in logic programming. MIT Press, Cambridge, MA., 17-32.
    • (1993) Constraint Logic Programming: Selected Research , pp. 17-32
    • Cox, J.1    Mcaloon, K.2
  • 15
    • 0001962748 scopus 로고
    • Embedding extensional finite sets in CLP
    • (Vancouver, BC, Canada, 26-29 Oct. 1993). D. Miller, Ed., MIT Press series in logic programming. MIT Press, Cambridge, MA
    • DOVIER, A. AND ROSSI, G. 1993. Embedding extensional finite sets in CLP. In Proceedings of the 1993 International Symposium on Logic Programming (Vancouver, BC, Canada, 26-29 Oct. 1993). D. Miller, Ed., MIT Press series in logic programming. MIT Press, Cambridge, MA, 540-556.
    • (1993) Proceedings of the 1993 International Symposium on Logic Programming , pp. 540-556
    • Dovier, A.1    Rossi, G.2
  • 16
    • 0346230211 scopus 로고
    • Tech. Rep. European Community Research Center
    • ECLIPSE 1994. Eclipse. Tech. Rep. European Community Research Center.
    • (1994) Eclipse
  • 17
    • 0041729346 scopus 로고
    • Conjunto: Constraint logic programming with finite set domains
    • (Melbourne, 1994). M. Bruynooghe, Ed. MIT Press, Cambridge, MA
    • GERVET, C. 1994. Conjunto: constraint logic programming with finite set domains. In Proceedings of the 1994 International Symposium on Logic Programming (Melbourne, 1994). M. Bruynooghe, Ed. MIT Press, Cambridge, MA, 339-358.
    • (1994) Proceedings of the 1994 International Symposium on Logic Programming , pp. 339-358
    • Gervet, C.1
  • 20
    • 0005367599 scopus 로고
    • Algebraic and calculus query languages for recursively typed complex objects
    • Aug.
    • HULL, R. AND SU, J. 1993. Algebraic and calculus query languages for recursively typed complex objects. J. Comput. Syst. Sci. 47, 1 (Aug.), 121-156.
    • (1993) J. Comput. Syst. Sci. , vol.47 , Issue.1 , pp. 121-156
    • Hull, R.1    Su, J.2
  • 29
    • 0025476212 scopus 로고
    • Logic programming with sets
    • Aug.
    • KUPER, G. M. 1990. Logic programming with sets. J. Comput. Syst. Sci. 41, 1 (Aug.), 44-64.
    • (1990) J. Comput. Syst. Sci. , vol.41 , Issue.1 , pp. 44-64
    • Kuper, G.M.1
  • 34
    • 0027906169 scopus 로고
    • A closed-form evaluation for Datalog queries with integer (gap)-order constraints
    • Aug. 2
    • REVESZ, P. Z. 1993. A closed-form evaluation for Datalog queries with integer (gap)-order constraints. Theor. Comput. Sci. 116, 1 (Aug. 2), 117-149.
    • (1993) Theor. Comput. Sci. , vol.116 , Issue.1 , pp. 117-149
    • Revesz, P.Z.1
  • 36
    • 84958052755 scopus 로고
    • Safe stratified Datalog with integer order programs
    • Proceedings of the First International Conference on Principles and Practice of Constraint Programming (Cassis, France, 1995), Springer-Verlag, Berlin, Germany
    • REVESZ, P. Z. 1995. Safe stratified Datalog with integer order programs. In Proceedings of the First International Conference on Principles and Practice of Constraint Programming (Cassis, France, 1995), Lecture Notes in Computer Science, vol. 976. Springer-Verlag, Berlin, Germany, 154-169.
    • (1995) Lecture Notes in Computer Science , vol.976 , pp. 154-169
    • Revesz, P.Z.1
  • 38
    • 0032010351 scopus 로고    scopus 로고
    • Safe stratified Datalog with integer order does not have syntax
    • Mar.
    • STOLBOUSHKIN, A. P. AND TAITSLIN, M. A. 1998. Safe stratified Datalog with integer order does not have syntax. ACM Trans. Database Syst. 23, 1 (Mar.).
    • (1998) ACM Trans. Database Syst. , vol.23 , Issue.1
    • Stolboushkin, A.P.1    Taitslin, M.A.2
  • 42
    • 0028548152 scopus 로고
    • On the power of rule-based query languages for nested data models
    • VADAPARTY, K. 1994. On the power of rule-based query languages for nested data models. J. Logic Program. 21, 3, 155-175.
    • (1994) J. Logic Program. , vol.21 , Issue.3 , pp. 155-175
    • Vadaparty, K.1
  • 43
    • 0017013056 scopus 로고
    • The semantics of predicate logic as a programming language
    • VAN EMDEN, M. AND KOWALSKI, R. 1976. The semantics of predicate logic as a programming language. J. ACM 23, 4, 733-742.
    • (1976) J. ACM , vol.23 , Issue.4 , pp. 733-742
    • Van Emden, M.1    Kowalski, R.2


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