Filters








132 Hits in 2.7 sec

Control and optimization strategies in the implementation of LDL

R. Krishnamurthy, Carlo Zaniolo
<span title="">1990</span> <i title="ACM"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/42jkyzjrt5fjdfig3o4z2cascq" style="color: black;">Advances in database programming languages</a> </i> &nbsp;
Consequently, the optimizer is given the responsibility of choosing an optimal execution--a function similar to that of the query optimizer in a relational database system.  ...  to select a minimum cost execution in such a space.  ...  Safe queries are then processed in a bottom-up fashion with the help of "magic sets" which make the process safe.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/101620.101640">doi:10.1145/101620.101640</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/dbpl/KrishnamurthyZ87.html">dblp:conf/dbpl/KrishnamurthyZ87</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qp7y42ynzbfcdjoivqpu6e6uru">fatcat:qp7y42ynzbfcdjoivqpu6e6uru</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20041023054210/http://www.cs.ucla.edu:80/~zaniolo/papers/dbpl87.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/5c/4e/5c4ed26ecb265d0b7ad6196a3470cf3676c994cd.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/101620.101640"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Optimization in a logic based language for knowledge and data intensive applications [chapter]

Ravi Krishnamurthy, Carlo Zaniolo
<span title="">1988</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
In order to generalize the strategy successfully used in relational database systems we first characterize the optimization problem in terms of its execution space, cost functions and search algorithm.  ...  This paper describes the optimization approach taken to ensure the safe and efficient execution of applications written in LDL, which is a declarative language based on Horn Clause Logic and intended for  ...  Further, for a given adorned program, the transformed program by Magic Sets or Counting is also unique.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-19074-0_45">doi:10.1007/3-540-19074-0_45</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zl3orishina7nmkifgirubrbvm">fatcat:zl3orishina7nmkifgirubrbvm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20030313221935/http://www.cs.ucla.edu:80/~zaniolo/papers/edbt88.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/93/44/934441a7aac633fd13398048daa5ed0df27c555a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-19074-0_45"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Nonrecursive incremental evaluation of Datalog queries

Guozhu Dong, Jianwen Su, Rodney Topor
<span title="">1995</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/j2td7x4trvgx7pjoienrccryxq" style="color: black;">Annals of Mathematics and Artificial Intelligence</a> </i> &nbsp;
insertions where the sets are binary cartesian products.  ...  In this situation, it should be possible to use the difference between successive database states and the answer to the query in one state to reduce the cost of evaluating the query in the next state.  ...  Magic sets [8] . Our incremental approach differs considerably from approaches such as the magic set approach [8] to query optimization.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bf01530820">doi:10.1007/bf01530820</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fhvpdkoqwfdvzaqwplurqrrp6a">fatcat:fhvpdkoqwfdvzaqwplurqrrp6a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170705074341/http://knoesis.org/resources/library-resources/files/download/9065.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/1e/85/1e85d23d9eabaad7c322499ee03ba4cc9ea19b04.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bf01530820"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A survey of deductive database systems

Raghu Ramakrishnan, Jeffrey D. Ullman
<span title="">1995</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/7qdabej4lbaczotmeg3ldn4ioy" style="color: black;">The Journal of Logic Programming</a> </i> &nbsp;
In particular, it is desirable that it works well with the magic-sets transformation, in the sense that we can modify the rules by some suitable generalization of magic-sets, and the resulting rules will  ...  The evaluation of the magic-sets transformation of this class of programs has also been considered in the literature [17, 92, 46, 86] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0743-1066(94)00039-9">doi:10.1016/0743-1066(94)00039-9</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/z75hsj363jcwrdic4ymyi7aop4">fatcat:z75hsj363jcwrdic4ymyi7aop4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190216232405/https://core.ac.uk/download/pdf/82655241.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/01/f3/01f3bebd1b8bf058353b43fdc14ae7b627cc0935.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0743-1066(94)00039-9"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Constraint-based query evaluation in deductive databases

J. Han
<span title="">1994</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ht3yl6qfebhwrg7vrxkz4gxv3q" style="color: black;">IEEE Transactions on Knowledge and Data Engineering</a> </i> &nbsp;
Our study on the roles of different classes of constraints in set-oriented evaluation of linear recursions shows that (i) rule constraints should be integrated with their corresponding deduction rules  ...  queries; and (iii) query constraints, which are often useful in search space reduction and termination, should be transformed, when necessary, and be pushed into the compiled chains as deeply as possible  ...  The 0-th expanded exit rule set is the set of nonrecursive rules of r .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/69.273030">doi:10.1109/69.273030</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mjukqnwdznhp3mphegd2sqccdi">fatcat:mjukqnwdznhp3mphegd2sqccdi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808234343/http://web.engr.illinois.edu/~hanj/dood/constr94.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/36/26/3626690d0e53077ff79d1ba37e2cf0a18c271eac.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/69.273030"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Implementation Alternatives for Bottom-Up Evaluation

Stefan Brass, Marc Herbstritt
<span title="2010-06-25">2010</span> <i > <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/lp3a6vqizfdbvlneh2os4i6swe" style="color: black;">International Conference on Logic Programming</a> </i> &nbsp;
It is used after a source code optimization like magic sets or SLDmagic that ensures that only facts relevant for the query can be derived.  ...  Bottom-up evaluation is a central part of query evaluation / program execution in deductive databases.  ...  With the magic set transformation, all calls to a predicate are put together in one set.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.iclp.2010.44">doi:10.4230/lipics.iclp.2010.44</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/iclp/Brass10.html">dblp:conf/iclp/Brass10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vgk6ijbejvhrjejcvfkerntypq">fatcat:vgk6ijbejvhrjejcvfkerntypq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180514072215/http://drops.dagstuhl.de/opus/volltexte/2010/2582/pdf/10003.BrassStefan.2582.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/2b/5e/2b5e750b3ab3aa1391fe5c41336bb23eddcddc37.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.iclp.2010.44"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

On the bottom—up evaluation of recursive queries

Yangjun Chen
<span title="">1996</span> <i title="Wiley"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/tsqpdv4ebvctjlbuqzeazjgjaq" style="color: black;">International Journal of Intelligent Systems</a> </i> &nbsp;
Based on the well-known magic-set method. we develop a technique: labeling to record the cyclic paths during the execution of the first phase of the magic-set method and suspending the computation for  ...  Based on the well-known magic-set method, we develop a technique: labelling to record the cyclic paths during the execution of the first phase of the magic-set method and suspending the computation for  ...  The Magic-Set Algorithm Now we consider the magic-set transformation of a program.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/(sici)1098-111x(199610)11:10&lt;807::aid-int7&gt;3.3.co;2-w">doi:10.1002/(sici)1098-111x(199610)11:10&lt;807::aid-int7&gt;3.3.co;2-w</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hw3hnbrdcjc63dzhbkarg7uere">fatcat:hw3hnbrdcjc63dzhbkarg7uere</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20081015175249/http://io.uwinnipeg.ca/~ychen2/journalpapers/article4.93.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/53/06/5306c1f4c0d8e9bed00a6ec945e5f68a5f7db750.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/(sici)1098-111x(199610)11:10&lt;807::aid-int7&gt;3.3.co;2-w"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> wiley.com </button> </a>

On the bottom-up evaluation of recursive queries

Yangjun Chen
<span title="1998-12-07">1998</span> <i title="Wiley"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/tsqpdv4ebvctjlbuqzeazjgjaq" style="color: black;">International Journal of Intelligent Systems</a> </i> &nbsp;
Based on the well-known magic-set method. we develop a technique: labeling to record the cyclic paths during the execution of the first phase of the magic-set method and suspending the computation for  ...  Based on the well-known magic-set method, we develop a technique: labelling to record the cyclic paths during the execution of the first phase of the magic-set method and suspending the computation for  ...  The Magic-Set Algorithm Now we consider the magic-set transformation of a program.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/(sici)1098-111x(199610)11:10&lt;807::aid-int7&gt;3.0.co;2-2">doi:10.1002/(sici)1098-111x(199610)11:10&lt;807::aid-int7&gt;3.0.co;2-2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/77of7lljzbbezdvc4hzgabdlae">fatcat:77of7lljzbbezdvc4hzgabdlae</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20081015175249/http://io.uwinnipeg.ca/~ychen2/journalpapers/article4.93.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/53/06/5306c1f4c0d8e9bed00a6ec945e5f68a5f7db750.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/(sici)1098-111x(199610)11:10&lt;807::aid-int7&gt;3.0.co;2-2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> wiley.com </button> </a>

One-sided recursions

Jeffrey F. Naughton
<span title="">1991</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/p6ovb2qpkfenhmb7mcksobrcxq" style="color: black;">Journal of computer and system sciences (Print)</a> </i> &nbsp;
Another promising direction, investigated in [NRSU89], is to use the fact that a recursion is one-sided to optimize the program produced by the Magic-Sets transformation.  ...  instances to be evaluated) that force one to turn to methods such as "Magic Sets" or "Counting" for many-sided recursions.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0022-0000(91)90011-s">doi:10.1016/0022-0000(91)90011-s</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3o6ur6ttezc4vjwo6l7khrktaa">fatcat:3o6ur6ttezc4vjwo6l7khrktaa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190416221330/https://core.ac.uk/download/pdf/81150543.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f6/6f/f66fb592388a9c9bc0e0fab9c1d7268124301022.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0022-0000(91)90011-s"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Optimization of Linear Recursive Queries in SQL

Carlos Ordonez
<span title="">2010</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ht3yl6qfebhwrg7vrxkz4gxv3q" style="color: black;">IEEE Transactions on Knowledge and Data Engineering</a> </i> &nbsp;
This work focuses on the optimization of linear recursive queries in SQL.  ...  In general, Seminaive is faster than Direct, except for complete graphs. Storing and indexing rows by vertex and pushing aggregation work well on trees, lists and cyclic graphs.  ...  Pushing agregation through recursion is quite different from the magic set transformation; in magic sets the filtering predicate passes through recursion, but the groupby operation is evaluated in the  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tkde.2009.83">doi:10.1109/tkde.2009.83</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qopingnlorfdhlnlygjrbcj6ly">fatcat:qopingnlorfdhlnlygjrbcj6ly</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20140513121308/http://www2.cs.uh.edu:80/~ordonez/w-2010-TKDE-lrq.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/43/ae/43ae665066bfa1c52bfc83e95dadcb5fcabcee41.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tkde.2009.83"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Pushing constraint selections

Divesh Srivastava, Raghu Ramakrishnan
<span title="">1993</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/7qdabej4lbaczotmeg3ldn4ioy" style="color: black;">The Journal of Logic Programming</a> </i> &nbsp;
Our procedure can be combined with the Magic Templates transformation to propagate query binding information in addition to the constraint information.  ...  The Magic Templates evaluation cannot utilize all the constraint information present in such program-query pairs while computing only ground facts.  ...  transformations using the system of Tamaki and Sato [14] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0743-1066(93)90048-l">doi:10.1016/0743-1066(93)90048-l</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tlua2vpnuncftcr5wvcwywroei">fatcat:tlua2vpnuncftcr5wvcwywroei</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190328105757/https://core.ac.uk/download/pdf/82736091.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/88/d0/88d0862a9bb77e1d20b791b83c51b48eb62bfe3f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0743-1066(93)90048-l"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Commutativity and its role in the processing of linear recursion

Yannis E. Ioannidis
<span title="">1992</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/7qdabej4lbaczotmeg3ldn4ioy" style="color: black;">The Journal of Logic Programming</a> </i> &nbsp;
data base management systems (DBMSs).  ...  and one-sided recursion; investigate the relationship of commutativity and several optimizations proposed for the magic sets and counting algorithms (e.g., there seems to be a strong relationship between  ...  Note that the latter cannot be derived by Theorem 5.2, since repeated nonrecursive predicates appear in the antecedents of the two rules. Instead it is derived by forming the two products.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0743-1066(92)90012-r">doi:10.1016/0743-1066(92)90012-r</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/p5qyazcoendtbpstfywobbmyfm">fatcat:p5qyazcoendtbpstfywobbmyfm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809164357/http://www.madgik.di.uoa.gr/sites/default/files/jlp_14.3-4.223-252.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/5b/1e/5b1e45f1a294a8dd789b90e0d6c597ac192dd04d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0743-1066(92)90012-r"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Optimizing Inequality Joins in Datalog with Approximated Constraint Propagation [chapter]

Dario Campagna, Beata Sarna-Starosta, Tom Schrijvers
<span title="">2012</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Furthermore, our technique improves upon the previously reported in the literature constraint magic set transformation approach.  ...  Datalog systems evaluate joins over arithmetic (in)equalities as a naive generate-and-test of Cartesian products.  ...  Fortunately, to our aid comes the constraint magic set transformation [18] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-27694-1_9">doi:10.1007/978-3-642-27694-1_9</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/q6nnuuhrd5h4hlelg2bovtikje">fatcat:q6nnuuhrd5h4hlelg2bovtikje</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808051702/http://users.ugent.be/%7Etschrijv/Research/papers/padl2012.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/cd/a9/cda9710bb0b43dc4129a251ed16d494b3053b2fb.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-27694-1_9"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Classification and compilation of linear recursive queries in deductive databases

C. Youn, H.-J. Kim, L.J. Henschen, J. Han
<span title="">1992</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ht3yl6qfebhwrg7vrxkz4gxv3q" style="color: black;">IEEE Transactions on Knowledge and Data Engineering</a> </i> &nbsp;
In this paper, we present a graph model which is powerful in classifying and compiling linear recursive formulas in deductive databases.  ...  We demonstrate that based on the graph model all the linear recursive formulas can be classified into a taxonomy of classes and each class shares some common characteristics in query compilation and query  ...  Once a compiled formula is obtained, actual query processing can be done in many different ways such as Henschen-Naqvi method, Counting method, Magic set method, etc [l].  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/69.124897">doi:10.1109/69.124897</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ul2gv4yktfgxpcnkrkvplqdwdu">fatcat:ul2gv4yktfgxpcnkrkvplqdwdu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170811145839/http://idb.snu.ac.kr/images/7/77/Classification_and_compilation_of_linear_recursive_queries_indeductive_databases.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ee/e7/eee76cb650ac8bfbed6e8ac630b706056db5933c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/69.124897"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Optimizing bottom-up evaluation of constraint queries

David B. Kemp, Peter J. Stuckey
<span title="">1996</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/7qdabej4lbaczotmeg3ldn4ioy" style="color: black;">The Journal of Logic Programming</a> </i> &nbsp;
We show how to optimize the bottom-up evaluation of queries for such programs using transformations based on analysis obtained using abstract interpretation.  ...  We define the magic sets transformation in terms of the more general magic templates transformation [30] .  ...  Although we concentrate on magic sets transformations, other query-directed translations such as supplementary magic sets [32} and context transformations [16] can be handled similarly.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0743-1066(95)00050-x">doi:10.1016/0743-1066(95)00050-x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ybkby5sxqngrvimzmprnfjqopq">fatcat:ybkby5sxqngrvimzmprnfjqopq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171003145328/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/cd9/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS8wNzQzMTA2Njk1MDAwNTB4.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/5a/a0/5aa0a6c4b9606f9c0b109f0a4d28646cefb35df7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0743-1066(95)00050-x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 132 results