Incremental evaluation of Datalog queries

Dong, Guozhu; Topor, Rodney W.

doi:10.1007/3-540-56039-4_48

Cited by 47 publications

(32 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Choosing a Domain While in the framework of Patnaik and Immerman as well as in our framework fixed and finite domains are used, the first-order incremental evaluation system framework (short: FOIES) introduced by Dong, Su and Topor [DT92,DS93] uses active domains, where the domain accessible by the update formulas contains only elements currently used in input relations. The choice of domains is the main diference between our basic framework and the FOIES framework.…”

Section: Variants Of the Dynamic Complexity Frameworkmentioning

confidence: 99%

“…Already Dong and Topor studied conjunctive queries as update mechanism [DT92]. They showed that certain fragments of Datalog can be maintained by unions of conjunctive queries (though under ∆-semantics and under insertions only).…”

Section: Relating Small Dynamic Complexity Classesmentioning

confidence: 99%

“…As for the second goal, only very few such results are known. Dong and Topor showed that under insertions all regular chain Datalog queries can be maintained by unions of conjunctive queries [DT92]. Further, the class of regular languages is characterized by DynProp on strings and, on general structures, ∃ * FO is captured by DynQF [GMS12].…”

Section: Relating Small Dynamic Complexity Classesmentioning

confidence: 99%

“…This setting was independently formalized by Dong, Su and Topor [DT92,DS93] and Patnaik and Immerman [PI94]. Both formalizations are very similar.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Small Dynamic Complexity Classes

Zeume

2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Everything changes and nothing stands still. -Heraclitus (quoted by Platon in Cratylus) PrefaceOn the first few days of my PhD studies in the summer of 2009, my adviser Thomas Schwentick introduced me to dynamic complexity. Very recently Wouter Gelade, Marcel Marquardt and Thomas had obtained a very nice characterization of regular languages in terms of dynamic complexity, and also a lower bound for the dynamic complexity of the alternating reachability problem. Many interesting problems in this area seemed to wait for a solution; and so I started to try to prove a lower bound for reachability. I was not successful. After two (at the end frustrating) months, I abandoned this project.In the following two and a half years I almost forgot about dynamic complexity. Decidability issues for the two-variable fragment of first-order logic had turned out to be a much more accessible and fruitful field. Thomas and I had obtained several results, and a PhD in this field seemed not to be too far away. This was the moment when Thomas asked whether I would be interested in applying for funds from the DFG. If successful, such funding could relieve me from my teaching obligations.We decided to have a second, deeper look into dynamic complexity, and to apply for funds for doing an extensive study of the power of logics in dynamic settings. At that time, the decision to spend more time on dynamic complexity was not easy for me. I was in the third year of my PhD and already had results and further ideas for two-variable logics; and it was not clear whether an application for funding would be successful. On the other hand, now I had more experience, which might turn out to be helpful to attack the very same problems that I had tried to solve at the beginning of my PhD. I do not regret the decision.With the thesis at hand I want to document the progress in dynamic complexity that we have made in the last two and a half years. The focus of this thesis is on small dynamic descriptive complexity classes, in particular on lower bound methods for them. A short summary of results on decidability issues for two-variable logic is presented at the end of the thesis.

show abstract

Section: Variants Of the Dynamic Complexity Frameworkmentioning

confidence: 99%

Section: Relating Small Dynamic Complexity Classesmentioning

confidence: 99%

Section: Relating Small Dynamic Complexity Classesmentioning

confidence: 99%

“…This setting was independently formalized by Dong, Su and Topor [DT92,DS93] and Patnaik and Immerman [PI94]. Both formalizations are very similar.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Small Dynamic Complexity Classes

Zeume

2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…There has been substantial work on incremental query and view maintenance in databases (e.g., [1,15,16]) and rule-based systems (e.g., Datalog [4,5]). While related, our work addresses a more expressive formalism; further, traditionally in database systems the problem of incremental maintenance is considered with respect to data (corresponding to DL ABoxes) and not with respect to the database schema (corresponding to DL TBoxes).…”

Section: Related Workmentioning

confidence: 99%

History Matters: Incremental Ontology Reasoning Using Modules

2007

View full text Add to dashboard Cite

Abstract. The development of ontologies involves continuous but relatively small modifications. Existing ontology reasoners, however, do not take advantage of the similarities between different versions of an ontology. In this paper, we propose a technique for incremental reasoning-that is, reasoning that reuses information obtained from previous versions of an ontology-based on the notion of a module. Our technique does not depend on a particular reasoning calculus and thus can be used in combination with any reasoner. We have applied our results to incremental classification of OWL DL ontologies and found significant improvement over regular classification time on a set of real-world ontologies.

show abstract

Incremental computations over strongly distributed databases

Ravve

2015

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYThis contribution deals with systematic exploitation of logical reduction techniques to big distributed data handling. The particular applications are views and parallel updates over large-scale distributed databases as well as handling of queries over different generations of databases. Logical reduction techniques come in two favors. The first one: the syntactically defined translation schemes, which describe transformations of database schemes. They give rise to two induced maps, translations and transductions. Transductions describe the induced transformation of database instances and the translations describe the induced transformations of queries. The second one: Feferman-Vaught reductions, which are applied in situations of distributed databases. The reduction describes how the queries over a distributed database can be computed from queries over the components and queries over the index set. Combination and development of these techniques allow us to introduce the notion of strongly distributed databases. For such databases, we extend and generalize the known propagation techniques. The method allows unification of the distributed and parallel computation and communication as well as significant reduction of the communication load. The proposed general approach may be easily adopted to other distributed objects and their integration into large-scale systems.

show abstract

Incremental evaluation of Datalog queries

Cited by 47 publications

References 16 publications

Small Dynamic Complexity Classes

Small Dynamic Complexity Classes

History Matters: Incremental Ontology Reasoning Using Modules

Incremental computations over strongly distributed databases

Contact Info

Product

Resources

About