{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:50:25Z","timestamp":1725573025350},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540253341"},{"type":"electronic","value":"9783540320050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11408079_69","type":"book-chapter","created":{"date-parts":[[2010,12,20]],"date-time":"2010-12-20T20:38:10Z","timestamp":1292877490000},"page":"761-772","source":"Crossref","is-referenced-by-count":23,"title":["Using Prefix-Trees for Efficiently Computing Set Joins"],"prefix":"10.1007","author":[{"given":"Ravindranath","family":"Jampani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vikram","family":"Pudi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"69_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. of Intl. Conf. on Very Large Databases (VLDB) (September 1994)"},{"key":"69_CR2","doi-asserted-by":"crossref","unstructured":"Cai, J., Chakaravarthy, V.T., Kaushik, R., Naughton, J.F.: On the complexity of join predicates. In: ACM SIGMOD-SIGACT-SIGART Symp. on Principles of Database Systems (2001)","DOI":"10.1145\/375551.375592"},{"key":"69_CR3","unstructured":"Grahne, G., Zhu, J.: Efficiently using prefix-trees in mining frequent itemsets. In: IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI) (2003)"},{"key":"69_CR4","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proc. of ACM SIGMOD Intl. Conf. on Management of Data (2000)","DOI":"10.1145\/342009.335372"},{"key":"69_CR5","unstructured":"Helmer, S., Moerkotte, G.: Evaluation of main memory join algorithms for joins with set comparison join predicates. In: Proc. of Intl. Conf. on Very Large Databases (VLDB) (1997)"},{"key":"69_CR6","unstructured":"Helmer, S., Moerkotte, G.: A study of four index structures for set-valued attributes of low cardinality. Technical report, University of Mannheim (1999)"},{"key":"69_CR7","doi-asserted-by":"crossref","unstructured":"Mamoulis, N.: Efficient processing of joins on set-valued attributes. In: Proc. of ACM SIGMOD Intl. Conf. on Management of Data (2003)","DOI":"10.1145\/872757.872778"},{"key":"69_CR8","unstructured":"Melnik, S.: Set containment joins: Testbed, \n                    \n                      http:\/\/www-db.stanford.edu\/~melnik\/scj"},{"key":"69_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/3-540-45876-X_28","volume-title":"Advances in Database Technology - EDBT 2002","author":"S. Melnik","year":"2002","unstructured":"Melnik, S., Garcia-Molina, H.: Divide-and-conquer algorithm for computing set containment joins. In: Jensen, C.S., Jeffery, K., Pokorn\u00fd, J., \u0160altenis, S., Bertino, E., B\u00f6hm, K., Jarke, M. (eds.) EDBT 2002. LNCS, vol.\u00a02287, p. 427. Springer, Heidelberg (2002)"},{"key":"69_CR10","doi-asserted-by":"crossref","unstructured":"Melnik, S., Garcia-Molina, H.: Adaptive algorithms for set containment joins. ACM Transactions on Database Systems (TODS) 28(2) (2003)","DOI":"10.1145\/762471.762474"},{"key":"69_CR11","unstructured":"Ramasamy, K., Patel, J.M., Naughton, J.F., Kaushik, R.: Set containment joins: the good, the bad and the ugly. In: Proc. of Intl. Conf. on Very Large Databases (VLDB) (2000)"},{"key":"69_CR12","doi-asserted-by":"crossref","unstructured":"Rantzau, R.: Processing frequent itemset discovery queries by division and set containment join operators. In: 8th ACM SIGMOD DMKD Workshop (2003)","DOI":"10.1145\/882082.882089"},{"key":"69_CR13","doi-asserted-by":"crossref","unstructured":"Sarawagi, S., Kirpal, A.: Efficient set joins on similarity predicates. In: Proc. of ACM SIGMOD Intl. Conf. on Management of Data (2004)","DOI":"10.1145\/1007568.1007652"},{"key":"69_CR14","volume-title":"Object-relational DBMS: The Next Great Wave","author":"M. Stonebraker","year":"1996","unstructured":"Stonebraker, M.: Object-relational DBMS: The Next Great Wave. Morgan Kaufmann, San Francisco (1996)"},{"key":"69_CR15","doi-asserted-by":"crossref","unstructured":"Zheng, Z., Kohavi, R., Mason, L.: Real world performance of association rule algorithms. In: Intl. Conf. on Knowledge Discovery and Data Mining (KDD) (2001)","DOI":"10.1145\/502512.502572"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11408079_69.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:03:18Z","timestamp":1619506998000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11408079_69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540253341","9783540320050"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11408079_69","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}