{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:26:52Z","timestamp":1742945212783,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030185756"},{"type":"electronic","value":"9783030185763"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-18576-3_20","type":"book-chapter","created":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T08:05:29Z","timestamp":1556006729000},"page":"330-349","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Selectivity Estimation on Set Containment Search"],"prefix":"10.1007","author":[{"given":"Yang","family":"Yang","sequence":"first","affiliation":[]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Liping","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,24]]},"reference":[{"key":"20_CR1","unstructured":"http:\/\/www.informatik.uni-freiburg.de\/~cziegler\/BX\/"},{"key":"20_CR2","unstructured":"http:\/\/dai-labor.de\/IRML\/datasets"},{"key":"20_CR3","unstructured":"http:\/\/socialnetworks.mpi-sws.org\/data-imc2007.html"},{"key":"20_CR4","unstructured":"http:\/\/vi.sualize.us\/"},{"key":"20_CR5","unstructured":"Agarwal, P.K.: Range searching. Technical report, Duke University Durham NC Dept of Computer Science (1996)"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Agrawal, P., Arasu, A., Kaushik, R.: On indexing error-tolerant set containment. In: SIGMOD, pp. 927\u2013938 (2010)","DOI":"10.1145\/1807167.1807267"},{"key":"20_CR7","volume-title":"Modern Information Retrieval","author":"R Baeza-Yates","year":"1999","unstructured":"Baeza-Yates, R., Ribeiro-Neto, B., et al.: Modern Information Retrieval, vol. 463. ACM Press, New York (1999)"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45726-7_1","volume-title":"Randomization and Approximation Techniques in Computer Science","author":"Z Bar-Yossef","year":"2002","unstructured":"Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D., Trevisan, L.: Counting distinct elements in a data stream. In: Rolim, J.D.P., Vadhan, S. (eds.) RANDOM 2002. LNCS, vol. 2483, pp. 1\u201310. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45726-7_1"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Beyer, K., Haas, P.J., Reinwald, B., Sismanis, Y., Gemulla, R.: On synopses for distinct-value estimation under multiset operations. In: SIGMOD, pp. 199\u2013210 (2007)","DOI":"10.1145\/1247480.1247504"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Bouros, P., Mamoulis, N., Ge, S., Terrovitis, M.: Set containment join revisited. Knowl. Inf. Syst. 1\u201328 (2015)","DOI":"10.1007\/s10115-015-0895-7"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Chen, Z., Korn, F., Koudas, N., Muthukrishnan, S.: Selectivity estimation for boolean queries. In: PODS, pp. 216\u2013225 (2000)","DOI":"10.1145\/335168.335225"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Cohen, E., Cormode, G., Duffield, N.G.: Structure-aware sampling on data streams. In: SIGMETRICS, pp. 197\u2013208 (2011)","DOI":"10.1145\/1993744.1993763"},{"key":"20_CR13","unstructured":"Cohen, E., Cormode, G., Duffield, N.G.: Is min-wise hashing optimal for summarizing set intersction? In: PODS, pp. 109\u2013120 (2014)"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Das, A., Gehrke, J., Riedewald, M.: Approximation techniques for spatial data. In: SIGMOD, pp. 695\u2013706 (2004)","DOI":"10.1145\/1007568.1007646"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Goldman, R., Widom, J.: WSQ\/DSQ: a practical approach for combined querying of databases and the web. In: ACM SIGMOD Record, vol. 29, pp. 285\u2013296. ACM (2000)","DOI":"10.1145\/335191.335422"},{"issue":"3","key":"20_CR16","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/s00778-003-0106-0","volume":"12","author":"S Helmer","year":"2003","unstructured":"Helmer, S., Moerkotte, G.: A performance study of four index structures for set-valued attributes of low cardinality. VLDB J. 12(3), 244\u2013261 (2003)","journal-title":"VLDB J."},{"key":"20_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1007\/11408079_69","volume-title":"Database Systems for Advanced Applications","author":"R Jampani","year":"2005","unstructured":"Jampani, R., Pudi, V.: Using prefix-trees for efficiently computing set joins. In: Zhou, L., Ooi, B.C., Meng, X. (eds.) DASFAA 2005. LNCS, vol. 3453, pp. 761\u2013772. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11408079_69"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Li, C., Lu, J., Lu, Y.: Efficient merging and filtering algorithms for approximate string searches. In: ICDE, pp. 257\u2013266 (2008)","DOI":"10.1109\/ICDE.2008.4497434"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Luo, Y., Fletcher, G.H., Hidders, J., De Bra, P.: Efficient and scalable trie-based algorithms for computing set containment relations. In: ICDE, pp. 303\u2013314. IEEE (2015)","DOI":"10.1109\/ICDE.2015.7113293"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Mamoulis, N.: Efficient processing of joins on set-valued attributes. In: SIGMOD, pp. 157\u2013168. ACM (2003)","DOI":"10.1145\/872757.872778"},{"issue":"1","key":"20_CR21","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/762471.762474","volume":"28","author":"S Melnik","year":"2003","unstructured":"Melnik, S., Garcia Molina, H.: Adaptive algorithms for set containment joins. TODS 28(1), 56\u201399 (2003)","journal-title":"TODS"},{"key":"20_CR22","unstructured":"Ramasamy, K., Patel, J.M., Naughton, J.F., Kaushik, R.: Set containment joins: the good, the bad and the ugly. In: VLDB, pp. 351\u2013362 (2000)"},{"issue":"4","key":"20_CR23","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/s00454-006-1269-4","volume":"36","author":"S Suri","year":"2006","unstructured":"Suri, S., Toth, C., Zhou, Y.: Range counting over multidimensional data streams. Discrete Comput. Geometry 36(4), 633\u2013655 (2006)","journal-title":"Discrete Comput. Geometry"},{"key":"20_CR24","doi-asserted-by":"crossref","unstructured":"Terrovitis, M., Bouros, P., Vassiliadis, P., Sellis, T., Mamoulis, N.: Efficient answering of set containment queries for skewed item distributions. In: Proceedings of the 14th International Conference on Extending Database Technology, pp. 225\u2013236. ACM (2011)","DOI":"10.1145\/1951365.1951394"},{"issue":"1","key":"20_CR25","first-page":"3","volume":"22","author":"K Tzoumas","year":"2013","unstructured":"Tzoumas, K., Deshpande, A., Jensen, C.S.: Efficiently adapting graphical models for selectivity estimation. PVLDB 22(1), 3\u201327 (2013)","journal-title":"PVLDB"},{"key":"20_CR26","doi-asserted-by":"crossref","unstructured":"Vernica, R., Carey, M.J., Li, C.: Efficient parallel set-similarity joins using MapReduce. In: SIGMOD, pp. 495\u2013506. ACM (2010)","DOI":"10.1145\/1807167.1807222"},{"key":"20_CR27","doi-asserted-by":"crossref","unstructured":"Wang, J., Li, G., Feng, J.: Can we beat the prefix filtering?: an adaptive framework for similarity join and search. In: SIGMOD, pp. 85\u201396 (2012)","DOI":"10.1145\/2213836.2213847"},{"issue":"2","key":"20_CR28","first-page":"101","volume":"8","author":"X Wang","year":"2014","unstructured":"Wang, X., Zhang, Y., Zhang, W., Lin, X., Wang, W.: Selectivity estimation on streaming spatio-textual data using local correlations. PVLDB 8(2), 101\u2013112 (2014)","journal-title":"PVLDB"},{"key":"20_CR29","doi-asserted-by":"crossref","unstructured":"Xiao, C., Wang, W., Lin, X., Yu, J.X.: Efficient similarity joins for near duplicate detection. In: WWW, pp. 131\u2013140 (2008)","DOI":"10.1145\/1367497.1367516"},{"key":"20_CR30","doi-asserted-by":"crossref","unstructured":"Yang, J., Zhang, W., Yang, S., Zhang, Y. Lin, X.: TT-join: efficient set containment join. In: ICDE, pp. 509\u2013520 (2017)","DOI":"10.1109\/ICDE.2017.107"},{"key":"20_CR31","doi-asserted-by":"crossref","unstructured":"Yang, Y., Zhang, Y., Zhang, W., Huang, Z.: GB-KMV: an augmented kmv sketch for approximate containment similarity search. arXiv preprint arXiv:1809.00458 (2018)","DOI":"10.1109\/ICDE.2019.00048"},{"key":"20_CR32","doi-asserted-by":"crossref","unstructured":"Zhu, E., Nargesian, F., Pu, K.Q., Miller, R.J.: LSH ensemble: internet scale domain search. In: VLDB, pp. 1185\u20131196 (2016)","DOI":"10.14778\/2994509.2994534"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-18576-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:07:46Z","timestamp":1710335266000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-18576-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030185756","9783030185763"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-18576-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chiang Mai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thailand","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dasfaa2019.eng.cmu.ac.th\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"501","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"92","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"64","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13 demo papers, 6 tutorial papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}