{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T05:14:47Z","timestamp":1737090887697,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540438199"},{"type":"electronic","value":"9783540454311"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45431-4_3","type":"book-chapter","created":{"date-parts":[[2007,5,16]],"date-time":"2007-05-16T01:25:29Z","timestamp":1179278729000},"page":"14-28","source":"Crossref","is-referenced-by-count":1,"title":["Answering Cooperative Recursive Queries in Web Federated Databases"],"prefix":"10.1007","author":[{"given":"Mira","family":"Balaban","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolai","family":"Berezansky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ehud","family":"Gudes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,6,21]]},"reference":[{"key":"3_CR1","unstructured":"Jiang B. A suitable algorithm for computing transitive closure. In Proc. 6th Int. conf. on data engineering, pages 380\u2013392, 1990."},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"F. Bancilhon, D. Maier, Y. Sagiv, and J. D. Ulman. Magic sets and other strange ways to implement logic programs. In Proc. 5th ACM Symp. Principles of Database Systems, pages 1\u201315, 1986.","DOI":"10.1145\/6012.15399"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"F. Bancilhon and R. Ramakrishnan. An amateus\u2019s: Introduction to recursive query processing strategies. In Proc. 5th ACM-SIGMOD Int\u2019l Conf. Management Data, pages 16\u201352, 1986.","DOI":"10.1145\/16856.16859"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Jacques Calmet, Sebastian Jekutsch, and Joachim Sch\u00fc. A generic query-translation framework for a mediator architecture. In Proc. 13 Int\u2019l Conf. on Data Engineering, pages 434\u2013443, 1997.","DOI":"10.1109\/ICDE.1997.581980"},{"key":"3_CR5","first-page":"1229","volume":"2","author":"S. Zilberstein","year":"1996","unstructured":"Shlomo Zilberstein Eric A. Hansen. Monitoring the progress of anytime problem-solving. National Conference on Artificial Intelligence (AAAI\/IAAI), 2:1229\u20131234, 1996.","journal-title":"National Conference on Artificial Intelligence (AAAI\/IAAI)"},{"issue":"2","key":"3_CR6","first-page":"28","volume":"21","author":"L. Gravano","year":"1998","unstructured":"Luis Gravano and Yannis Papakonstantinou. Editing and metasearching on the internet. Data Engineering Bulletin, 21(2):28\u201336, 1998.","journal-title":"Data Engineering Bulletin"},{"key":"3_CR7","unstructured":"Laura M. Haas, Donald Kossmann, Edward L. Wimmers, and Jun Yang. Optimizing queries across diverse data sources. In Proc. of 23rd Int\u2019l Conf. on Very Large Data Bases, pages 276\u2013285, 1997."},{"issue":"4","key":"3_CR8","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1145\/296854.277639","volume":"23","author":"D. Konopnicki","year":"1998","unstructured":"David Konopnicki and Oded Shmueli. Information gathering in the world-wide web: The w3ql query language and the w3qs system. ACM Transactions on Database Systems, 23(4):369\u2013410, 1998.","journal-title":"ACM Transactions on Database Systems"},{"issue":"3","key":"3_CR9","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1145\/96602.96604","volume":"22","author":"A. P. Sheth","year":"1990","unstructured":"Amit P. Sheth and James A. Larson. Federated database systems for management distributed, heterogeneous, and autonomous databases. ACM Computing Surveys, 22(3):193\u2013236, 1990.","journal-title":"ACM Computing Surveys"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"I. H. Toroslu and G. Z. Qadah. The effective computation of strong partial transitive-closure. In Proc. 9th Int\u2019l Conf. Data Eng., pages 530\u2013537, 1996.","DOI":"10.1109\/ICDE.1993.344027"}],"container-title":["Lecture Notes in Computer Science","Next Generation Information Technologies and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45431-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T09:09:52Z","timestamp":1737018592000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45431-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438199","9783540454311"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-45431-4_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}