Haim Gaifman
Moshe Y. Vardi
- 1 ~AB1TEBOUL, S. Boundedness is undecidable for Datalog programs with a single recursive ~rule. Inf. Proc. Lett. 32 (1989) 281-288. Google Scholar
- 2 ~mtto, m. V., SAGIV, Y., AND ULLMAN, J.D. Efficient optimization of a class of relational ~expression. ACM Trans. Datab. Syst. 4, 4 (Dec. 1979), 435-454. Google Scholar
- 3 ~AHO, A. V., AND ULLMAN, J.D. Universality of data retrieval languages. In Proceedings of ~the 6th ACM Symposium on Principles of Programming Languages (San Antonio, Tex., Jan. ~29-31). ACM, New York, 1979, pp. 110-117. Google Scholar
- 4 ~BANCILHON, F., AND RAMAKRISHNAN, R. An amateur's introduction to recursive query ~processing strategies. In Proceedings of the ACM Conference otl Management of Data ~(Washington, D.C., May 28-30), ACM, New York, 1986, pp. 16-52. Google Scholar
- 5 ~CHAKRAVARTHY, U. S., MINKER, J., AND GRANT, J. Semantic query optimization--additional ~constraints and control strategies. In Proceedings of the 2nd International Conference on Expert ~Database Systems (Charleston, S.C.). Benjamin Cummings, Menlo Park, Calif., 1986, pp. ~ 259-169.Google Scholar
- 6 ~CHANDRa, A.K. Programming primitives for database languages. In Proceedings of the 8th ~ Annual ACM Symposium 055 Principles of Programming Languages (Williamsburg, Va., Jan. ~26-28). ACM, New York, 1981, pp. 50 62. Google Scholar
- 7 ~CHANDRA, m. r., AND HAREL, D. Computable queries for relational databases. J. Comput. ~Syst. Sci. 21 (1980), 156-178.Google Scholar
- 8 ~CHANDRA, A. r., AND HAREL, D. Structure and complexity of relational queries. J. Comput. ~Syst. Sci. 25 (1982), 99-128.Google Scholar
- 9 ~CHANDR& A. K., AND HAREL, D. Horn-clause queries and generalizations. J. Logic Prog. 1 ~(1985), 1-15.Google Scholar
- 10 ~CHANDRA, A. K., AND MERLIN, P. M. Optimal implementation of conjunctive queries m ~relational databases. In Proceedings oJ the 9th Annual ACM Sympostunz on Theory of Comput- ~zng (Boulder, Colo., May 2-4). ACM, New York, 1977, pp. 77 90. Google Scholar
- 11 ~COSMADAKIS, S. S., GAIFMAN, n., I~NELLAKIS, P. C., AND VARDI, M.Y. Decidable optimiza- ~tion problems for database logic programs. In Proceedings of the 20th AnnualACM Symposu~m ~on Theory of Computing (Chicago, Ill., May 2 4). ACM, New York, 1988, pp. 477 490. Google Scholar
- 12 ~COSMADAKIS, S. S., KANELLAKIS, P. Parallel evaluation of recursive rule queries. In Proceed- ~rags of the 5th Annual ./tCM S1GACT-SIGMOD Symposium on Pnnciples of Database Systems ~(Cambridge, Mass., Mar. 24-26). ACM, New York, 1986, pp. 280-293. Google Scholar
- 13 ~DE ROUGEMONT, M. Uniform definability on finite structures with successor. In Proceedings ~of the 16th Annual/tCM Symposium on Theory of Computing (Washington, D.C., Apr. 30 May ~2). ACM, New York, 1984, pp. 409 417. Google Scholar
- 14 ~DREBEN, D., AND GOLDFARB, W. m. The Deczsion Problem: Solvable Classes of Quanafica- ~tlonal Fomudas. Addison-Wesley, Reading, Mass., 1979.Google Scholar
- 15 ~GAiFMAN, H., MAIRSON, H., SAGIV, Y., AND VARD1, M.Y. Undec~dable optimization prob- ~lems for database logic programs. In Proceedings oj the 2nd~4nnual IEEE Symposium on Logic ~in Computer Sctence (Ithaca, N.Y.). IEEE, New York, 1987, pp. 106-115.Google Scholar
- 16 ~GALLAIRE, IX{., AND M1NKER, J. Logic and Databases. Plenum Press, New York, 1978. Google Scholar
- 17 ~HENSCHEN, L. J., AND NAQVI, S.A. On compiling queries m recursive first-order databases. ~J./tCM 31, 1 {Jan. I984), 47-85. Google Scholar
- 18 ~HILLEBRAND, a., KANELLAKIS, P., MAiRSON, H., AND VARDI, M. Tools for Datalog bounded- ~ness. In Proceedings of the 10 Annual ,4CM S1GACT-SiGMOD-SIGART Symposium on ~Principles of Database Systems (Denver, Colo., May 29-31). ACM, New York, 1991, pp. 1-12. Google Scholar
- 19 ~HOPCROFT, J. E., AND ULLMAN, J. D. Introduction to ~4utomata Theory, Languages, and ~Computation. Addison-Wesley, Reading, Mass., 1979. Google Scholar
- 20 ~IMMERMAN, N. Relational queries computable in polynomial tlme. Inf. Cont. 68 (1986), ~86 104. Google Scholar
- 21 ~ IOANNIDIS, Y.E. A time bound on the materialization of some recursively defined views. In ~Proceedings of the }lth International Conference on Very Large Data Bases (Stockholm, Sweden). ~Morgan-Kaufmann, San Mateo, Calif., 1985, pp. 219-226.Google Scholar
- 22 ~ IOANNIDIS, Y. E. Bounded recursion in deductive databases. Algonthrnlca 1 (1986), pp. ~361-385.Google Scholar
- 23 ~JARKE, M., CLIFFORD, J., AND VASSILIOU, Y. An optimizing Prolog front-end to a relational ~query system. In Proceedzngs of the A CM Conference on Management of Data (Boston, Mass., ~June 18 21). ACM, New York, 1984, pp. 296-306. Google Scholar
- 24 ~ tC~,NELL^KIS, P, AND ABITEBOUL, S. Deciding bounded recursion in database logic programs. ~SIGACTNews 20 4 {Fall 1989), 17-23.Google Scholar
- 25 ~KOLAITiS, P. a., AND VARDI, M.Y. On the expressive power of Datalog--tools and a case ~study. J. Comput. Syst. Scz., to appear. Google Scholar
- 26 ~ LLOYD, J.W. Foundations of Logw Programming Springer-Verlag, New York, 1987. Google Scholar
- 27 ~MAIER, D., ULLMAN, J. D., AND VARDI, M.Y. On the foundations of the universal relation ~model. ACM Trans. Datab. Syst. 9 (1984), 283-308. Google Scholar
- 28 ~ MOSCHOVAKIS, Y.N. Elementary Inductton on Abstract Stntctures. North Holland, Amsterdam, ~The Netherlands, 1974. Google Scholar
- 29 ~ NAUGHTON, J. F. Data independent recursion in deductive databases. J. Comput. Syst. Sci. ~38 (1989), 259-289.Google Scholar
- 30 ~ NAUGHTON, J. F. Minimizing function-free recursive inference rules. Z ACM 36 1 (Jan. ~1989), 69-91. Google Scholar
- 31 ~ NAUGHTON, J. F., AND SAGIV, Y. Minimizing expansions of recursions. In Resolution of ~ Equations Ill Algebraic Stnwtures, vol. 1. H. Ait-Kaci and M. Nivat, Eds,, Academic Press, ~Orlando, Fla., 1989, pp. 321-349.Google Scholar
- 32 ~ NAUGHTON, J. F., AND SAGIV, Y. A simple characterization of uniform boundedness for a ~class of recursions. J. Logzc Prog. 10 (1991). 233-254. Google Scholar
- 33 ~ ROGERS, H.Hheo_rv oJ Recursive Functions and Eff~cttve ComputabiliO, McGraw-Hill, New ~ York, 1967. Google Scholar
- 34 ~S^GIV, Y. On bounded database schemes and bounded Horn-clause programs. SIAM J. ~Comput. 17 (1988), 1-22. Google Scholar
- 35 ~SAGIV, Y., AND VARDI, M.Y. Safety of Datalog queries over infinite databases. In Proceed- ~ings of the ACM SIGACT-S1GMOD-SIGART Synqgoszum on Pnnclples of Database Systems ~ (Phdadelphia, Pa., Mar. 29-31). ACM, New York, 1989, pp. 160-171. Google Scholar
- 36 ~ SHMUELI, O. Decidability and expressiveness aspects of logic queries. In Proceedings of tile ~6th ACM S1GACT-SIGMOD-SIGART 3)2mposium on Principles of Database Systems (San ~Diego, Cal., Mar. 23-25). ACM, New York, 1987, pp. 237-249. Google Scholar
- 37 ~ ULLMAN, J.D. Implementation of logical query languages for databases. ACM Trans. Datab. ~Syst. 10 3 (Sept. 1985), 289-321. Google Scholar
- 38 ~ ULLMAN, J.D. Principles of Database and Knowledge-Base Systems, vol. I. Computer Science ~Press, Rockville, Md., 1989. Google Scholar
- 39 ~ ULLMAN, J. D., AND VAN GELDER, A. Parallel complexity of logical query programs. ~Algorithmica 3 (1988), pp. 5-42.Google Scholar
- 40 ~ VARD1, M. Y. The complexity of relational query languages. In Proceedings of tile 14th ~AnnualACM Symposium on Theory of Computing (San Francisco, Calif, May 5-7). ACM, New ~York, 1982, pp. 137 146. Google Scholar
- 41 ~ VARDh M. Y. Decidability and undecidability results for boundedness of linear recursive ~queries. In Proceedings of the 7th ACM SIGACT-SIGMOD-SIGART Symposium on Principles ~of Database Systems (Austin, Tex., Mar. 21-23). ACM, New York, 1988, pp. 341 351. Google Scholar
- 42 ~ ZLOOF, M. Query-by-example: Operations on the transitive closure. IBM res. rep. RC5526. ~IBM Watson Research Center, Yorktown Heights, N.Y., 1976.Google Scholar
Index Terms
- Undecidable optimization problems for database logic programs
Recommendations
Optimizing existential queries in stratifiable deductive databases
SAC '05: Proceedings of the 2005 ACM symposium on Applied computingWe reconsider query evaluation in stratifiable deductive databases using Magic Sets. On the basis of the soft stratification approach, a new solution to the problem of optimizing existential queries in a set-oriented database language like Datalog is ...
Logic-Based Query Optimization for Object Databases
We present a technique for transferring query optimization techniques, developed for relational databases, into object databases. We demonstrate this technique for ODMG database schemas defined in ODL and object queries expressed in OQL. The object ...
Complexity and expressive power of logic programming
This article surveys various complexity and expressiveness results on different forms of logic programming. The main focus is on decidable forms of logic programming, in particular, propositional logic programming and datalog, but we also mention ...
Comments