{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:19:28Z","timestamp":1743063568246,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433248"},{"type":"electronic","value":"9783540458760"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45876-x_28","type":"book-chapter","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T02:28:28Z","timestamp":1181183308000},"page":"427-444","source":"Crossref","is-referenced-by-count":12,"title":["Divide-and-Conquer Algorithm for Computing Set Containment Joins"],"prefix":"10.1007","author":[{"given":"Sergey","family":"Melnik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hector","family":"Garcia-Molina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"C. B\u00f6hm and H.-P. Kriegel. Dynamically Optimizing High-Dimensional Index Structures. In Proc. EDBT\u201900, 2000.","DOI":"10.1007\/3-540-46439-5_3"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"J.-Y. Cai, V. T. Chakaravarthy, R. Kaushik, and J.F. Naughton. On the complexity of join predicates. In Proc. PODS\u201901, 2001.","DOI":"10.1145\/375551.375592"},{"issue":"4","key":"28_CR3","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1145\/2275.357411","volume":"2","author":"C. Faloutsos","year":"1984","unstructured":"C. Faloutsos and S. Christodoulakis. Signature files: An access method for documents and its analytical performance evaluation. ACM Trans. on Office Information Systems (TOIS), 2(4):267\u2013288, 1984.","journal-title":"ACM Trans. on Office Information Systems (TOIS)"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"J. Gray, S. Englert, K. Baclawski, and P.J. Weinberger. Quickly generating billion-record synthetic databases. In Proc. SIGMOD\u201994, 1994.","DOI":"10.1145\/191839.191886"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"J. Hellerstein, E. Koutsoupias, and C. H. Papadimitriou. On the analysis of indexing schemes. In Proc. PODS\u201997, 1997.","DOI":"10.1145\/263661.263688"},{"key":"28_CR6","unstructured":"S. Helmer and G. Moerkotte. Evaluation of main memory join algorithms for joins with set comparison join predicates. In Proc. VLDB\u201997, 1997."},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Y. Ishikawa, H. Kitagawa, and N. Ohbo. Evaluation of signature files as set access facilities in OODBS. In Proc. SIGMOD\u201993, 1993.","DOI":"10.1145\/170035.170076"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"S. Melnik and H. Garcia-Molina. Divide-and-Conquer Algorithm for Computing Set Containment Joins. Extended Technical Report, http:\/\/dbpubs.stanford.edu\/pub\/2001-32 , September 2001.","DOI":"10.1007\/3-540-45876-X_28"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"J. M. Patel and D. J. DeWitt. Partition based spatial-merge join. In Proc. SIGMOD\u201996, 1996.","DOI":"10.1145\/233269.233338"},{"key":"28_CR10","unstructured":"K. Ramasamy, J. M. Patel, J. F. Naughton, and R. Kaushik. Set Containment Joins: the Good, the Bad and the Ugly. In Proc. VLDB\u201900, 2000."}],"container-title":["Lecture Notes in Computer Science","Advances in Database Technology \u2014 EDBT 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45876-X_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T01:18:24Z","timestamp":1737076704000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45876-X_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433248","9783540458760"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-45876-x_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}