Abstract rewriting Approach to solve Datalog programs
Pages 29 - 36
Abstract
Over the past decade, we have seen a resurgence in the Datalog language in different computing areas for solving a number of non- trivial problems. In this paper we introduce a novel resolution ap- proach to solve Datalog programs. We present a version of the technique that works on plain Datalog programs. We have devel- oped an abstract rewriting formalism to create a functional reso- lution process for Datalog. The resolution approach translates the Datalog resolution strategy into a fix-point abstract rewriting equa- tion system. Being an abstract rewriting formalism, every equation of the system can be viewed as a function. Based on this fact, we also developed an optimization process that improves the initial rewriting equation system. The optimization process generates an equation system that computes the solutions much more efficiently. Well known optimizations such as strength reduction or memoiza- tion have been used. We also developed a prototype compiler that encodes the optimized equation system into a solver. Experimental results obtained with the solver suggest execution times several or- ders of magnitude better than modern Prolog solvers like Y AP or X SB and usually one order of magnitude faster than state-of-the-art Datalog solvers such as B DDBDDB and DLV.
References
[1]
Hervé Gallaire and Jack Minker. Logic and Data Bases. Advances in Data Base Theory 1978.
[2]
Jeffrey D. Ullman. Principles of Database and Knowledge-Base Systems, Volume I and II, The New Technologies. Book 1989.
[3]
Serge Abiteboul and Richard Hull and Victor Vianu. Foundations of Databases. Book 1995.
[4]
Serge Abiteboul and Pierre Bourhis and Bogdan Marinoiu. Efficient maintenance techniques for views over active documents. Proc. 12th Int’l Conf. on Extending Database Technology EDBT 2009
[5]
Robert Baumgartner and Sergio Flesca and Georg Gottlob. The Elog Web Extraction Language 8th Int’l Conf. on Logic for Progr., Artificial Intelligence, and Reasoning LPAR’01
[6]
Yanhong A. Liu, and Scott D. Stoller. From datalog rules to efficient programs with time and space guarantees. ACM Trans. Program. Lang. Syst. 2009.
[7]
J. Cai, P. Facon, F. Henglein, R. Paige, and E. Schonberg. Type analysis and data structure selection. In B. Moller, editor, Constructing Programs from Specifications, pages 126-164. North-Holland, Amsterdam, 1991.
[8]
J. Cai and R. Paige. Program derivation by Fixed point computation. Sci. Comput. Program., 11:197-261, Sept. 1988/89.
[9]
R. Paige. Formal Differentiation: A Program Synthesis Technique, volume 6 of Computer Science and Artifcial Intelligence. UMI Research Press, Ann Arbor, Michigan, 1981. Revision of Ph.D. dissertation, New York University, 1979.
[10]
R. Paige. Programming with invariants. IEEE Software, 3(1):56-69, Jan. 1986.
[11]
R. Paige. Real-time simulation of a set machine on a RAM. In Computing and Information, Vol. II, pages 69-73. Canadian Scholars Press, 1989. Proceedings of ICCI’89: The International Conference on Computing and Information, Toronto, Canada, May 23-27, 1989.
[12]
R. Paige and S. Koenig. Finite differencing of computable expressions. ACM Trans. Program. Lang. Syst., 4(3):402-454, July 1982
[13]
Beeri, Catriel and Bernstein, Philip A. Computational problems related to the design of normal form relational schemas ACM Trans. Database Syst. 1979.
[14]
Jiazhen Cai and Robert Paige. Program Derivation by Fixed Point Computation Sci. Comput. Program. 1989.
[15]
Mar´ıa Alpuente and Marco A. Feli´u and Christophe Joubert and Alicia Villanueva. Defining Datalog in Rewriting Logic. LOPSTR. 2009.
[16]
Lars Ole Andersen. Program Analysis and Specialization for the C Programming Language. Phd Thesis 1994.
[17]
J. Whaley and D. Avots and M. Carbin and M. S. Lam. Using Datalog with Binary Decision Diagrams for Program Analysis. APLAS 2005.
[18]
Stefano Ceri and Georg Gottlob and Letizia Tanca. Logic Programming and Databases. Book 1990
[19]
Francois Bancilhon and David Maier and Yehoshua Sagiv and Jeffrey D. Ullman Magic Sets and Other Strange Ways to Implement Logic Programs Principles of Database Systems PODS’86
[20]
Carbin, Michael. Learning effective BDD variable orders for BDDbased program analysis. Stanford University, Tech. Rep, 2006.
[21]
Feli´u, Marco A. and Joubert, Christophe and Tar´ın, Fernando Evaluation Strategies for Datalog-based Points-To Analysis. Selected papers from the 10th International Workshop on Automated Verification of Critical Systems AVoCS 2010.
Index Terms
- Abstract rewriting Approach to solve Datalog programs
Recommendations
Abstract Hilbertian deductive systems, infon logic, and Datalog
In the first part of the paper, we discuss abstract Hilbertian deductive systems; these are systems defined by abstract notions of formula, axiom, and inference rule. We use these systems to develop a general method for converting derivability problems, ...
On temporal logic versus datalog
Logic and complexity in computer scienceWe provide a direct and modular translation from the temporal logics CTL, ETL, FCTL (CTL extended with the ability to express fairness) and the Modal µ-calculus to Monadic inf-Datalog with built-in predicates. We call it inf-Datalog because the ...
Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues
Datalog is one of the best-known rule-based languages, and extensions of it are used in a wide context of applications. An important Datalog extension is Disjunctive Datalog , which significantly increases the expressivity of the basic language. ...
Comments
Information & Contributors
Information
Published In
October 2015
78 pages
Copyright © 2015 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 27 October 2015
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
SPLASH '15
Sponsor:
SPLASH '15: Conference on Systems, Programming, Languages, and Applications: Software for Humanity
October 27, 2015
PA, Pittsburgh, USA
Acceptance Rates
Overall Acceptance Rate 10 of 15 submissions, 67%
Upcoming Conference
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 117Total Downloads
- Downloads (Last 12 months)4
- Downloads (Last 6 weeks)1
Reflects downloads up to 28 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in