{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:09Z","timestamp":1725663669250},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540512516"},{"type":"electronic","value":"9783540461821"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51251-9_27","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:49:49Z","timestamp":1330202989000},"page":"415-428","source":"Crossref","is-referenced-by-count":2,"title":["Transitive closure and the LOGA+-strategy for its efficient evaluation"],"prefix":"10.1007","author":[{"given":"W.","family":"Yan","sequence":"first","affiliation":[]},{"given":"N.","family":"Mattos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"unstructured":"Agrawal, R., Jagadisch, H.: Direct Algorithms for Computing the Transitive Closure of Database Relations, in: Proc. of the 13th VLDB Conference, Brighton 1987, pp. 255\u2013266.","key":"27_CR1"},{"key":"27_CR2","first-page":"1","volume-title":"Proc. Gl-Conference on Knowledge-Based Systems, Informatik-Fachbereichte 112","author":"R. Bayer","year":"1985","unstructured":"Bayer, R.: Database Technology for Expert Systems, in: Proc. Gl-Conference on Knowledge-Based Systems, Informatik-Fachbereichte 112, Springer-Verlag, Munich, Oct. 1985, pp. 1\u201316."},{"doi-asserted-by":"crossref","unstructured":"Bancilhon, F.: Naive Evaluation of Recursively Defined Relations, in: On Knowledge Base Management Systems \u2014 Integrating Database and Al Systems, (Ed: Brodie and Mylopoulos), Springer-Verlag, 1986, pp. 165\u2013178.","key":"27_CR3","DOI":"10.1007\/978-1-4612-4980-1_17"},{"doi-asserted-by":"crossref","unstructured":"Bancilhon, F., Maier, D., Sagiv, Y., Ullman, J.: Magic Sets and Other Strange Ways to Implement Logic Programs, in: Proc. of the Fifth ACM SIGACT-SIGMOD Symposium on Prinziples of Database Systems, Cambridge, Massachusetts, March, 1986.","key":"27_CR4","DOI":"10.1145\/6012.15399"},{"issue":"2","key":"27_CR5","first-page":"16","volume":"15","author":"F. Bancilhon","year":"1986","unstructured":"Bancilhon, F., Ramakrishnan, R.: An Amateur's Introduction to Recursive Query Processing Strategies, in: Proc. of SIGMOD '86, Inter. Conf. on Management of Data, SIGMOD Record, Vol. 15, No. 2, June 1986, pp. 16\u201352.","journal-title":"Proc. of SIGMOD '86, Inter. Conf. on Management of Data, SIGMOD Record"},{"doi-asserted-by":"crossref","unstructured":"Bancilhon, F., Ramakrishnan, R.: Perfoemance Evaluation of Data Intensive Logic Programs, in: \"Foundations of Deductive Databases and Logic Programming\" (Ed: Minker, J.), Morgan Kaufmann Publishers, 1988, pp. 439\u2013511.","key":"27_CR6","DOI":"10.1016\/B978-0-934613-40-8.50016-6"},{"unstructured":"Beeri, C., Ramakrishnan, R.: On the Power of Magic, Computer Sciences Technical Report #770, University of Wisconsin-Madison, to appear in the Journal of Logic Programming.","key":"27_CR7"},{"unstructured":"Data, C.J.: A Guide to INGRES, Addison-Wesley Publishing Company, 1987.","key":"27_CR8"},{"doi-asserted-by":"crossref","unstructured":"Dayal, U., Smith, J.: PROBE: A Knowledge-Oriented Database, in: On Knowledge Base Management Systems (Ed: Brodie and Mylopoulos), Springer-Verlag, 1986, pp. 227\u2013257.","key":"27_CR9","DOI":"10.1007\/978-1-4612-4980-1_22"},{"issue":"2","key":"27_CR10","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/356924.356929","volume":"16","author":"H. Gallaire","year":"1984","unstructured":"Gallaire, H., Minker, J., Nicolas, J.M.: Logic and Databases: A Deductive Approach, in: ACM Computing Surveys, Vol. 16, No. 2, June 1984, pp. 153\u2013186.","journal-title":"ACM Computing Surveys"},{"unstructured":"Heigert, J.: Efficient Algorithms for Relational Database Systems Supporting Recursion (in German), TUM-18613, TU Munich, July 1986.","key":"27_CR11"},{"doi-asserted-by":"crossref","unstructured":"Han, J., Lu, H.: Some Performance Results on Recursive Query Processing in Relational Database Systems, in: IEEE Proc. of Inter. Conf. on Data Engineering, Los Angeles, Feb. 1986.","key":"27_CR12","DOI":"10.1109\/ICDE.1986.7266260"},{"doi-asserted-by":"crossref","unstructured":"Han, J., Qadah, G., Chaou, C.: The Processing and Evaluation of Transitive Closure Queries, iin: Advances in Database Technology \u2014 EDBT '88, Inter. Conf. on Extending Database Technology, Venice, Italy, March 1988, Sringer-Verlag, pp. 49\u201375.","key":"27_CR13","DOI":"10.1007\/3-540-19074-0_47"},{"unstructured":"Ioannidis, Y.: On the Computation of the Transitive Closure of Relational Operators, in: Proc. of the 12th VLDB Conference, Kyoto, 1986, pp. 403\u2013411.","key":"27_CR14"},{"unstructured":"Ioannidis, Y., Wong, E.: Transforming Nonlinear Recursion to Linear Recursion, in: Proc. of the Second Inter. Conf. on Expert Database Systems, EDBS '88, Tysons Corner, Virginia, Apr. 1988.","key":"27_CR15"},{"doi-asserted-by":"crossref","unstructured":"Jagadish, H., Agvawal, R., Ness, L.: A Study of Transitive Closure as a Recursion Mechanism, in: Proc. of ACM SIGMOD 1987 Annual Conference, San Francisco, May 1987, pp. 331\u2013344.","key":"27_CR16","DOI":"10.1145\/38713.38750"},{"unstructured":"Kifer, M., Lozinskii, E.: A Framework for an Efficient Implementation of Deductive Databases, in: Proc. of Advanced Database Symposium, Tokyo, 1986.","key":"27_CR17"},{"doi-asserted-by":"crossref","unstructured":"Lu, H., Mikkilineni, K., Richadson, J.: Design and Evaluation of Algorithms to Compute the Transitive Closure of a Database Relation, in: Proc. of the Third Inter. Conf. on Data Engineering, Los Angeles, Feb. 1987, pp. 112\u2013119.","key":"27_CR18","DOI":"10.1109\/ICDE.1987.7272364"},{"doi-asserted-by":"crossref","unstructured":"Sacca, D., Zaniolo, C.: Magic Counting Methods, in: Proc. of ACM SIGMOD 1987 Annual Conference, San Francisco, May 1987, pp. 49\u201359.","key":"27_CR19","DOI":"10.1145\/38713.38725"},{"unstructured":"Vieille, L.: Recursive Axioms in Deductive Databases: the Query\/Subquery Approach, in: Proc. of First Inter. Conf. on Expert Database Systems, Charleston, 1986, pp. 179\u2013193.","key":"27_CR20"},{"unstructured":"Yan, W.: Analysis of Different Strategies for the Processing Recursive Queries in Deductive Database Systems (in German), Technical report, University of Kaiserslautern, Nov. 1987.","key":"27_CR21"},{"unstructured":"Yan, W.: An Overview of Existing Strategies for the Evaluation of Recursive Queries (in German), Internal Report, University of Kaiserslautern, in preparation.","key":"27_CR22"},{"doi-asserted-by":"crossref","unstructured":"Zhang, W., Yu, C.: A Necessary Condition for a Doubly Recursive Rule to be Equivalent to a Linear Recursive Rule, in: Proc. of ACM SIGMOD 1987 Annual Conference, San Francisco, May 1987, pp. 345\u2013356.","key":"27_CR23","DOI":"10.1145\/38713.38751"}],"container-title":["Lecture Notes in Computer Science","MFDBS 89"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51251-9_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:20:27Z","timestamp":1605648027000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51251-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540512516","9783540461821"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-51251-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}