Conference item icon

Conference item

Optimised maintenance of datalog materialisations

Abstract:

To efficiently answer queries, datalog systems often materialise all consequences of a datalog program, so the materialisation must be updated whenever the input facts change. Several solutions to the materialisation update problem have been proposed. The Delete/Rederive (DRed) and the Backward/Forward (B/F) algorithms solve this problem for general datalog, but both contain steps that evaluate rules ‘backwards’ by matching their heads to a fact and evaluating the partially instantiated rule ...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Accepted Manuscript

Actions


Access Document


Files:

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS Division
Department:
Computer Science
Oxford college:
Somerville College
More by this author
Institution:
University of Oxford
Division:
MPLS Division
Department:
Computer Science
Publisher:
AAAI Press Publisher's website
Pages:
1871-1879
Publication date:
2018-04-25
Acceptance date:
2017-11-08
ISSN:
2159-5399
Pubs id:
pubs:746940
URN:
uri:79856c0d-c544-46d5-8a64-bdf7ac6b84d0
UUID:
uuid:79856c0d-c544-46d5-8a64-bdf7ac6b84d0
Local pid:
pubs:746940

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP