Blog
About

183
views
0
recommends
+1 Recommend
1 collections
    1
    shares
      • Record: found
      • Abstract: found
      • Conference Proceedings: found
      Is Open Access

      SLDMagic—An Improved Magic Set Technique

      Proceedings of the International Workshop on Advances in Databases and Information Systems (ADBIS ‘96) (ADBIS)

      Advances in Databases and Information Systems

      10-13 September 1996

      Deductive Databases, Query Evaluation, Magic Sets, SLD-Resolution

      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

          We present a rewriting method for Datalog-programs which simulates SLD-resolution more closely than the ordinary “magic set” method does. This is especially advantageous in the case of tail-recursive programs, but already in nonrecursive programs we can often save a number of joins. In contrast to the method of ROSS [7], we do not only solve the problem of tail-recursion, but try to simulate SLD-resolution as fully as possible. An especially nice feature of our approach is that we get many other known optimizations “for free” in this way. Based on an idea of BRY [3], our method can be described in an elegantway by means of a meta-interpreter. This also allows to compare the efficiency of SLD-resolution and magic sets within a common framework. We then develop a combined method, which allows to choose the evaluation strategy for every body literal.

          Related collections

          Most cited references 6

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

          An amateur's introduction to recursive query processing strategies

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

            XSB as an efficient deductive database engine

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

              Query evaluation in recursive databases: bottom-up and top-down reconciled

               François Bry (1990)
                Bookmark

                Author and article information

                Contributors
                Conference
                September 1996
                September 1996
                : 1-16
                Affiliations
                Institut für Informatik, Universität Hannover

                Lange Laube 22, D-30159 Hannover, Fed. Rep. Germany
                Article
                10.14236/ewic/ADBIS1996.4
                © Stefan Brass. Published by BCS Learning and Development Ltd. Proceedings of the International Workshop on Advances in Databases and Information Systems (ADBIS ‘96). Moscow

                This work is licensed under a Creative Commons Attribution 4.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

                Proceedings of the International Workshop on Advances in Databases and Information Systems (ADBIS ‘96)
                ADBIS
                Moscow
                10-13 September 1996
                Electronic Workshops in Computing (eWiC)
                Advances in Databases and Information Systems
                Product
                Product Information: 1477-9358BCS Learning & Development
                Self URI (journal page): https://ewic.bcs.org/
                Categories
                Electronic Workshops in Computing

                Comments

                Comment on this article