{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:27:47Z","timestamp":1743035267295,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642245824"},{"type":"electronic","value":"9783642245831"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24583-1_31","type":"book-chapter","created":{"date-parts":[[2011,9,30]],"date-time":"2011-09-30T13:08:23Z","timestamp":1317388103000},"page":"313-325","source":"Crossref","is-referenced-by-count":0,"title":["COCA Filters: Co-occurrence Aware Bloom Filters"],"prefix":"10.1007","author":[{"given":"Kamran","family":"Tirdad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedram","family":"Ghodsnia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Ian","family":"Munro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alejandro","family":"L\u00f3pez-Ortiz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"http:\/\/www.google.com\/programming-contest (2002) (accessed, January 2011)","DOI":"10.1145\/504689.504690"},{"key":"31_CR2","unstructured":"http:\/\/www.wikipediaondvd.com\/site.php (2007) (accessed, January 2011)"},{"key":"31_CR3","unstructured":"http:\/\/schools-wikipedia.org (2008) (accessed, January 2011)"},{"key":"31_CR4","unstructured":"http:\/\/en.wikipedia.org\/wiki\/Wikipedia:Words_per_article (2009) (accessed, January 2011)"},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B.H. Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM\u00a013, 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"issue":"4","key":"31_CR6","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.ipl.2008.05.018","volume":"108","author":"P. Bose","year":"2008","unstructured":"Bose, P., Guo, H., Kranakis, E., Maheshwari, A., Morin, P., Morrison, J., Smid, M.H.M., Tang, Y.: On the false-positive rate of bloom filters. Inf. Process. Lett.\u00a0108(4), 210\u2013213 (2008)","journal-title":"Inf. Process. Lett."},{"key":"31_CR7","unstructured":"Broder, A., Mitzenmacher, M.: Network applications of bloom filters: A survey. In: Internet Mathematics, pp. 636\u2013646 (2002)"},{"key":"31_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45123-4_1","volume-title":"Combinatorial Pattern Matching","author":"A. Broder","year":"2000","unstructured":"Broder, A.: Identifying and filtering near-duplicate documents. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol.\u00a01848, pp. 1\u201310. Springer, Heidelberg (2000)"},{"key":"31_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1007\/3-540-45022-X_67","volume-title":"Automata, Languages and Programming","author":"A. Broder","year":"2000","unstructured":"Broder, A.: Min-wise independent permutations: Theory and practice. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, p. 808. Springer, Heidelberg (2000)"},{"issue":"2","key":"31_CR10","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1089\/10665270252935430","volume":"9","author":"J. Buhler","year":"2002","unstructured":"Buhler, J., Tompa, M.: Finding motifs using random projections. Journal of Computational Biology\u00a09(2), 225\u2013242 (2002)","journal-title":"Journal of Computational Biology"},{"issue":"3","key":"31_CR11","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1016\/j.ipm.2003.12.003","volume":"41","author":"B. Carterette","year":"2005","unstructured":"Carterette, B., Can, F.: Comparing inverted files and signature files for searching a large lexicon. Inf. Process. Manage.\u00a041(3), 613\u2013633 (2005)","journal-title":"Inf. Process. Manage."},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Charikar, M.: Similarity estimation techniques from rounding algorithms. In: STOC, pp. 380\u2013388 (2002)","DOI":"10.1145\/509907.509965"},{"key":"31_CR13","unstructured":"Chazelle, B., Kilian, J., Rubinfeld, R., Tal, A.: The bloomier filter: an efficient data structure for static support lookup tables. In: SODA, pp. 30\u201339 (2004)"},{"key":"31_CR14","first-page":"241","volume-title":"Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, SIGMOD 2003","author":"S. Cohen","year":"2003","unstructured":"Cohen, S., Matias, Y.: Spectral bloom filters. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, SIGMOD 2003, pp. 241\u2013252. ACM, New York (2003)"},{"key":"31_CR15","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1145\/2275.357411","volume":"2","author":"C. Faloutsos","year":"1984","unstructured":"Faloutsos, C., Christodoulakis, S.: Signature files: an access method for documents and its analytical performance evaluation. ACM Trans. Inf. Syst.\u00a02, 267\u2013288 (1984)","journal-title":"ACM Trans. Inf. Syst."},{"key":"31_CR16","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1109\/90.851975","volume":"8","author":"L. Fan","year":"2000","unstructured":"Fan, L., Cao, P., Almeida, J., Broder, A.Z.: Summary cache: a scalable wide-area web cache sharing protocol. IEEE\/ACM Trans. Netw.\u00a08, 281\u2013293 (2000)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"31_CR17","doi-asserted-by":"crossref","unstructured":"Georgescu, B., Shimshoni, I., Meer, P.: Mean shift based clustering in high dimensions: A texture classification example. In: ICCV, pp. 456\u2013463 (2003)","DOI":"10.1109\/ICCV.2003.1238382"},{"key":"31_CR18","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1145\/1811099.1811056","volume":"38","author":"A. Goel","year":"2010","unstructured":"Goel, A., Gupta, P.: Small subset queries and bloom filters using ternary associative memories, with applications. SIGMETRICS Perform. Eval. Rev.\u00a038, 143\u2013154 (2010)","journal-title":"SIGMETRICS Perform. Eval. Rev."},{"key":"31_CR19","unstructured":"Haveliwala, T.H., Gionis, A., Indyk, P.: Scalable techniques for clustering the web. In: WebDB (Informal Proceedings), pp. 129\u2013134 (2000)"},{"key":"31_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-540-45172-3_19","volume-title":"Peer-to-Peer Systems II","author":"J. Li","year":"2003","unstructured":"Li, J., Loo, B., Hellerstein, J., Kaashoek, M., Karger, D., Morris, R.: On the feasibility of peer-to-peer web indexing and search. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol.\u00a02735, pp. 207\u2013215. Springer, Heidelberg (2003)"},{"key":"31_CR21","unstructured":"Matousek, J.: On restricted min-wise independence of permutations (2002)"},{"issue":"5","key":"31_CR22","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1109\/32.52778","volume":"16","author":"J. Mullin","year":"1990","unstructured":"Mullin, J.: Optimal semijoins for distributed database systems. IEEE Transactions on Software Engineering\u00a016(5), 558\u2013560 (1990)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"31_CR23","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1002\/spe.4380200607","volume":"20","author":"J.K. Mullin","year":"1990","unstructured":"Mullin, J.K., Margoliash, D.J.: A tale of three spelling checkers. Softw. Pract. Exper.\u00a020, 625\u2013630 (1990)","journal-title":"Softw. Pract. Exper."},{"key":"31_CR24","doi-asserted-by":"crossref","unstructured":"Ouyang, Z., Memon, N.D., Suel, T., Trendafilov, D.: Cluster-based delta compression of a collection of files. In: WISE, pp. 257\u2013268 (2002)","DOI":"10.1109\/WISE.2002.1181662"},{"key":"31_CR25","unstructured":"Pagh, A., Pagh, R., Rao, S.S.: An optimal bloom filter replacement. In: SODA 2005, pp. 823\u2013829 (2005)"},{"key":"31_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/3-540-44892-6_2","volume-title":"Middleware 2003","author":"P. Reynolds","year":"2003","unstructured":"Reynolds, P., Vahdat, A.: Efficient peer-to-peer keyword searching. In: Endler, M., Schmidt, D.C. (eds.) Middleware 2003. LNCS, vol.\u00a02672, pp. 21\u201340. Springer, Heidelberg (2003)"},{"issue":"1-2","key":"31_CR27","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0020-0190(99)00163-5","volume":"73","author":"M. Saks","year":"2000","unstructured":"Saks, M., Srinivasan, A., Zhou, S., Zuckerman, D.: Low discrepancy sets yield approximate min-wise independent permutation families. Information Processing Letters\u00a073(1-2), 29\u201332 (2000)","journal-title":"Information Processing Letters"},{"issue":"3","key":"31_CR28","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0167-4048(92)90207-8","volume":"11","author":"E.H. Spafford","year":"1992","unstructured":"Spafford, E.H.: Opus: Preventing weak password choices. Computers & Security\u00a011(3), 273\u2013278 (1992)","journal-title":"Computers & Security"},{"key":"31_CR29","unstructured":"Yang, C.: Macs: music audio characteristic sequence indexing for similarity retrieval. In: 2001 IEEE Workshop on the Applications of Signal Processing to Audio and Acoustics, pp. 123\u2013126 (2001)"},{"key":"31_CR30","doi-asserted-by":"crossref","unstructured":"Zobel, J., Moffat, A.: Inverted files for text search engines. ACM Comput. Surv.\u00a038(2) (2006)","DOI":"10.1145\/1132956.1132959"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24583-1_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T16:32:14Z","timestamp":1560702734000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24583-1_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642245824","9783642245831"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24583-1_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}