Datalog Automata

Abstract We propose a new computational paradigm for the evaluation of recursive Datalog queries, which is based on a pushdown automaton (PDA) model. By extending to these automata a dynamic programming technique developed for PDAs in context-free parsing, we obtain a general and simple technique for constructing efficient polynomial query evaluators. Keywords: Datalog, Recursive Queries, Complete Strategies, Dynamic Programming, Polynomial Complexity.

[1]  Franklin L. DeRemer,et al.  Simple LR(k) grammars , 1971, Commun. ACM.

[2]  Alain Pirotte,et al.  Efficient parsing algorithms for general context-free parsers , 1975, Inf. Sci..

[3]  Jay Earley,et al.  An efficient context-free parsing algorithm , 1970, Commun. ACM.

[4]  Seiichi Nakagawa.  Spoken sentence recognition by time-synchronous parsing algorithm of context-free grammar , 1987, ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[5]  David H. D. Warren,et al.  Definite Clause Grammars for Language Analysis - A Survey of the Formalism and a Comparison with Augmented Transition Networks , 1980, Artif. Intell..

[6]  Catriel Beeri,et al.  On the power of magic , 1987, J. Log. Program..

[7]  Stuart C. Shapiro,et al.  Using Active Connection Graphs for Reasoning with Recursive Rules , 1981, IJCAI.

[8]  Donald E. Knuth,et al.  On the Translation of Languages from Left to Right , 1965, Inf. Control..

[9]  J. D. Phillips.  A simple, efficient parser for phrase-structure grammars , 1989 .

[10]  Robert A. Kowalski,et al.  The Semantics of Predicate Logic as a Programming Language , 1976, JACM.

[11]  Walter L. Ruzzo,et al.  An Improved Context-Free Recognizer , 1980, ACM Trans. Program. Lang. Syst..

[12]  Masaru Tomita,et al.  An Efficient Augmented-Context-Free Parsing Algorithm , 1987, Comput. Linguistics.

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

[14]  Martin Kay,et al.  Algorithm schemata and data structures in syntactic processing , 1986 .

[15]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[16]  Stuart M. Shieber,et al.  Using Restriction to Extend Parsing Algorithms for Complex-Feature-Based Formalisms , 1985, ACL.

[17]  Neil Immerman,et al.  Relational Queries Computable in Polynomial Time , 1986, Inf. Control..

[18]  Daniel H. Younger,et al.  Recognition and Parsing of Context-Free Languages in Time n^3 , 1967, Inf. Control..

[19]  Kuniaki Uehara,et al.  A Bottom-Up Parser Based on Predicate Logic: A Survey of the Formalism and its Implementation Technique , 1984, SLP.

[20]  David H. D. Warren,et al.  Parsing as Deduction , 1983, ACL.

[21]  Laurent Vieille.  From QSQ towards QoSaQ: Global Optimization of Recursive Queries , 1988, Expert Database Conf..

[22]  Vaughan R. Pratt,et al.  LINGOL: a progress repor , 1975, IJCAI 1975.