{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:47:52Z","timestamp":1752230872138,"version":"3.40.4"},"reference-count":34,"publisher":"Elsevier","isbn-type":[{"type":"print","value":"9780934613408"}],"license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"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":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1016\/b978-0-934613-40-8.50021-x","type":"book-chapter","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T16:04:28Z","timestamp":1404230668000},"page":"659-698","source":"Crossref","is-referenced-by-count":49,"title":["Optimizing Datalog Programs"],"prefix":"10.1016","author":[{"given":"Yehoshua","family":"Sagiv","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/B978-0-934613-40-8.50021-X_bib1","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1137\/0208017","article-title":"Equivalences among Relational Expressions","volume":"8","author":"Aho","year":"1979","journal-title":"SIAM J. Computing"},{"key":"10.1016\/B978-0-934613-40-8.50021-X_bib2","doi-asserted-by":"crossref","unstructured":"Bancilhon, F., Maier, D., Sagiv, Y., and Ullman, J. D. [1986a] Magic Sets and Other Strange Ways to Implement Logic Programs, Proc. Fifth ACM SIGACT-SIGMOD Symp. on Principles of Database Systems, Cambridge, MA, 1\u201315","DOI":"10.1145\/6012.15399"},{"key":"10.1016\/B978-0-934613-40-8.50021-X_bib3","doi-asserted-by":"crossref","unstructured":"Bancilhon, F. and Ramakrishnan, R. [1986b] An Amateur's Introduction to Recursive Query Processing Strategies, Proc. ACM SIGMOD Int. Conf. on Management of Data, Washington, DC, 16\u201352","DOI":"10.1145\/16856.16859"},{"key":"10.1016\/B978-0-934613-40-8.50021-X_bib4","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"439","article-title":"Performance Evaluation of Data Intensive Logic Programs","author":"Bancilhon","year":"1988"},{"issue":"2","key":"10.1016\/B978-0-934613-40-8.50021-X_bib5","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1137\/0210025","article-title":"Equivalence of Relational Database Schemes","volume":"10","author":"Beeri","year":"1981","journal-title":"SIAM J. Computing"},{"issue":"4","key":"10.1016\/B978-0-934613-40-8.50021-X_bib6","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1145\/1634.1636","article-title":"A Proof Procedure for Data Dependencies","volume":"31","author":"Beeri","year":"1984","journal-title":"J. ACM"},{"year":"1986","series-title":"Generalized Subsumption and Its Applications to Induction and Redundancy","author":"Buntine","key":"10.1016\/B978-0-934613-40-8.50021-X_bib7"},{"key":"10.1016\/B978-0-934613-40-8.50021-X_bib8","unstructured":"Chakravarthy, U. S., Minker, J., and Grant, J. [1986] Semantic Query Optimization: Additional Constraints and Control Strategies, Proc. First Int. Conf. on Expert Database Systems, Charleston, SC, 259\u2013269"},{"key":"10.1016\/B978-0-934613-40-8.50021-X_bib9","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"243","article-title":"Foundations of Semantic Query Optimization for Deductive Databases","author":"Chakravarthy","year":"1988"},{"key":"10.1016\/B978-0-934613-40-8.50021-X_bib10","doi-asserted-by":"crossref","unstructured":"Chandra, A. K. and Merlin, P. M. [1976] Implementation of Conjunctive Queries in Relational Databases, Proc. Ninth ACM SIGACT Symp. on Theory of Computing, 77\u201390","DOI":"10.1145\/800105.803397"},{"key":"10.1016\/B978-0-934613-40-8.50021-X_bib11","doi-asserted-by":"crossref","unstructured":"Cosmadakis, S. S. and Kanellakis, P. C. [1986] Parallel Evaluation of Recursive Rule Queries, Proc. Fifth ACM SIGACT-SIGMOD Symp. on Principles of Database Systems, Cambridge, MA, 280\u2013293","DOI":"10.1145\/6012.15421"},{"issue":"4","key":"10.1016\/B978-0-934613-40-8.50021-X_bib12","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":"Emden","year":"1976","journal-title":"J. ACM"},{"issue":"4","key":"10.1016\/B978-0-934613-40-8.50021-X_bib13","doi-asserted-by":"crossref","first-page":"952","DOI":"10.1145\/322344.322347","article-title":"Horn Clauses and Database Dependencies","volume":"29","author":"Fagin","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/B978-0-934613-40-8.50021-X_bib14","unstructured":"Finger, J. J. [1986] Exploiting Constraints in Design Synthesis, Ph.D. Thesis, Department of Computer Science, Stanford University, Stanford, CA"},{"year":"1978","series-title":"Logic and Databases","key":"10.1016\/B978-0-934613-40-8.50021-X_bib15"},{"issue":"2","key":"10.1016\/B978-0-934613-40-8.50021-X_bib16","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1145\/3149.214118","article-title":"On the Efficiency of Subsumption Algorithms","volume":"32","author":"Gottlob","year":"1985","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/B978-0-934613-40-8.50021-X_bib17","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/2422.2423","article-title":"On Compiling Queries in Recursive First-Order Databases","volume":"31","author":"Henschen","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/B978-0-934613-40-8.50021-X_bib18","doi-asserted-by":"crossref","unstructured":"Kifer, M. and Lozinskii, E. L. [1986] Filtering Data Flow in Deductive Databases, Proc. Int. Conf. on Database Theory, Rome, Italy","DOI":"10.1007\/3-540-17187-8_37"},{"key":"10.1016\/B978-0-934613-40-8.50021-X_bib19","unstructured":"King, J. J. [1981] Query Optimization by Semantic Reasoning, Ph.D. Thesis (also Rept. No. STAN-CS-81\u2013857), Department of Computer Science, Stanford University, Stanford, CA"},{"issue":"3","key":"10.1016\/B978-0-934613-40-8.50021-X_bib20","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1145\/319732.319738","article-title":"Determining View Dependencies Using Tableaux","volume":"7","author":"Klug","year":"1982","journal-title":"ACM Trans. on Database Systems"},{"key":"10.1016\/B978-0-934613-40-8.50021-X_bib21","unstructured":"Lozinskii, E. L. [1985] Evaluating Queries in Deductive Databases by Generating, Proc. 9th IJCAI, 173\u2013177"},{"key":"10.1016\/B978-0-934613-40-8.50021-X_bib22","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"627","article-title":"Equivalences of Logic Programs","author":"Maher","year":"1988"},{"issue":"4","key":"10.1016\/B978-0-934613-40-8.50021-X_bib23","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1145\/320107.320115","article-title":"Testing Implications of Data Dependencies","volume":"4","author":"Maier","year":"1979","journal-title":"ACM Trans. on Database Systems"},{"key":"10.1016\/B978-0-934613-40-8.50021-X_bib24","unstructured":"McKay, D. and Shapiro, S. [1981] Using Active Connection Graphs for Reasoning with Recursive Rules, Proc. 7th IJCAI, 368\u2013374"},{"key":"10.1016\/B978-0-934613-40-8.50021-X_bib25","unstructured":"Naughton, J. F. [1986] Redundancy in Function-Free Recursive Rules, Proc. 1986 Symp. on Logic Programming, Salt Lake City, UT, 236\u2013245"},{"key":"10.1016\/B978-0-934613-40-8.50021-X_bib26","series-title":"Machine Intelligence, 5","first-page":"153","article-title":"A Note on Inductive Generalization","author":"Plotkin","year":"1970"},{"key":"10.1016\/B978-0-934613-40-8.50021-X_bib27","unstructured":"Rohmer, J. and Lescoeur, R. [1985] The Alexander Method: A Technique for the Processing of Recursive Axioms in Deductive Databases, Bull Internal Report"},{"key":"10.1016\/B978-0-934613-40-8.50021-X_bib28","doi-asserted-by":"crossref","unstructured":"Sacc\u00e0, D. and Zaniolo, C. [1986] On the Implementation of a Simple Class of Logic Queries for Databases, Proc. Fifth ACM SIGACT-SIGMOD Symp. on Principles of Database Systems, Cambridge, MA, 16\u201323","DOI":"10.1145\/6012.6013"},{"issue":"4","key":"10.1016\/B978-0-934613-40-8.50021-X_bib29","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1145\/322217.322221","article-title":"Equivalences among Relational Expressions with the Union and Difference Operators","volume":"27","author":"Sagiv","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/B978-0-934613-40-8.50021-X_bib30","doi-asserted-by":"crossref","unstructured":"Shmueli, O. [1986] Decidability and Expressiveness Aspects of Logic Queries, Proc. Sixth ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, San Diego, CA, 237\u2013249","DOI":"10.1145\/28659.28685"},{"year":"1982","series-title":"Principles of Database Systems","author":"Ullman","key":"10.1016\/B978-0-934613-40-8.50021-X_bib31"},{"issue":"3","key":"10.1016\/B978-0-934613-40-8.50021-X_bib32","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. on Database Systems"},{"key":"10.1016\/B978-0-934613-40-8.50021-X_bib33","doi-asserted-by":"crossref","unstructured":"Van Gelder, A. [1986] A Message Passing Framework for Logical Query Evaluation, Proc. ACM SIGMOD Int. Conf. on Management of Data, Washington, DC, 155\u2013165","DOI":"10.1145\/16856.16870"},{"key":"10.1016\/B978-0-934613-40-8.50021-X_bib34","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0022-0000(82)90008-3","article-title":"Algebraic Dependencies","volume":"25","author":"Yannakakis","year":"1982","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Foundations of Deductive Databases and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B978093461340850021X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B978093461340850021X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T16:21:28Z","timestamp":1746289288000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B978093461340850021X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9780934613408"],"references-count":34,"URL":"https:\/\/doi.org\/10.1016\/b978-0-934613-40-8.50021-x","relation":{},"subject":[],"published":{"date-parts":[[1988]]}}}