{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T12:48:55Z","timestamp":1777726135174,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642374869","type":"print"},{"value":"9783642374876","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37487-6_7","type":"book-chapter","created":{"date-parts":[[2013,4,17]],"date-time":"2013-04-17T03:55:02Z","timestamp":1366170902000},"page":"56-70","source":"Crossref","is-referenced-by-count":2,"title":["Similarity Joins on Item Set Collections Using Zero-Suppressed Binary Decision Diagrams"],"prefix":"10.1007","author":[{"given":"Yasuyuki","family":"Shirai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroyuki","family":"Takashima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Koji","family":"Tsuruma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satoshi","family":"Oyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Arasu, A., Ganti, V., Kaushik, R.: Efficient Exact Set-Similarity Joins. In: Proc. of 32nd International Conference on Very Large Data Bases, VLDB 2006 (2006)"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J., Ma, Y., Srikant, R.: Scaling Up All Pairs Similarity Search. In: Proc. of 16th International Conference on World Wide Web (2007)","DOI":"10.1145\/1242572.1242591"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers 35(8) (1986)","DOI":"10.1109\/TC.1986.1676819"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Chaudhuri, S., Ganti, V., Kaushik, R.: A Primitive Operator for Similarity Joins in Data Cleaning. In: Proc. of 22nd International Conference on Data Engineering, ICDE 2006 (2006)","DOI":"10.1109\/ICDE.2006.9"},{"key":"7_CR5","unstructured":"Denzumi, S., Yoshinaka, R., Minato, S., Arimura, H.: Efficient Algorithms on Sequence Binary Decision Diagrams for Manipulating Sets of Strings, Hokkaido University, TCS Technical Reports, TCS-TR-A-11-53 (2011)"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s00778-011-0252-8","volume":"21","author":"J. Feng","year":"2012","unstructured":"Feng, J., Wang, J., Li, G.: Trie-join: a trie-based method for efficient string similarity joins. The VLDB Journal\u00a021, 437\u2013461 (2012)","journal-title":"The VLDB Journal"},{"key":"7_CR7","unstructured":"Knuth, D.E.: The Art of Computer Programming. Bitwise Tricks & Techniques, vol.\u00a04(1), pp. 117\u2013126. Addison-Wesley (2009)"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Loekito, E., Bailey, J., Pei, J.: A Binary decision diagram based approach for mining frequent subsequences. Knowledge and Information Systems\u00a024(2) (2010)","DOI":"10.1007\/s10115-009-0252-9"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Minato, S.: Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems. In: Proc. of 30th ACM\/IEEE Design Automation Conference, DAC 1993 (1993)","DOI":"10.1145\/157485.164890"},{"key":"7_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/11605126_3","volume-title":"Federation over the Web","author":"S.-I. Minato","year":"2006","unstructured":"Minato, S.-I.: VSOP (Valued-Sum-of-Products) Calculator for Knowledge Processing Based on Zero-Suppressed BDDs. In: Jantke, K.P., Lunzer, A., Spyratos, N., Tanaka, Y. (eds.) Federation over the Web. LNCS (LNAI), vol.\u00a03847, pp. 40\u201358. Springer, Heidelberg (2006)"},{"key":"7_CR11","unstructured":"Minato, S.: Implicit Manipulation of Polynomials Using Zero-Suppressed BDDs. In: Proc. of IEEE The European Design and Test Conference (1995)"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-540-27868-9_18","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"M. Neuhaus","year":"2004","unstructured":"Neuhaus, M., Bunke, H.: An Error-tolerant Approximate Matching Algorithm for Attributed Planar Graphs and its Application to Fingerprint Classification. In: Fred, A., Caelli, T.M., Duin, R.P.W., Campilho, A.C., de Ridder, D. (eds.) SSPR&SPR 2004. LNCS, vol.\u00a03138, pp. 180\u2013189. Springer, Heidelberg (2004)"},{"key":"7_CR13","unstructured":"Oflazer, K.: Error-tolerant Finite-state Recognition with Applications to Morphological Analysis and Spelling Correction. Computational Linguistics 22(1) (1996)"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Oflazer, K.: Error-tolerant Tree Matching. In: Proc. of 16th Conference on Computational Linguistics, COLING 1996 (1996)","DOI":"10.3115\/993268.993317"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Shimizu, K., Tsuda, K.: SlideSort: All Pairs Similarity Search for Short Reads. Bioinformatics 27(4) (2011)","DOI":"10.1093\/bioinformatics\/btq677"},{"key":"7_CR16","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-30217-6_16","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Y. Shirai","year":"2012","unstructured":"Shirai, Y., Tsuruma, K., Sakurai, Y., Oyama, S., Minato, S.-I.: Incremental Set Recommendation Based on Class Differences. In: Tan, P.-N., Chawla, S., Ho, C.K., Bailey, J. (eds.) PAKDD 2012, Part I. LNCS (LNAI), vol.\u00a07301, pp. 183\u2013194. Springer, Heidelberg (2012)"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Wang, J., Feng, J., Li, G.: Trie-Join: Efficient Trie-based String Similarity Joins with EditDistance Constraints. In: Proc. of the VLDB Endowment, vol. 3(1-2) (2010)","DOI":"10.14778\/1920841.1920992"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Xiao, C., Wang, W., Lin, X.: Ed-join: an efficient algorithm for similarity joins with edit distance constraints. In: Proc. of VLDB Endowment, vol. 1(1) (2008)","DOI":"10.14778\/1453856.1453957"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Xiao, C., Wang, W., Lin, X., Yu, J.X.: Efficient Similarity Joins for Near Duplicate Detection. In: Proc. of 17th International Conference on World Wide Web (2008)","DOI":"10.1145\/1367497.1367516"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37487-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T07:50:04Z","timestamp":1557647404000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37487-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642374869","9783642374876"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37487-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}