{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T12:40:03Z","timestamp":1736167203012,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540618140"},{"type":"electronic","value":"9783540706830"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0031749","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T06:44:07Z","timestamp":1134283447000},"page":"321-342","source":"Crossref","is-referenced-by-count":0,"title":["Database query evaluation with the STARBASE method"],"prefix":"10.1007","author":[{"given":"Estrella","family":"Pulido","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,26]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"A.V. Aho and J.D. Ullman. Universality of data retrieval languages. Proc. Symp. Principles of Programming Languages, 110\u2013120, 1979.","DOI":"10.1145\/567752.567763"},{"issue":"10","key":"16_CR2","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0743-1066(91)90038-Q","volume":"10","author":"C. Beeri","year":"1991","unstructured":"C. Beeri and R. Ramakrishnan. On the power of magic. JLP, 10(10):255\u2013299, 1991.","journal-title":"JLP"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"W. Chen and D.S. Warren. Query evaluation under the well founded semantics. PODS'93, 168\u2013179.","DOI":"10.1145\/153850.153865"},{"key":"16_CR4","volume-title":"Technical Report 85\/31","author":"S.W. Dietrich","year":"1985","unstructured":"S.W. Dietrich and D.S. Warren. Dynamic programming strategies for the evaluation of recursive queries. Technical Report 85\/31, SUNY at Stony Brook, 1985."},{"key":"16_CR5","unstructured":"G. Gazdar and C. Mellish. Natural Language in Prolog. An Introduction to Computational Linguistics. Addison-Wesley Publishing Company, 1989."},{"key":"16_CR6","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0743-1066(91)90039-R","volume":"10","author":"G. Grahne","year":"1991","unstructured":"G. Grahne, S. Sippu, and E. Soisalon-Soininen. Efficient evaluation for a subset of recursive queries. JLP, 10:301\u2013332, 1991.","journal-title":"JLP"},{"issue":"1","key":"16_CR7","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/2422.2423","volume":"31","author":"L.J. Henschen","year":"1984","unstructured":"L.J. Henschen and S.A. Naqvi. On compiling queries in recursive first-order databases. Journal of the ACM, 31(1):47\u201385, 1984.","journal-title":"Journal of the ACM"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"M. Kifer and E. Lozinskii. Filtering data flow in deductive databases. ICDT'86. LNCS 243, 186\u2013202.","DOI":"10.1007\/3-540-17187-8_37"},{"key":"16_CR9","unstructured":"J.V. Leeuwen. Handbook of Theoretical Computer Science. Algorithms and Complexity. Elsevier \u2014 The MIT Press, 1990."},{"key":"16_CR10","unstructured":"E.L. Lozinskii. Evaluating queries in deductive databases by generating. IJCAI'85, 173\u2013177."},{"key":"16_CR11","unstructured":"E. Minieka. Optimization Algorithms for Networks and Graphs. Marcel Dekker, Inc., 1978."},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"K.A. Morris. An algorithm for ordering subgoals in NAIL! PODS'88, 82\u201388.","DOI":"10.1145\/308386.308419"},{"key":"16_CR13","unstructured":"W. Nejdl. Recursive strategies for answering recursive queries \u2014 the RQA\/FQI strategy. VLDB'87, 43\u201350."},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"F.C.N. Pereira and D.H.D. Warren. Parsing as deduction. 21st Annual Meeting of the Association for Computational Linguistics, 137\u2013144, 1983.","DOI":"10.3115\/981311.981338"},{"key":"16_CR15","unstructured":"E. Pulido. Recursive query processing in deductive databases using graph traversal and rule compilation techniques. PhD thesis, University of Bristol, 1996."},{"key":"16_CR16","unstructured":"R. Ramakrishnan, D. Srivastava, and S. Sudarshan. CORAL \u2014 control, relations and logic. VLDB'92, 238\u2013250."},{"key":"16_CR17","unstructured":"D.A. Rosenblueth. Chart parsers as proof procedures for fixed-mode logic programs. To be published in New Generation Computing."},{"issue":"2","key":"16_CR18","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1145\/191843.191927","volume":"23","author":"K. Sagonas","year":"1994","unstructured":"K. Sagonas, T. Swift, and D.S. Warren. XSB as an efficient deductive database engine. SIGMOD Record, 23(2):442\u2013453, 1994.","journal-title":"SIGMOD Record"},{"key":"16_CR19","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF03037470","volume":"8","author":"N.K. Simpkins","year":"1990","unstructured":"N.K. Simpkins and P. Hancox. Chart parsing in Prolog. New Generation Computing, 8:113\u2013138, 1990.","journal-title":"New Generation Computing"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"H. Tamaki and T. Sato. OLD resolution with tabulation. ICLP'86, 84\u201398.","DOI":"10.1007\/3-540-16492-8_66"},{"key":"16_CR21","unstructured":"S. Tsur and C. Zaniolo. LDL: a logic-based data language. VLDB'86, 33\u201341."},{"key":"16_CR22","unstructured":"J.D. Ullman. Principles of Database and Knowledge-base Systems. Computer Science Press, 1988."},{"key":"16_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(89)90088-1","volume":"69","author":"L. Vieille","year":"1989","unstructured":"L. Vieille. Recursive query processing: the power of logic. Theoretical Computer Science, 69:1\u201353, 1989.","journal-title":"Theoretical Computer Science"},{"key":"16_CR24","unstructured":"D.H.D. Warren. Efficient processing of interactive relational database queries expressed in logic. VLDB'81, 272\u2013281."},{"key":"16_CR25","unstructured":"P.T. Wood. Queries on graphs. Technical Report CSRI-223, Computer Systems Research Institute. University of Toronto, December 1988."}],"container-title":["Lecture Notes in Computer Science","Logic in Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0031749","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T12:10:21Z","timestamp":1736165421000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0031749"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540618140","9783540706830"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/bfb0031749","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}