On the expected size of recursive Datalog queries
Open Access
- 1 April 1991
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 268-279
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The transitive closure of a random digraphRandom Structures & Algorithms, 1990
- Counting methods for cyclic relations1988
- On the power of magic1987
- Bounds on the propagation of selection into logic programs1987
- Worst-case complexity analysis of methods for logic query implementation1987
- Magic counting methods1987
- Probabilistic construction of deterministic algorithms: Approximating packing integer programs1986
- Magic sets and other strange ways to implement logic programs (extended abstract)1985
- The longest path in a random graphCombinatorica, 1981
- Approximate formulas for some functions of prime numbersIllinois Journal of Mathematics, 1962