Loading...
Please wait, while we are loading the content...
Similar Documents
From Datalog rules to efficient programs with time and space guarantees (2003)
| Content Provider | CiteSeerX |
|---|---|
| Author | Liu, Yanhong A. Stoller, Scott D. |
| Description | This paper 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. The associated space usage is optimal in that it is the minimum space needed for such consideration modulo scheduling optimizations that may 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. |
| File Format | |
| Language | English |
| Publisher | ACM Press |
| Publisher Date | 2003-01-01 |
| Publisher Institution | In PPDP ’03: Proceedings of the 5th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming |
| Access Restriction | Open |
| Subject Keyword | Guaranteed Worst-case Time Improved Algorithm Complexity Analysis Problem Efficient Program Associated Space Usage Efficient Specialized Implementation Space Usage Formula Datalog Rule Space Guarantee Data Structure General Method Useful Combination Algorithm Design Running Time Algorithm Understanding Space Complexity Simplified Complexity Analysis Incremental Maintenance Minimum Space Consideration Modulo Fixed-point Computation |
| Content Type | Text |
| Resource Type | Article |