{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:05:20Z","timestamp":1725663920836},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540540090"},{"type":"electronic","value":"9783540473480"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54009-1_14","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:21:44Z","timestamp":1330208504000},"page":"188-200","source":"Crossref","is-referenced-by-count":0,"title":["Complexity of recursive production rules execution"],"prefix":"10.1007","author":[{"given":"Luc","family":"Albert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mireille","family":"R\u00e9gnier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"14_CR1","first-page":"223","volume":"405","author":"L. Albert","year":"1989","unstructured":"L. Albert. Average case complexity analysis of rete pattern match algorithm and average size of join in databases. In FST & TCS, volume 405, pages 223\u2013241. Springer Verlag, 1989. In Proceedings of the 9 th conference on Foundations of Software Technology and Theoretical Computer Science, Bangalore, India.","journal-title":"FST & TCS"},{"key":"14_CR2","volume-title":"Quelques analyses de complexit\u00e9 en moyenne sur les algorithmes de multifiltrage, d'unification et de requ\u00eates multiples","author":"L. Albert","year":"1990","unstructured":"L. Albert. Quelques analyses de complexit\u00e9 en moyenne sur les algorithmes de multifiltrage, d'unification et de requ\u00eates multiples. Doctorat en sciences, Universit\u00e9 de Paris-Sud, Orsay, 1990."},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"S. Abiteboul and E. Simon. Fundamental properties of deterministic and non deterministic extensions of Datalog, 1990. to appear in Theoretical Computer Science.","DOI":"10.1016\/0304-3975(51)90006-0"},{"key":"14_CR4","unstructured":"S. Abiteboul and V. Vianu. Datalog extensions for database queries and updates., 1988. to appear Journal of Computer and Systems Science."},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"F. Bancilhon. Naive evaluation of recursively defined relations. In M. Brodie and J. Mylopoulos, editors, On Knowledge Base Management Systems. Springer Verlag, 1985.","DOI":"10.1007\/978-1-4612-4980-1_17"},{"key":"14_CR6","unstructured":"B. Bollobas. Random Graphs. Academic Press, 1985."},{"key":"14_CR7","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0004-3702(82)90020-0","volume":"19","author":"C. Forgy","year":"1982","unstructured":"C. Forgy. Rete, a fast algorithm for the many patterns many objects match problem. J. Artificial Intelligence, 19:17\u201337, 1982.","journal-title":"J. Artificial Intelligence"},{"key":"14_CR8","volume-title":"Bases de Donn\u00e9es, allocations al\u00e9atoires: quelques analyses de performances","author":"D. Gardy","year":"1989","unstructured":"D. Gardy. Bases de Donn\u00e9es, allocations al\u00e9atoires: quelques analyses de performances. Doctorat \u00e8s sciences, Universit\u00e9 de Paris-Sud, Orsay, 1989."},{"key":"14_CR9","unstructured":"D. Gardy and C. Puech. On the effect of join operations on relation sizes, 1990. to appear in ACM Transactions On Database Systems."},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"P. Kanellakis and S. Abiteboul. Deciding bounded recursion in database logic programs. Sigact News, 20(4), 1989.","DOI":"10.1145\/74074.74077"},{"key":"14_CR11","unstructured":"P. Kanellakis. Elements of a relational database theory. technical report, Brown Univ., 1988. to appear as a chapter in Handbook of Theoretical Computer Science."},{"key":"14_CR12","unstructured":"P. Miranker. Treat: A better match algorithm for AI production systems. 1987. In Proceedings of the 1987 National Conference on Artificial Intelligence. Seattle, Washington, 1987."},{"key":"14_CR13","unstructured":"M. R\u00e9gnier and E. Simon. Efficient evaluation of rules in a DBMS. In BD3 89, pages 131\u2013154. INRIA, 1989. Proc. 6-emes Journ\u00e9es Bases de Donn\u00e9es Avanc\u00e9es, Geneve."},{"key":"14_CR14","volume-title":"Algorithms","author":"R. Sedgewick","year":"1988","unstructured":"R. Sedgewick. Algorithms. 2-nd Edition, Addison-Wesley, Reading, Mass., 1988.","edition":"2-nd Edition"},{"key":"14_CR15","unstructured":"J. Ullman. Principles of Database and Knowledge Systems, volume 1. Computer Science Press, 1988."}],"container-title":["Lecture Notes in Computer Science","MFDBS 91"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54009-1_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:51:57Z","timestamp":1605646317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54009-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540540090","9783540473480"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-54009-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}