Nonrecursive incremental evaluation of Datalog queries | Zendy

Guozhu Dong | Zendy; Jianwen Su | Zendy; Rodney Topor | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Nonrecursive incremental evaluation of Datalog queries

Author(s) -

Guozhu Dong,

Jianwen Su,

Rodney Topor

Publication year - 1995

Publication title -

annals of mathematics and artificial intelligence

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.369

H-Index - 55

eISSN - 1573-7470

pISSN - 1012-2443

DOI - 10.1007/bf01530820

Subject(s) - datalog , conjunctive query , boolean conjunctive query , decidability , computer science , transitive closure , set (abstract data type) , query optimization , class (philosophy) , theoretical computer science , closure (psychology) , query language , state (computer science) , spatial query , mathematics , database , sargable , algorithm , discrete mathematics , programming language , web search query , information retrieval , relational database , search engine , artificial intelligence , economics , market economy

We consider the problem of repeatedly evaluating the same (computationally expensive) query to adatabase that is being updated between successive query requests. In this situation, it should be possibleto use the difference between successive database states and the answer to the query in one state toreduce the cost of evaluating the query in the next state. We use nonrecursive Datalog (which are unionsof conjunctive queries) to compute the differences, and call this process "incremental...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research