{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T13:13:54Z","timestamp":1762002834225,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319736969"},{"type":"electronic","value":"9783319736976"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-73697-6_11","type":"book-chapter","created":{"date-parts":[[2018,1,5]],"date-time":"2018-01-05T02:53:43Z","timestamp":1515120823000},"page":"144-157","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Expediting MRSH-v2 Approximate Matching with Hierarchical Bloom Filter Trees"],"prefix":"10.1007","author":[{"given":"David","family":"Lillis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Breitinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Scanlon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,6]]},"reference":[{"issue":"Supplement 1","key":"11_CR1","doi-asserted-by":"publisher","first-page":"S54","DOI":"10.1016\/j.diin.2014.03.007","volume":"11","author":"R Baar van","year":"2014","unstructured":"van Baar, R., van Beek, H., van Eijk, E.: Digital forensics as a service: a game changer. Digit. Invest. 11(Supplement 1), S54\u2013S62 (2014). \nhttps:\/\/doi.org\/10.1016\/j.diin.2014.03.007","journal-title":"Digit. Invest."},{"issue":"7","key":"11_CR2","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"11_CR3","doi-asserted-by":"publisher","unstructured":"de Braekt, R.I., Le-Khac, N.A., Farina, J., Scanlon, M., Kechadi, T.: Increasing digital investigator availability through efficient workflow management and automation. In: 2016 4th International Symposium on Digital Forensic and Security (ISDFS), pp. 68\u201373 (2016). \nhttps:\/\/doi.org\/10.1109\/ISDFS.2016.7473520","DOI":"10.1109\/ISDFS.2016.7473520"},{"key":"11_CR4","series-title":"Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-642-39891-9_11","volume-title":"Digital Forensics and Cyber Crime","author":"F Breitinger","year":"2013","unstructured":"Breitinger, F., Baier, H.: Similarity preserving hashing: eligible properties and a new algorithm MRSH-v2. In: Rogers, M., Seigfried-Spellar, K.C. (eds.) ICDF2C 2012. LNICST, vol. 114, pp. 167\u2013182. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-39891-9_11"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"S1","DOI":"10.1016\/j.diin.2014.03.001","volume":"11","author":"F Breitinger","year":"2014","unstructured":"Breitinger, F., Baier, H., White, D.: On the database lookup problem of approximate matching. Digit. Invest. 11, S1\u2013S9 (2014). \nhttps:\/\/doi.org\/10.1016\/j.diin.2014.03.001","journal-title":"Digit. Invest."},{"key":"11_CR6","first-page":"168","volume":"800","author":"F Breitinger","year":"2014","unstructured":"Breitinger, F., Guttman, B., McCarrin, M., Roussev, V., White, D.: Approximate matching: definition and terminology. NIST Spec. Publ. 800, 168 (2014)","journal-title":"NIST Spec. Publ."},{"issue":"2","key":"11_CR7","first-page":"155","volume":"9","author":"F Breitinger","year":"2014","unstructured":"Breitinger, F., Rathgeb, C., Baier, H.: An efficient similarity digests database lookup - a logarithmic divide & conquer approach. J. Digit. Forensics Secur. Law 9(2), 155\u2013166 (2014)","journal-title":"J. Digit. Forensics Secur. Law"},{"key":"11_CR8","doi-asserted-by":"publisher","unstructured":"Broder, A.Z.: On the resemblance and containment of documents. In: Compression and Complexity of Sequences 1997, Proceedings, pp. 21\u201329. IEEE (1997). \nhttps:\/\/doi.org\/10.1109\/SEQUEN.1997.666900","DOI":"10.1109\/SEQUEN.1997.666900"},{"issue":"6","key":"11_CR9","doi-asserted-by":"crossref","first-page":"1353","DOI":"10.1111\/j.1556-4029.2009.01150.x","volume":"54","author":"E Casey","year":"2009","unstructured":"Casey, E., Ferraro, M., Nguyen, L.: Investigation delayed is justice denied: proposals for expediting forensic examinations of digital evidence. J. Forensic Sci. 54(6), 1353\u20131364 (2009)","journal-title":"J. Forensic Sci."},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2015.11.003","volume":"69","author":"JN Gupta","year":"2016","unstructured":"Gupta, J.N., Kalaimannan, E., Yoo, S.M.: A heuristic for maximizing investigation effectiveness of digital forensic cases involving multiple investigators. Comput. Oper. Res. 69, 1\u20139 (2016). \nhttps:\/\/doi.org\/10.1016\/j.cor.2015.11.003","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"11_CR11","first-page":"59","volume":"11","author":"VS Harichandran","year":"2016","unstructured":"Harichandran, V.S., Breitinger, F., Baggili, I.: Bytewise approximate matching: the good, the bad, and the unknown. J. Digit. Forensics Secur. Law: JDFSL 11(2), 59 (2016)","journal-title":"J. Digit. Forensics Secur. Law: JDFSL"},{"issue":"3","key":"11_CR12","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10207-014-0249-6","volume":"14","author":"JI James","year":"2015","unstructured":"James, J.I., Gladyshev, P.: Automated inference of past action instances in digital investigations. Int. J. Inf. Secur. 14(3), 249\u2013261 (2015). \nhttps:\/\/doi.org\/10.1007\/s10207-014-0249-6","journal-title":"Int. J. Inf. Secur."},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.diin.2006.06.015","volume":"3","author":"J Kornblum","year":"2006","unstructured":"Kornblum, J.: Identifying identical files using context triggered piecewise hashing. Digit. Invest. 3, 91\u201397 (2006). \nhttps:\/\/doi.org\/10.1016\/j.diin.2006.06.015","journal-title":"Digit. Invest."},{"key":"11_CR14","doi-asserted-by":"publisher","unstructured":"Lillis, D., Becker, B., O\u2019Sullivan, T., Scanlon, M.: Current challenges and future research areas for digital forensic investigation. In: 11th ADFSL Conference on Digital Forensics, Security and Law (CDFSL 2016), ADFSL, Daytona Beach, FL, USA (2016). \nhttps:\/\/doi.org\/10.13140\/RG.2.2.34898.76489","DOI":"10.13140\/RG.2.2.34898.76489"},{"key":"11_CR15","doi-asserted-by":"publisher","unstructured":"Oliver, J., Cheng, C., Chen, Y.: TLSH-a locality sensitive hash. In: Cybercrime and Trustworthy Computing Workshop (CTC), 2013 Fourth, pp. 7\u201313. IEEE (2013). \nhttps:\/\/doi.org\/10.1109\/CTC.2013.9","DOI":"10.1109\/CTC.2013.9"},{"issue":"4","key":"11_CR16","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.diin.2014.09.002","volume":"11","author":"D Quick","year":"2014","unstructured":"Quick, D., Choo, K.K.R.: Impacts of increasing volume of digital forensic data: a survey and future research challenges. Digit. Invest. 11(4), 273\u2013294 (2014). \nhttps:\/\/doi.org\/10.1016\/j.diin.2014.09.002","journal-title":"Digit. Invest."},{"issue":"2","key":"11_CR17","first-page":"19","volume":"1","author":"MK Rogers","year":"2006","unstructured":"Rogers, M.K., Goldman, J., Mislan, R., Wedge, T., Debrota, S.: Computer forensics field triage process model. J. Digit. Forensics Secur. Law 1(2), 19\u201338 (2006)","journal-title":"J. Digit. Forensics Secur. Law"},{"key":"11_CR18","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-15506-2_15","volume-title":"IFIP International Conference on Digital Forensics","author":"V Roussev","year":"2010","unstructured":"Roussev, V.: Data fingerprinting with similarity digests. In: Chow, K.P., Shenoi, S. (eds.) IFIP International Conference on Digital Forensics. IFIP AICT, vol. 337, pp. 207\u2013226. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-15506-2_15"},{"key":"11_CR19","doi-asserted-by":"crossref","first-page":"S34","DOI":"10.1016\/j.diin.2011.05.005","volume":"8","author":"V Roussev","year":"2011","unstructured":"Roussev, V.: An evaluation of forensic similarity hashes. Digit. Invest. 8, S34\u2013S41 (2011)","journal-title":"Digit. Invest."},{"key":"11_CR20","unstructured":"Roussev, V., Richard III, G.G.: Breaking the performance wall: the case for distributed digital forensics. In: Proceedings of the 2004 Digital Forensics Research Workshop, vol. 94 (2004)"},{"key":"11_CR21","unstructured":"Sadowski, C., Levin, G.: Simhash: hash-based similarity detection. Technical report, Google (2007)"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Scanlon, M.: Battling the digital forensic backlog through data deduplication. In: Proceedings of the 6th IEEE International Conference on Innovative Computing Technologies (INTECH 2016). IEEE, Dublin (2016)","DOI":"10.1109\/INTECH.2016.7845139"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Digital Forensics and Cyber Crime"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-73697-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,1,5]],"date-time":"2018-01-05T02:58:02Z","timestamp":1515121082000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-73697-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319736969","9783319736976"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73697-6_11","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2018]]}}}