Blog
About

2
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Modular Materialisation of Datalog Programs

      Preprint

      , ,

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          The semina\"ive algorithm can materialise all consequences of arbitrary datalog rules, and it also forms the basis for incremental algorithms that update a materialisation as the input facts change. Certain (combinations of) rules, however, can be handled much more efficiently using custom algorithms. To integrate such algorithms into a general reasoning approach that can handle arbitrary rules, we propose a modular framework for materialisation computation and its maintenance. We split a datalog program into modules that can be handled using specialised algorithms, and handle the remaining rules using the semina\"ive algorithm. We also present two algorithms for computing the transitive and the symmetric-transitive closure of a relation that can be used within our framework. Finally, we show empirically that our framework can handle arbitrary datalog programs while outperforming existing approaches, often by orders of magnitude.

          Related collections

          Most cited references 1

          • Record: found
          • Abstract: not found
          • Article: not found

          On-line computation of transitive closures of graphs

           T Ibaraki,  N Katoh (1983)
            Bookmark

            Author and article information

            Journal
            06 November 2018
            Article
            1811.02304

            http://arxiv.org/licenses/nonexclusive-distrib/1.0/

            Custom metadata
            Accepted at AAAI 2019
            cs.AI cs.DB

            Databases, Artificial intelligence

            Comments

            Comment on this article