메뉴 건너뛰기




Volumn 59, Issue 1, 1999, Pages 1-28

Technique for proving decidability of containment and equivalence of linear constraint queries

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; EQUIVALENCE CLASSES; LINGUISTICS; NUMBER THEORY; POLYNOMIALS; THEOREM PROVING;

EID: 0033169437     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1999.1624     Document Type: Article
Times cited : (13)

References (50)
  • 2
    • 0018724359 scopus 로고
    • Efficient optimization of a class of relational expressions
    • Aho A. V., Sagiv Y., Ullman J. D. Efficient optimization of a class of relational expressions. ACM Trans. Database Systems. 4:1979;435-454.
    • (1979) ACM Trans. Database Systems , vol.4 , pp. 435-454
    • Aho, A.V.1    Sagiv, Y.2    Ullman, J.D.3
  • 3
    • 0000808583 scopus 로고
    • Equivalence among relational expressions
    • Aho A. V., Sagiv Y., Ullman J. D. Equivalence among relational expressions. SIAM J. Comput. 8:1979;218-246.
    • (1979) SIAM J. Comput. , vol.8 , pp. 218-246
    • Aho, A.V.1    Sagiv, Y.2    Ullman, J.D.3
  • 4
    • 0016070090 scopus 로고
    • Reversal-bounded multipushdown machines
    • Baker B., Book R. Reversal-bounded multipushdown machines. J. Comput. System Sci. 8:1974;315-332.
    • (1974) J. Comput. System Sci. , vol.8 , pp. 315-332
    • Baker, B.1    Book, R.2
  • 7
    • 0019072589 scopus 로고
    • Computable queries for relational data bases
    • Chandra A. K., Harel D. Computable queries for relational data bases. J. Comput System Sci. 21:1980;156-178.
    • (1980) J. Comput System Sci. , vol.21 , pp. 156-178
    • Chandra, A.K.1    Harel, D.2
  • 8
    • 84976766949 scopus 로고
    • The entity-relationship model - toward a unified view of data
    • Chen P. P.-S. The entity-relationship model - toward a unified view of data. ACM Trans. Database Systems. 1:1976;9-36.
    • (1976) ACM Trans. Database Systems , vol.1 , pp. 9-36
    • Chen, P.P.-S.1
  • 11
    • 0014797273 scopus 로고
    • A relational model of data for large shared data banks
    • Codd E. F. A relational model of data for large shared data banks. Comm. Assoc. Comput. Mach. 13:1970;377-387.
    • (1970) Comm. Assoc. Comput. Mach. , vol.13 , pp. 377-387
    • Codd, E.F.1
  • 13
    • 0344077147 scopus 로고    scopus 로고
    • Conjunctive query containment with respect to views and constraints
    • Dong G., Su J. Conjunctive query containment with respect to views and constraints. Inform. Process. Lett. 57:1996;95-102.
    • (1996) Inform. Process. Lett. , vol.57 , pp. 95-102
    • Dong, G.1    Su, J.2
  • 14
    • 0000918436 scopus 로고
    • An application of games to the completeness problem for formalized theories
    • Ehrenfeucht A. An application of games to the completeness problem for formalized theories. Fund. Math. 49:1961.
    • (1961) Fund. Math. , vol.49
    • Ehrenfeucht, A.1
  • 16
    • 0027906178 scopus 로고
    • Finite model theory - A personal perspective
    • Fagin R. Finite model theory - A personal perspective. Theoret. Comput. Sci. 116:1993;3-31.
    • (1993) Theoret. Comput. Sci. , vol.116 , pp. 3-31
    • Fagin, R.1
  • 17
    • 0002202224 scopus 로고
    • Super-exponential complexity of Presburger arithmetic
    • Fischer M. J., Rabin M. O. Super-exponential complexity of Presburger arithmetic. SIAM-AMS Proc. 7:1974;27-41.
    • (1974) SIAM-AMS Proc. , vol.7 , pp. 27-41
    • Fischer, M.J.1    Rabin, M.O.2
  • 18
    • 0002281468 scopus 로고
    • A decision procedure for the first order theory of real addition with order
    • Ferrante J., Rackoff C. W. A decision procedure for the first order theory of real addition with order. SIAM J. Comput. 4:1975;69-76.
    • (1975) SIAM J. Comput. , vol.4 , pp. 69-76
    • Ferrante, J.1    Rackoff, C.W.2
  • 19
    • 0002850509 scopus 로고
    • Sur les classifications des systèmes de relations
    • Fraïssé R. Sur les classifications des systèmes de relations. Publ. Sci. Univ. Alger. I:1954;1.
    • (1954) Publ. Sci. Univ. Alger. , vol.1 , pp. 1
    • Fraïssé, R.1
  • 21
    • 0001042546 scopus 로고
    • The complexity of Presburger arithmetic with bounded quantifier alternation depth
    • Fürer M. The complexity of Presburger arithmetic with bounded quantifier alternation depth. Theoret. Comput. Sci. 18:1982;105-111.
    • (1982) Theoret. Comput. Sci. , vol.18 , pp. 105-111
    • Fürer, M.1
  • 22
    • 77956947365 scopus 로고
    • On local and non-local properties
    • J. Stern. Amsterdam: North Holland
    • Gaifman H. On local and non-local properties. Stern J. Proc. Herbrand Symposium Logic Colloquium. 1981;105-135 North Holland, Amsterdam.
    • (1981) Proc. Herbrand Symposium Logic Colloquium , pp. 105-135
    • Gaifman, H.1
  • 23
    • 84976855725 scopus 로고
    • An NP-complete number-theoretic problem
    • Gurari E. M., Ibarra O. H. An NP-complete number-theoretic problem. Assoc. Comput. Mach. 26:1979;567-581.
    • (1979) Assoc. Comput. Mach. , vol.26 , pp. 567-581
    • Gurari, E.M.1    Ibarra, O.H.2
  • 24
    • 0019549914 scopus 로고
    • The complexity of decision problems for finite-turn multicounter machines
    • Gurari E. M., Ibarra O. H. The complexity of decision problems for finite-turn multicounter machines. J. Comput. System Sci. 22:1981;220-229.
    • (1981) J. Comput. System Sci. , vol.22 , pp. 220-229
    • Gurari, E.M.1    Ibarra, O.H.2
  • 25
    • 0020160105 scopus 로고
    • Two-way counter machines and diophantine equations
    • Gurari E. M., Ibarra O. H. Two-way counter machines and diophantine equations. J. Assoc. Comput. Mach. 29:1982;863-873.
    • (1982) J. Assoc. Comput. Mach. , vol.29 , pp. 863-873
    • Gurari, E.M.1    Ibarra, O.H.2
  • 27
    • 0031245267 scopus 로고    scopus 로고
    • Finitely representable databases
    • Grumbach S., Su J. Finitely representable databases. J. Comput. System Sci. 55:1997;273-298.
    • (1997) J. Comput. System Sci. , vol.55 , pp. 273-298
    • Grumbach, S.1    Su, J.2
  • 28
    • 0031076704 scopus 로고    scopus 로고
    • Queries with arithmetical constraints
    • Grumbach S., Su J. Queries with arithmetical constraints. Theoret. Comput. Sci. 173:1997;151-181.
    • (1997) Theoret. Comput. Sci. , vol.173 , pp. 151-181
    • Grumbach, S.1    Su, J.2
  • 29
    • 0002650529 scopus 로고
    • Model-theoretic methods in the study of elementary logic
    • J. Addison, L. Henkin, & A. Tarski. Amsterdam: North Holland
    • Hanf W. Model-theoretic methods in the study of elementary logic. Addison J., Henkin L., Tarski A. The Theory of Models. 1965;132-145 North Holland, Amsterdam.
    • (1965) The Theory of Models , pp. 132-145
    • Hanf, W.1
  • 30
    • 0019612794 scopus 로고
    • Database description with SDM: A semantic database model
    • Hammer M., McLeod D. Database description with SDM: A semantic database model. ACM Trans. Database Systems. 6:1981;351-386.
    • (1981) ACM Trans. Database Systems , vol.6 , pp. 351-386
    • Hammer, M.1    McLeod, D.2
  • 31
    • 84976713661 scopus 로고
    • Reversal-bounded multicounter machines and their decision problems
    • Ibarra O. H. Reversal-bounded multicounter machines and their decision problems. J. Assoc. Comput. Mach. 25:1978;116-133.
    • (1978) J. Assoc. Comput. Mach. , vol.25 , pp. 116-133
    • Ibarra, O.H.1
  • 32
    • 0029244263 scopus 로고
    • New decidability results concerning two-way counter machines
    • Ibarra O. H., Jiang T., Tran N., Wang H. New decidability results concerning two-way counter machines. SIAM J. Comput. 24:1995;123-137.
    • (1995) SIAM J. Comput. , vol.24 , pp. 123-137
    • Ibarra, O.H.1    Jiang, T.2    Tran, N.3    Wang, H.4
  • 35
    • 0023827554 scopus 로고
    • On conjunctive queries containing inequalities
    • Klug A. On conjunctive queries containing inequalities. J. Assoc. Comput. Mach. 35:1988;146-160.
    • (1988) J. Assoc. Comput. Mach. , vol.35 , pp. 146-160
    • Klug, A.1
  • 37
    • 0031245224 scopus 로고    scopus 로고
    • Query languages for bags and aggregate functions
    • Libkin L., Wong L. Query languages for bags and aggregate functions. J. Comput. System Sci. 55:1997;241-272.
    • (1997) J. Comput. System Sci. , vol.55 , pp. 241-272
    • Libkin, L.1    Wong, L.2
  • 38
    • 0001699148 scopus 로고
    • Recursive unsolvability of Post's problem of Tag and other topics in the theory of Turing machines
    • Minsky M. Recursive unsolvability of Post's problem of Tag and other topics in the theory of Turing machines. Ann. of Math. 74:1961;437-455.
    • (1961) Ann. of Math. , vol.74 , pp. 437-455
    • Minsky, M.1
  • 39
    • 0002217486 scopus 로고
    • Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt
    • Warsaw
    • M. Presburger, Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt, in C. R. Premier Congrès Math. Pays Slaves, Warsaw, 1929, pp. 92-101.
    • (1929) In C. R. Premier Congrès Math. Pays Slaves , pp. 92-101
    • Presburger, M.1
  • 42
    • 0027906169 scopus 로고
    • A closed form for datalog queries with integer (gap)-order constraints
    • Revesz P. Z. A closed form for datalog queries with integer (gap)-order constraints. Theoret. Comput. Sci. 116:1993;117-149.
    • (1993) Theoret. Comput. Sci. , vol.116 , pp. 117-149
    • Revesz, P.Z.1
  • 46
    • 0000680026 scopus 로고
    • The impossibility of an algorithm for the decision problem for finite models
    • Ttrakhtenbrot B. A. The impossibility of an algorithm for the decision problem for finite models. Dokl. Akad. Nauk SSSR. 70:1950;569-572.
    • (1950) Dokl. Akad. Nauk SSSR , vol.70 , pp. 569-572
    • Ttrakhtenbrot, B.A.1
  • 48
    • 84948958512 scopus 로고    scopus 로고
    • Information integration using logical views
    • p. 19-40
    • Ullman J. U. Information integration using logical views. Proc. Int. Conf. Database Theory. 1997;. p. 19-40.
    • (1997) Proc. Int. Conf. Database Theory
    • Ullman, J.U.1
  • 49
    • 0031078498 scopus 로고    scopus 로고
    • The complexity of querying indefinite data about linearly ordered domains
    • van der Meyden R. The complexity of querying indefinite data about linearly ordered domains. J. Comput. System Sci. 54:1997;113-135.
    • (1997) J. Comput. System Sci. , vol.54 , pp. 113-135
    • Van Der Meyden, R.1


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