We present asymptotically exact expressions for the expected sizes of relations defined by three well-studied Datalog recursions, namely the "transitive closure," "same generation," and "canonical factorable recursion." We consider the size of the fixpoints of the recursively defined relations in th
β¦ LIBER β¦
Extending the power of datalog recursion
β Scribed by Mirjana Mazuran, Edoardo Serra, Carlo Zaniolo
- Book ID
- 120921942
- Publisher
- Springer-Verlag
- Year
- 2012
- Tongue
- English
- Weight
- 401 KB
- Volume
- 22
- Category
- Article
- ISSN
- 1066-8888
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
On the Expected Size of Recursive Datalo
β
S. Seshadri; J.F. Naughton
π
Article
π
1995
π
Elsevier Science
π
English
β 998 KB
On the Equivalence of Recursive and Nonr
β
Surajit Chaudhuri; Moshe Y Vardi
π
Article
π
1997
π
Elsevier Science
π
English
β 591 KB
We study the problem of determining whether a given recursive Datalog program is equivalent to a given nonrecursive Datalog program. Since nonrecursive Datalog programs are equivalent to unions of conjunctive queries, we study also the problem of determining whether a given recursive Datalog program
A simple proof on the decidability of eq
β
H. Leung; D. Ranjan; H.J. HernΓ‘ndez; D. Tang; A. GonzΓ‘lez
π
Article
π
1995
π
Elsevier Science
π
English
β 308 KB
Complexity and Expressive Power of Deter
β
Sergio Greco; Domenico SaccΓ
π
Article
π
1999
π
Elsevier Science
π
English
β 183 KB
Extended recursion-based formalization o
β
Beaucamps, Philippe
π
Article
π
2008
π
Springer
π
English
β 213 KB
Extended properties of the Levinson recu
β
Mazel, D.S.; Hayes, M.H., III
π
Article
π
1991
π
IEEE
β 429 KB