Automata Theory for Database Theoreticans

Abstract I describe several applications of automata theory to the analysis of Datalog programs, ranging from the easy to the difficult, in the hope of convincing the reader that automata theory provides a powerful set of abstractions and tools to database theoreticians.

[1]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[2]  Catriel Beeri,et al.  Bounds on the Propagation of Selection into Logic Programs , 1990, J. Comput. Syst. Sci..

[3]  R. Ramakrishnan,et al.  A framework for testing safety and effective computability of extended datalog , 1988, SIGMOD '88.

[4]  Haim Gaifman,et al.  Decidable optimization problems for database logic programs , 1988, STOC '88.

[5]  John Doner,et al.  Tree Acceptors and Some of Their Applications , 1970, J. Comput. Syst. Sci..

[6]  A. R. Meyer,et al.  Economy of Description by Automata, Grammars, and Formal Systems , 1971, SWAT.

[7]  Ronald Fagin,et al.  Monadic generalized spectra , 1975, Math. Log. Q..

[8]  M. Rabin.  Weakly Definable Relations and Special Automata , 1970 .

[9]  Yehoshua Sagiv,et al.  Safety of datalog queries over infinite databases , 1989, PODS '89.

[10]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs , 1990, Inf. Comput..

[11]  E. Allen Emerson,et al.  The complexity of tree automata and logics of programs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[12]  Jeffrey F. Naughton,et al.  A decidable class of bounded recursions , 1987, PODS '87.

[13]  Neil D. Jones,et al.  Space-Bounded Reducibility among Combinatorial Problems , 1975, J. Comput. Syst. Sci..

[14]  Jeffrey F. Naughton.  Data Independent Recursion in Deductive Databases , 1989, J. Comput. Syst. Sci..

[15]  Moshe Y. Vardi.  Decidability and undecidability results for boundedness of linear recursive queries , 1988, PODS.

[16]  Bruno Courcelle,et al.  Recursive Queries and Context-free Graph Grammars , 1991, Theor. Comput. Sci..

[17]  Christos H. Papadimitriou,et al.  The parallel complexity of simple chain queries , 1987, PODS '87.

[18]  Abraham Silberschatz,et al.  Safety of recursive Horn clauses with infinite relations , 1987, PODS '87.

[19]  Oded Shmueli,et al.  Decidability and expressiveness aspects of logic queries , 1987, XP7.52 Workshop on Database Theory.

[20]  Pierre Wolper,et al.  Automata theoretic techniques for modal logics of programs: (Extended abstract) , 1984, STOC '84.

[21]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[22]  Jeffrey D. Ullman,et al.  Parallel complexity of logical query programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[23]  Jeffrey D. Ullman,et al.  Implementation of logical query languages for databases , 1985, TODS.

[24]  John C. Shepherdson,et al.  The Reduction of Two-Way Automata to One-Way Automata , 1959, IBM J. Res. Dev..

[25]  Helmut Seidl.  Deciding Equivalence of Finite Tree Automata , 1990, SIAM J. Comput..

[26]  Yehoshua Sagiv,et al.  Optimizing datalog programs , 1987, Foundations of Deductive Databases and Logic Programming..

[27]  M. Rabin.  Decidability of second-order theories and automata on infinite trees. , 1969 .

[28]  Zvi Galil,et al.  Hierarchies of complete problems , 1976, Acta Informatica.

[29]  Giora Slutzki,et al.  Alternating Tree Automata , 1983, Theor. Comput. Sci..

[30]  Harry G. Mairson,et al.  Tools for Datalog boundedness , 1991, PODS '91.

[31]  Harry G. Mairson,et al.  Undecidable optimization problems for database logic programs , 1993, JACM.

[32]  Albert R. Meyer,et al.  The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space , 1972, SWAT.

[33]  Yehoshua Sagiv.  On Bounded Database Schemes and Bounded Horn-Clause Programs , 1988, SIAM J. Comput..

[34]  Dana S. Scott,et al.  Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[35]  Jeffrey F. Naughton,et al.  A Simple Characterization of Uniform Boundedness for a Class of Recursions , 1991, J. Log. Program..

[36]  Abraham Silberschatz,et al.  An axiomatic approach to deciding query safety in deductive databases , 1988, PODS '88.