论文信息 - Chain Queries Expressible by Linear Datalog Programs

Chain Queries Expressible by Linear Datalog Programs

We study the linearisability of chain queries and identify a new class of linearisable chain queries, referred to as pseudo-regular. We prove linearisability constructively, by generating, for any given pseudo-regular chain query, the Datalog program corresponding to it.

Foto AfratiNational | Foto AfratiNational

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

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

[3] Foto N. Afrati,et al. Expressiveness of restricted recursive queries , 1989, STOC '89.

[4] Clement T. Yu,et al. Necessary and sufficient conditions to linearize doubly recursive programs in logic databases , 1990, TODS.

[5] Eugene Wong,et al. Towards an algebraic theory of recursion , 1991, JACM.

[6] Christos H. Papadimitriou,et al. The parallel complexity of simple logic programs , 1993, JACM.

[7] Alberto Pettorossi,et al. Transformation of Logic Programs , 1994 .

[8] Manolis Gergatsoulis,et al. On Transformations into Linear Database Logic Programs , 1996, Ershov Memorial Conference.