From datalog rules to efficient programs with time and space guarantees
Abstract
This article describes a method for transforming any given set of Datalog rules into an efficient specialized implementation with guaranteed worst-case time and space complexities, and for computing the complexities from the rules. The running time is optimal in the sense that only useful combinations of facts that lead to all hypotheses of a rule being simultaneously true are considered, and each such combination is considered exactly once in constant time. The associated space usage may sometimes be reduced using scheduling optimizations to eliminate some summands in the space usage formula. The transformation is based on a general method for algorithm design that exploits fixed-point computation, incremental maintenance of invariants, and combinations of indexed and linked data structures. We apply the method to a number of analysis problems, some with improved algorithm complexities and all with greatly improved algorithm understanding and greatly simplified complexity analysis.
Document Details
- Document Type
- Pub Defense Publication
- Publication Date
- Aug 01, 2009
- Source ID
- 10.1145/1552309.1552311
Entities
People
- Scott D. Stoller
- Yanhong A. Liu
Organizations
- Division of Computing and Communication Foundations
- National Science Foundation
- Office of Naval Research
- Stony Brook University