Efficient maintenance techniques for views over active documents

Abiteboul, Serge; Bourhis, Pierre; Marinoiu, Bogdan

doi:10.1145/1516360.1516483

Cited by 13 publications

(10 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It meets the requirement of the equation to unify with the first hypothesis of a rule with two hypotheses. Similarly the second one vP (Z, Y ) can be used to optimize the equation (4), in this case the predicate has to unify with the second hypothesis of the rule. The process will generate two new equations.…”

Section: Optimized Equation Systemmentioning

confidence: 99%

See 1 more Smart Citation

Abstract rewriting Approach to solve Datalog programs

Morales

Ishikawa

Honiden

2015

Proceedings of the 15th Symposium on Database Programming Languages

View full text Add to dashboard Cite

Over the past decade, we have seen a resurgence in the Datalog language in different computing areas for solving a number of nontrivial problems. In this paper we introduce a novel resolution approach to solve Datalog programs. We present a version of the technique that works on plain Datalog programs. We have developed an abstract rewriting formalism to create a functional resolution process for Datalog. The resolution approach translates the Datalog resolution strategy into a fix-point abstract rewriting equation 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 memoization 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 orders of magnitude better than modern Prolog solvers like YAP or XSB and usually one order of magnitude faster than state-of-the-art Datalog solvers such as BDDBDDB and DLV.

show abstract

Section: Optimized Equation Systemmentioning

confidence: 99%

“…Request permissions from permissions@acm.org. Datalog, such as Axlog [4], Elog [5], and SociaLite [6].…”

Section: Introductionmentioning

confidence: 99%

Abstract rewriting Approach to solve Datalog programs

Morales

Ishikawa

Honiden

2015

Proceedings of the 15th Symposium on Database Programming Languages

View full text Add to dashboard Cite

show abstract

“…One can show that satisfiability of a query in such a system remains in  in the size of the system (i.e., the sum of the sizes of the documents) and that the combined complexity is -. Such systems form the core of the implementation in [5].…”

Section: R 3 ( )mentioning

confidence: 99%

“…This suggest a necessary notion of relevance that we study to conclude this section. It is the one that is used in our system [5].…”

Section: Relevancementioning

confidence: 99%

See 1 more Smart Citation

Satisfiability and relevance for queries over active documents

Abiteboul

Bourhis

Marinoiu

2009

Proceedings of the Twenty-Eighth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems

Self Cite

View full text Add to dashboard Cite

Many Web applications are based on dynamic interactions between Web components exchanging flows of information. Such a situation arises for instance in mashup systems [22] or when monitoring distributed autonomous systems [6]. This is a challenging problem that has generated recently a lot of attention; see Web 2.0 [38]. For capturing interactions between Web components, we use active documents interacting with the rest of the world via streams of updates. Their input streams specify updates to the document (in the spirit of RSS feeds), whereas their output streams are defined by queries on the document. In most of the paper, the focus is on input streams where the updates are only insertions, although we do consider also deletions. We introduce and study two fundamental concepts in this setting, namely, satisfiability and relevance. Some fact is satisfiable for an active document and a query if it has a chance to be in the result of the query in some future state. Given an active document and a query, a call in the document is relevant if the data brought by this call has a chance to impact the answer to the query. We analyze the complexity of computing satisfiability in our core model (insertions only) and for extensions (e.g., with deletions). We also analyze the complexity of computing relevance in the core model.

show abstract