Towards an Algebraic Theory of Recursion

Journal of the ACM (JACM)

Volumn 38, Issue 2, 1991, Pages 329-381

  Ioannidis, Yannis E ^a   Wong, Eugene ^b  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0142043259     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/103516.103521     Document Type: Article

References (57)

1. AGRAWAL, R., AND DEVANBU, P. Moving selections into linear least fixpoint queries. IEEE Trans. Knowl. Data Eng 1, 4 (Dec. 1989), 424-432.
2. AHO, A., HOPCROFT, J., AND ULLMAN, J. D. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.
3. AHO, A., AND ULLMAN. J. Universality of data retrieval languages. In Proceeding of the 6th ACM Symposium on Principles of Programming Languages (San Antonio, Tex., Jan.). ACM, New York, 1979, pp. 110-117.
4. APT, K. R., AND VANEMDEN, M. H. Contributions to the theory of logic programming. JACM 29, 3 (July 1982), 841-862.
5. BACKHOUSE, R. C., AND CARRE, B. A. Regular algebra applied to path-finding problems. J. Inst. Math. Appl. 15. 2 (Apr. 1975), 161-186.
6. BANCILHON, F. Noise evaluation of recursively defined relations. In M. Brodie and J. Mylopoulos, eds., On Knowledge Base Management: Integrated Artificial Intelligence and Database Technologies. Springer-Verlag, New York, 1986.
7. BANCILHON, F., MAIER, D., SAGIV, Y., AND ULLMAN, J. D. Magic sets and other strange ways to implement logic programs. In Proceedings of the 5th ACM SIGMOD-SIGACT Symposium on Principles of Database System (Cambridge, Mass., Mar.). ACM, New York. 1986, pp. 1-15.
8. BANCILHON, F., AND RAMAKRISHNAN, R. An amateur'r introduction to recursive query processing strategies. In Proceedings of the 1986 ACM-SIGMOD Conference on the Management of Data (Washington, D.C., May). ACM. New York. 1986, pp. 16-52.
9. BANCILHON, F. AND RAMAKRISHNAN, R. Performance evaluation of data intensive logic programs. In J. Minker, ed., Foundations of Deductive Databases and Logic Programming, Morgan-Kaufmann, San Mateo. Calif., 1988, pp. 439-517.
10. BEERI, C., KANELLAKIS P., BANCILHON, F., AND RAMAKRISHNAN, R. Bounds on the propagation of selection in logic programs. In Proceedings of the 6th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (San Diego, Calif., Mar.). ACM, New York, 1987, pp. 214-226.
11. BEERI, C., AND RAMAKRISHNAN, R. On the power of magic. In Proceedings of the 6th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (San Diego, Calif., Mar.). ACM, New York. 1987. pp. 269-283.
12. CARRE, B., Graphs and Networks, Oxford University Press, Oxford. England. 1979.
13. CERI. S., GOTTLOB, G., AND LAVAZZA, L. Translation and optimization of logic queries: The algebraic approach. In Proceedings of the 12th International VLDB Conference (Kyoto, Japan, Aug.). Morgan Kaufmann. San Mateo. Calif., 1986. pp. 395-402.
14. CERI, S., AND TANCA. L. Optimization of systems of algebraic equations for evaluating datalog queries. In Proceedings 13th International VLDB Conference (Brighton. England. Sept). Morgan Kaufmann, San Mateo, Calif., 1987. pp. 31-41
15. CHANDRA, A. K., AND MERLIN, P M. Optimal implementation of conjunctive queries in relational data bases. In Proceedings of the 9th Annual ACM Symposium of Theory of Computing (Boulder, Colo, May). ACM, New York. 1977, pp. 77-90.
16. CLOCKSIN, W. F., AND MELLISH, C. S. Programming in Prolog. Springer-Verlag, New York. 1981
17. CODD, E F. A relational model of data for large shared data banks. Commun. ACM 13. 6 (1970), 377-387.
18. COSMADAKIS, S., AND KANELLAKIS, P. Parallel evaluation of recursive rule queries. In Proceedings of the 5th ACM SIGMOD-SIGACT Symposium on Principles of Database Systems (Cambridge, Mass, Mar.) ACM, New York, 1986, pp. 280-293
19. DONG, G. On the Composition of Datalog Program Mappings. Unpublished Manuscript, Univ. Southern California, Nov., 1988
20. EILENBERG, S. Automata, Languages, and Machines. Acedamic Press, New York, 1974.
21. GAIFMAN, H, MAIRSON, H, SAGIV, Y., AND VARDI, M Undecidable optimization problems for database logic programs. In Proceedings of the 2nd ACM Symposium on Logic in Computer Science (Ithaca, NY, June). ACM, New York, 1987, pp. 106-115
22. GARDARIN, G, AND DE MAINDREVILLE, C. Evaluation of database recursive logic programs as recurrent function series In Proceedings of the 1986 ACM-SIGMOD Conference of the Management of Data (Washington, D.C., May). ACM, New York, 1986, pp. 177-186.
23. GARDARIN, G. Magic functions: A technique to optimize extended datalog recursive programs. In Proceedings of the 13th International VLDB Conference (Brighton, England, Sept.). Morgan Kaufmann, San Mateo, Calif., 1987, pp. 21-30.
24. HAN, J, AND LU, H Some performance results on recursive query processing in relational database systems In Proceedings of the 2nd International Conference on Data Engineering (Los Angeles, Calif., Jan.). IEEE Computer Society Press, Washington, D C, 1986. pp. 533-539
25. HENSCHEN, L., AND NAQVI, S. On compiling queries in recursive first-order databases JACM 31, 1 (Jan. 1984), 47-85
26. HERSTEIN, I N. Topics in Algebra. Wiley, New York, N Y., 1975.
27. IOANNIDIS, Y. E. On the computation of the transitive closure of relational operators. In Proceedings of the 12th International VLDB Conference (Kyoto, Japan. Aug). Morgan Kaufmann, San Mateo, Calif., 1986, pp. 403-411
28. IOANNIDIS, Y. E. A time bound on the materialization of some recursively defined views. Algorithmica 1, 4 (Oct. 1986), 361-385.
29. IOANNIDIS, Y.E. Commutativity and its role in the processing of linear recursion. J. Logic Prog., to appear.
30. IOANNIDIS, Y. E, AND WONG, E An algebraic approach to recursive inference. In Proceedings of the 1st International Conference on Expert Database Systems (Charleston, S.C., Apr.). Benjamin/Cummings, Redwood City, Calif., 1987, pp. 295-309.
31. IOANNIDIS, Y. E., AND WONG, E. Query optimization by simulated annealing. In Proceedings of the 1987 ACM-SIGMOD Conference on the Management of Data (San Francisco. Calif., May). ACM, New York, 1987, pp. 9-22
32. KIFER, M., AND LOZINSKII, E. On compile time query optimization in deductive databases by means of static filtering ACM Trans. Datab. Syst. 15, 3 (Sept. 1990), 385-426.
33. LASSEZ, J L. AND MAHER, M. J. Closures and fairness in the semantics of programming logic Theoret. Comput. Sci. 29 (1984), 167-184.
34. LEHMANN, D J Algebraic structures for transitive closure. Theoret. Comput. Sci. 4 (1977), 59-76.
35. MAHER, M. J Semantics of Logic Program. PhD dissertation. Dep. Comput. Sci., Univ Melbourne, Parkville, Australia (also available as Tech. Rep No. M85/14), 1985.
36. NAUGHTON, J. Compiling separable recursions. In Proceedings of the 1988 ACM-SIGMOD Conference on the Management of Data (Chicago, 111, June). ACM, New York, 1988, pp 312-319.
37. NAUGHTON. J. Minimizing function-free recursive inference rules. JACM 36. 1 (Jan. 1989), 69-91
38. NAUGHTON. J. Data independent recursion in deductive databases. J. Comput. Syst. Sci. 38. 2 (Apr. 1989), 259-289.
39. NAUGHTON, J. F., RAMAKRISHNAN, R., SAGIV, Y., AND ULLMAN, J. D. Factoring can reduce arguments. In Proceedings of the 15th International VLDB Conference (Amsterdam, The Netherlands, Aug.). Morgan Kaufmann, San Mateo, Calif., 1989, pp. 173-182
40. RAMAKRISHNAN, R., BEERI, C., AND KRISHNAMURTHY, R. Optimizing existential datalog queries. In Proceedings of the 7th ACM SIGMOD-SIGACT-SIGAPT Symposium on Principles of Database Systems (Austin, Tex., Mar.). ACM, New York. 1988, pp. 89-102.
41. RAMAKRISHNAN, R., SAGIV, Y, ULLMAN, J. D., AND VARDI, M. Proof tree transformation theorems and their applications Proceedings of the 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (Philadelphia, Pa., Mar.). ACM. New York, 1989, pp. 172-181.
42. ROSENTHAL, A., HEILER. S., DAYAL, U., AND MANOLA, F. Traversal recursion: A practical approach to supporting recursive applications. In Proceedings of the 1986 ACM-SIGMOD Conference on the Management of Data (Washington, DC, May). ACM, New York, 1986, pp. 166-176.
43. SACCA, D., AND ZANIOLO, C. On the implementation of a simple class of logic queries for databases. In Proceedings of the 5th ACM SIGMOD-SIGACT Symposium on Principles of Database Systems (Cambridge, Mass., Mar.) ACM, New York, 1986, pp. 16-23.
44. SACCA, D., AND ZANIOLO, C. The generalized counting method for recursive logic queries. In Proceedings of the International Conference on Database Theory (Rome, Italy, Oct.). Springer-Verlag, Berlin, 1986, pp. 31-53.
45. SAGIV, Y Optimizing datalog programs. In Proceedings of the 6th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database System (San Diego, Calif., Mar.). ACM, New York. 1987, pp. 349-362.
46. SAGIV, Y., AND YANNAKAKJS, M. Equivalences among relational expressions with the union and difference operator. JACM 27. 4 (Oct. 1980), pp. 633-655.
47. SARAIYA, Y. P. Linearizing nonlinear recursions in polynomial time In Proceedings of the 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (Philadelphia, Pa., Mar.). ACM, New York, 1989, pp. 182-189.
48. SCHAFER. R. D. An Introduction to Nonassociative Algebras. Academic Press, Orlando, Fla., 1966.
49. SHAPIRO, S., AND MCKAY, D. Inference with recursive rules. In Proceedings of the 1st Annual National Conference on Artificial Intelligence (Palo Alto, Calif., Aug.). 1980, pp. 151-153.
50. SHMUELI, O. Decidability and expressiveness aspects of logic queries. In Proceedings of the 6th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (San Diego, Calif., Mar). ACM, New York, 1987, pp. 237-249.
51. TARSKI, A. A lattice theoretical fixpoint theorem and its applications. Pacific J. Math. 5 (1955), pp. 285-309.
52. VALDURIEZ, P. AND BORAL, H. Evaluation of recursive queries using join indices. In Proceedings of the 1st International Conference on Expert Database Systems (Charleston, S.C., Apr.). Benjamin/Cummings, Redwood City, Calif., 1987, pp. 271-293.
53. VALDURIEZ, P., AND KHOSHAFIAN, S. Transitive closure of transitively dosed relations. In Proceedings of the 2nd International Conference on Expert Database Systems (Tysons Corner, Va., Apr.). Benjamin/Cummings, Redwood City, Calif., 1989, pp. 377-400.
54. M.H. VANEMDEN, AND KOWALSKI, R. A. The sematics of predicate logic as a programming language. JACM 23, 4 (Oct. 1976). 733-742.
55. VIEILLE, L. Recursive axioms in deductive databases: The query/subquery approach. In Proceedings of the 1st International Conference on Expert Database Systems (Charleston, S.C., Apr.) Benjamin/Cummings, Redwood City, Calif., 1987, pp. 253-267.
56. ZHANG, W., AND YU, C. T. A necessary condition for a doubly recursive rule to be equivalent to a linear recursive rule. In Proceedings of the 1987 ACM-SIGMOD Conference on the Management of Data (San Francisco, Calif., May). ACM, New York, 1987, pp. 345-356.
57. ZHANG, W., YU, C. T., AND TROY, D. A necessary and sufficient condition to linearize doubly recursive programs in logic databases. ACM Trans. Datab. Syst, 15, 3 (Sept, 1990). 459-482.