{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T17:56:43Z","timestamp":1649181403800},"reference-count":27,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"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":["Information Sciences"],"published-print":{"date-parts":[[1997,2]]},"DOI":"10.1016\/s0020-0255(96)00160-0","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T20:00:31Z","timestamp":1049486431000},"page":"237-269","source":"Crossref","is-referenced-by-count":1,"title":["Dynamically ordered semi-naive evaluation of recursive queries"],"prefix":"10.1016","volume":"96","author":[{"given":"Ki-Hyung","family":"Hong","sequence":"first","affiliation":[]},{"given":"Yoon-Joon","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Kyu-Young","family":"Whang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0020-0255(96)00160-0_BIB1","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\/S0020-0255(96)00160-0_BIB2","series-title":"On Knowledge Base Management Systems\u2014Integrating Artificial Intelligence and Database Technologies","first-page":"165","article-title":"Naive evaluation of recursively defined relations","author":"Bancilhon","year":"1985"},{"key":"10.1016\/S0020-0255(96)00160-0_BIB3","series-title":"Proceedings of the Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","first-page":"1","article-title":"Magic sets and other strange ways to implement logic programs","author":"Bancilhon","year":"1986"},{"key":"10.1016\/S0020-0255(96)00160-0_BIB4","series-title":"Proceedings of the 1986 ACM SIGMOD International Conference of Management of Data","first-page":"16","article-title":"An amateur's introduction to recursive query processing strategies","author":"Bancilhon","year":"1986"},{"issue":"3","key":"10.1016\/S0020-0255(96)00160-0_BIB5","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0743-1066(91)90038-Q","article-title":"On the power of magic","volume":"10","author":"Beeri","year":"1991","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0020-0255(96)00160-0_BIB6","article-title":"Program derivation by fixed point computation","author":"Cai","year":"1988"},{"key":"10.1016\/S0020-0255(96)00160-0_BIB7","series-title":"Proceedings of the Twelfth International Conference on Very Large Data Bases","first-page":"395","article-title":"Translation and optimization of logic queries: The algebraic approach","author":"Ceri","year":"1986"},{"issue":"1","key":"10.1016\/S0020-0255(96)00160-0_BIB8","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1109\/69.43410","article-title":"What you always wanted to know about datalog (and never dared to ask)","volume":"1","author":"Ceri","year":"1989","journal-title":"IEEE Trans. Knowledge Data Engrg."},{"key":"10.1016\/S0020-0255(96)00160-0_BIB9","series-title":"Logic Programming and Databases","author":"Ceri","year":"1990"},{"key":"10.1016\/S0020-0255(96)00160-0_BIB10","series-title":"Proceedings of the Thirteenth International Conference on Very Large Data Bases","first-page":"31","article-title":"Optimization of systems of algebraic equations for evaluating datalog queries","author":"Ceri","year":"1987"},{"key":"10.1016\/S0020-0255(96)00160-0_BIB11","series-title":"Symbolic Logic and Mechanical Theorem Proving","author":"Chang","year":"1973"},{"key":"10.1016\/S0020-0255(96)00160-0_BIB12","series-title":"Logic and Data Bases","first-page":"293","article-title":"Negation as failure","author":"Clark","year":"1978"},{"key":"10.1016\/S0020-0255(96)00160-0_BIB13","series-title":"Proceedings of the Seventh International Conference on Data Engineering","first-page":"728","article-title":"An analysis technique for transitive closure algorithms: A statistical approach","author":"Ganguly","year":"1991"},{"issue":"3","key":"10.1016\/S0020-0255(96)00160-0_BIB14","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1145\/88636.87121","article-title":"On compile-time query optimization on deductive databases by means of static filtering","volume":"15","author":"Kifer","year":"1990","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/S0020-0255(96)00160-0_BIB15","series-title":"Proceedings of the ACM Symposium on Principles of Programming Languages","article-title":"A unified approach to global program optimization","author":"Kildall","year":"1973"},{"key":"10.1016\/S0020-0255(96)00160-0_BIB16","series-title":"Proceedings of the Sixteenth International Conference on Very Large Data Bases","first-page":"372","article-title":"Efficient implementation of loops in bottom-up evaluation of logic queries","author":"Kuittinen","year":"1990"},{"key":"10.1016\/S0020-0255(96)00160-0_BIB17","series-title":"Proceedings of the Thirteenth International Conference on Very Large Data Bases","first-page":"267","article-title":"New strategies for computing the transitive closure of a database relation","author":"Lu","year":"1987"},{"key":"10.1016\/S0020-0255(96)00160-0_BIB18","series-title":"Proceedings of the Fifteenth International Conference on Very Large Data Bases","first-page":"173","article-title":"Argument reduction by factoring","author":"Naughton","year":"1989"},{"key":"10.1016\/S0020-0255(96)00160-0_BIB19","series-title":"Proceedings of the Joint International Conference and Symposium on Logic Programming","first-page":"273","article-title":"Controlling the search in bottom-up evaluation","author":"Ramakrishnan","year":"1992"},{"issue":"4","key":"10.1016\/S0020-0255(96)00160-0_BIB20","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1109\/69.298169","article-title":"Rule ordering in bottom-up fixpoint evaluation of logic programs","volume":"6","author":"Ramakrishnan","year":"1994","journal-title":"IEEE Trans. Knowledge Data Engrg."},{"key":"10.1016\/S0020-0255(96)00160-0_BIB21","series-title":"IEEE International Symposium on Logic Programming","first-page":"234","article-title":"Compiling exploratory and goal-directed deduction into sloppy delta iteration","author":"Schmidt","year":"1987"},{"issue":"4","key":"10.1016\/S0020-0255(96)00160-0_BIB22","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1145\/219035.219056","article-title":"Space optimization in deductive databases","volume":"20","author":"Srivastava","year":"1995","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/S0020-0255(96)00160-0_BIB23","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","article-title":"A lattice-theoretical fixpoint theorem and its applications","volume":"5","author":"Tarski","year":"1955","journal-title":"Pacific J. Math."},{"issue":"3","key":"10.1016\/S0020-0255(96)00160-0_BIB24","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1145\/3979.3980","article-title":"Implementation of logical query languages for databases","volume":"10","author":"Ullman","year":"1985","journal-title":"ACM Trans. Database Syst."},{"key":"10.1016\/S0020-0255(96)00160-0_BIB25","volume":"Vol. 1","author":"Ullman","year":"1988"},{"key":"10.1016\/S0020-0255(96)00160-0_BIB26","volume":"Vol. 2","author":"Ullman","year":"1989"},{"key":"10.1016\/S0020-0255(96)00160-0_BIB27","series-title":"Proceedings of the Thirteenth International Conference on Very Large Data Bases","first-page":"275","article-title":"An extended disjunctive normal form approach for optimizing recursive logic queries in loosely coupled environments","author":"Whang","year":"1987"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025596001600?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025596001600?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T12:51:27Z","timestamp":1556628687000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025596001600"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":27,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["S0020025596001600"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0255(96)00160-0","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}