{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T00:25:24Z","timestamp":1648859124484},"reference-count":29,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1990,10,1]],"date-time":"1990-10-01T00:00:00Z","timestamp":654739200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data & Knowledge Engineering"],"published-print":{"date-parts":[[1990,10]]},"DOI":"10.1016\/0169-023x(90)90018-9","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T17:15:20Z","timestamp":1047662120000},"page":"313-332","source":"Crossref","is-referenced-by-count":3,"title":["Selection propagation in deductive databases from pushing selections to magic sets"],"prefix":"10.1016","volume":"5","author":[{"given":"Nobuyoshi","family":"Miyazaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0169-023X(90)90018-9_BIB1","series-title":"Proc. 4th Internat. Conf. Data Engineering","first-page":"452","article-title":"Moving selections into linear least fixpoint queries","author":"Agrawal","year":"1988"},{"key":"10.1016\/0169-023X(90)90018-9_BIB2","series-title":"Proc. 6th ACM Symp. Principles of Programming Languages","first-page":"110","article-title":"Universality of data retrieval languages","author":"Aho","year":"1979"},{"issue":"2","key":"10.1016\/0169-023X(90)90018-9_BIB3","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0743-1066(87)90004-5","article-title":"A generalization of the differential approach to recursive query evaluation","volume":"4","author":"Balbin","year":"1987","journal-title":"J. Logic Programming"},{"key":"10.1016\/0169-023X(90)90018-9_BIB4","series-title":"Proc. 5th ACM PODS","first-page":"1","article-title":"Magic sets and other strange ways to implement logic programs","author":"Bancilhon","year":"1986"},{"key":"10.1016\/0169-023X(90)90018-9_BIB5","series-title":"Proc. ACM SIGMOD","first-page":"16","article-title":"An amateur's introduction to recursive query processing strategies","author":"Bancilhon","year":"1986"},{"key":"10.1016\/0169-023X(90)90018-9_BIB6","series-title":"On Knowledge Base Management Systems","first-page":"165","article-title":"Naive evaluation of recursively defined relations","author":"Bancilhon","year":"1986"},{"key":"10.1016\/0169-023X(90)90018-9_BIB7","series-title":"Proc. 6th ACM PODS","first-page":"214","article-title":"Bounds on the propagation of selection into logic programs","author":"Beeri","year":"1987"},{"key":"10.1016\/0169-023X(90)90018-9_BIB8","series-title":"Proc. 6th ACM PODS","first-page":"269","article-title":"On the power of magic","author":"Beeri","year":"1987"},{"key":"10.1016\/0169-023X(90)90018-9_BIB9","first-page":"20","article-title":"Query evaluation in recursive databases: bottom-up and top-down reconciled","author":"Bry","year":"1989"},{"key":"10.1016\/0169-023X(90)90018-9_BIB10","series-title":"Proc. 13th VLDB","first-page":"31","article-title":"Optimization of algebraic equations for evaluating Datalog queries","author":"Ceri","year":"1987"},{"issue":"1","key":"10.1016\/0169-023X(90)90018-9_BIB11","first-page":"146","article-title":"What you always wanted to know about Datalog","volume":"1","author":"Ceri","year":"1989","journal-title":"IEEE TKDE"},{"key":"10.1016\/0169-023X(90)90018-9_BIB12","series-title":"Symbolic Logic and Mechanical Theorem Proving","author":"Chang","year":"1973"},{"key":"10.1016\/0169-023X(90)90018-9_BIB13","series-title":"Proc. 13th VLDB","first-page":"21","article-title":"Magic functions: A technique to optimize extended Datalog recursive programs","author":"Gardarin","year":"1987"},{"key":"10.1016\/0169-023X(90)90018-9_BIB14","series-title":"Proc. ICDT","first-page":"186","article-title":"Filtering data flow in deductive databases","author":"Kifer","year":"1986"},{"issue":"7","key":"10.1016\/0169-023X(90)90018-9_BIB15","first-page":"109","article-title":"SYGRAF: Implementing Implementing logic programs in a database style","volume":"14","author":"Kifer","year":"1988","journal-title":"IEEE TOSE"},{"key":"10.1016\/0169-023X(90)90018-9_BIB16","series-title":"Foundations of Logic Programs","author":"Lloyd","year":"1987"},{"key":"10.1016\/0169-023X(90)90018-9_BIB17","first-page":"266","article-title":"Horn clause transformation by restrictor in deductive databases","volume":"12","author":"Miyazaki","year":"1989"},{"issue":"4","key":"10.1016\/0169-023X(90)90018-9_BIB18","first-page":"352","article-title":"A framework for query transformations in deductive databases","volume":"12","author":"Miyazaki","year":"1989","journal-title":"J. Inf. Process."},{"key":"10.1016\/0169-023X(90)90018-9_BIB19","series-title":"Proc. 8th ACM SIGMOD","first-page":"235","article-title":"Efficient evaluation of right-, left-, and multi-linear rules","author":"Naughton","year":"1989"},{"key":"10.1016\/0169-023X(90)90018-9_BIB20","series-title":"Proc. 5th Internat. Conf\/Symp. Logic Programming","first-page":"140","article-title":"Magic templates: A spell binding approach to logic programs","author":"Ramakrishnan","year":"1988"},{"key":"10.1016\/0169-023X(90)90018-9_BIB21","series-title":"Proc. 4th ICLP","first-page":"104","article-title":"Implementation of recursive queries for a data language based on pure Horn logic","author":"Sacca","year":"1987"},{"key":"10.1016\/0169-023X(90)90018-9_BIB22","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"659","article-title":"Optimizing Datalog programs","author":"Sagiv","year":"1988"},{"key":"10.1016\/0169-023X(90)90018-9_BIB23","series-title":"Proc. 8th ACM PODS","first-page":"150","article-title":"On the power of Alexander templates","author":"Seki","year":"1989"},{"key":"10.1016\/0169-023X(90)90018-9_BIB24","series-title":"Proc. 3rd ICLP","first-page":"84","article-title":"OLD resolution with tabulation","author":"Tamaki","year":"1986"},{"key":"10.1016\/0169-023X(90)90018-9_BIB25","series-title":"Principles of Database and Knowledge-Base Systems","author":"Ullman","year":"1988"},{"key":"10.1016\/0169-023X(90)90018-9_BIB26","series-title":"Proc. 8th ACM PODS","first-page":"140","article-title":"Bottom-up beats top-down for Datalog","author":"Ullman","year":"1989"},{"issue":"4","key":"10.1016\/0169-023X(90)90018-9_BIB27","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","article-title":"The semantics of predicate logic as a programming language","volume":"23","author":"van Emden","year":"1976","journal-title":"JACM"},{"key":"10.1016\/0169-023X(90)90018-9_BIB28","series-title":"Proc. 1st Internat. Conf. Expert Database Systems","first-page":"179","article-title":"Recursive axioms in deductive databases: The query\/subquery approach","author":"Vieille","year":"1986"},{"key":"10.1016\/0169-023X(90)90018-9_BIB29","series-title":"Proc. 2nd Internat. Conf. Expert Database Systems","first-page":"421","article-title":"From QSQ towards QoSaQ: Global optimization of recursive queries","author":"Vieille","year":"1988"}],"container-title":["Data & Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0169023X90900189?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0169023X90900189?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T15:27:34Z","timestamp":1553614054000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0169023X90900189"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,10]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1990,10]]}},"alternative-id":["0169023X90900189"],"URL":"https:\/\/doi.org\/10.1016\/0169-023x(90)90018-9","relation":{},"ISSN":["0169-023X"],"issn-type":[{"value":"0169-023X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,10]]}}}