{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T13:44:49Z","timestamp":1758462289827,"version":"3.44.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032057266","type":"print"},{"value":"9783032057273","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,22]],"date-time":"2025-09-22T00:00:00Z","timestamp":1758499200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,22]],"date-time":"2025-09-22T00:00:00Z","timestamp":1758499200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-05727-3_17","type":"book-chapter","created":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T07:44:28Z","timestamp":1758440668000},"page":"171-180","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Evaluation of\u00a0Energy Consumption for\u00a0Deep Learning-Based Privacy Preserving Record Linkage"],"prefix":"10.1007","author":[{"given":"Emmanouil","family":"Sokorelis","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7836-8444","authenticated-orcid":false,"given":"Alexandros","family":"Karakasidis","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3876-0024","authenticated-orcid":false,"given":"Eftychios","family":"Protopapadakis","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8501-8899","authenticated-orcid":false,"given":"Chairi","family":"Kiourt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,22]]},"reference":[{"key":"17_CR1","unstructured":"Bachteler, T., Reiher, J.: A test data generator for evaluating record linkage methods. Technical report, German RLC Work. Paper No. wp-grlc-2012-01 (2012)"},{"issue":"2","key":"17_CR2","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/MIC.2018.112102542","volume":"22","author":"F Chen","year":"2018","unstructured":"Chen, F., et al.: Perfectly secure and efficient two-party electronic-health-record linkage. IEEE Internet Comput. 22(2), 32\u201341 (2018)","journal-title":"IEEE Internet Comput."},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Christen, P., Ranbaduge, T., Schnell, R.: Linking Sensitive Data - Methods and Techniques for Practical Privacy-Preserving Information Sharing. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-59706-1"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"David, H., Gorbatov, E., Hanebutte, U., Khanna, R., Le, C.: RAPL: memory power estimation and capping. In: Proceedings of the 16th ACM\/IEEE International Symposium on Low Power Electronics and Design (ISLPED), pp. 189\u2013194. ACM (2010)","DOI":"10.1145\/1840845.1840883"},{"issue":"10","key":"17_CR5","doi-asserted-by":"publisher","first-page":"2623","DOI":"10.1109\/TIFS.2019.2903651","volume":"14","author":"A Essex","year":"2019","unstructured":"Essex, A.: Secure approximate string matching for privacy-preserving record linkage. IEEE Trans. Inf. Forensics Secur. 14(10), 2623\u20132632 (2019)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"17_CR6","unstructured":"Franke, M., Sehili, Z., Rohde, F., Rahm, E.: Evaluation of hardening techniques for privacy-preserving record linkage. In: 24th International Conference on Extending Database Technology, pp. 289\u2013300. OpenProceedings.org (2021)"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"4966","DOI":"10.1109\/TIFS.2021.3114026","volume":"16","author":"A Gkoulalas-Divanis","year":"2021","unstructured":"Gkoulalas-Divanis, A., Vatsalan, D., Karapiperis, D., Kantarcioglu, M.: Modern privacy-preserving record linkage techniques: an overview. IEEE Trans. Inf. Forensics Secur. 16, 4966\u20134987 (2021)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Guti\u00e9rrez Hermosillo\u00a0Muriedas, J.P., Fl\u00fcgel, K., Debus, C., Obermaier, H., Streit, A., G\u00f6tz, M.: perun: benchmarking energy consumption of high-performance computing applications. In: Cano, J., Dikaiakos, M.D., Papadopoulos, G.A., Peric\u00e0s, M., Sakellariou, R. (eds.) Euro-Par 2023: Parallel Processing, pp. 17\u201331. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-39698-4_2"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Li, H., et al.: On leveraging large language models for enhancing entity resolution. arXiv preprint arXiv:2401.03426 (2024)","DOI":"10.1145\/3589335.3651245"},{"key":"17_CR10","series-title":"Transactions on Computational Science and Computational Intelligence","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-030-70296-0_10","volume-title":"Advances in Artificial Intelligence and Applied Cognitive Computing","author":"X Li","year":"2021","unstructured":"Li, X., Talburt, J.R., Li, T., Liu, X.: When entity resolution meets deep learning, is similarity measure necessary? In: Arabnia, H.R., Ferens, K., de la Fuente, D., Kozerenko, E.B., Olivas Varela, J.A., Tinetti, F.G. (eds.) Advances in Artificial Intelligence and Applied Cognitive Computing. TCSCI, pp. 127\u2013140. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-70296-0_10"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-319-97310-4_55","volume-title":"PRICAI 2018: Trends in Artificial Intelligence","author":"Y Lv","year":"2018","unstructured":"Lv, Y., Qi, L., Huo, J., Wang, H., Gao, Y.: Joint multi-field Siamese recurrent neural network for entity resolution. In: Geng, X., Kang, B.-H. (eds.) PRICAI 2018. LNCS (LNAI), vol. 11013, pp. 482\u2013490. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-97310-4_55"},{"key":"17_CR12","unstructured":"Mullaymeri, X., Karakasidis, A.: Using fuzzy vaults for privacy preserving record linkage. In: The 23rd International Workshop on Design, Optimization, Languages and Analytical Processing of Big Data. CEUR Workshop Proceedings, vol.\u00a02840, pp. 101\u2013110. CEUR-WS.org (2021)"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-030-47436-2_11","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"T Ranbaduge","year":"2020","unstructured":"Ranbaduge, T., Christen, P., Schnell, R.: Secure and accurate two-step hash encoding for privacy-preserving record linkage. In: Lauw, H.W., Wong, R.C.-W., Ntoulas, A., Lim, E.-P., Ng, S.-K., Pan, S.J. (eds.) PAKDD 2020. LNCS (LNAI), vol. 12085, pp. 139\u2013151. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-47436-2_11"},{"issue":"11","key":"17_CR14","doi-asserted-by":"publisher","first-page":"6839","DOI":"10.1109\/TKDE.2023.3342757","volume":"36","author":"T Ranbaduge","year":"2023","unstructured":"Ranbaduge, T., Vatsalan, D., Ding, M.: Privacy-preserving deep learning based record linkage. IEEE Trans. Knowl. Data Eng. 36(11), 6839\u20136850 (2023)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Rao, F., Cao, J., Bertino, E., Kantarcioglu, M.: Hybrid private record linkage: separating differentially private synopses from matching records. ACM Trans. Priv. Secur. 22(3), 15:1\u201315:36 (2019)","DOI":"10.1145\/3318462"},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jnca.2018.02.006","volume":"108","author":"A Saleem","year":"2018","unstructured":"Saleem, A., Khan, A., Shahid, F., Alam, M., Khan, M.K.: Recent advancements in garbled computing: how far have we come towards achieving secure, efficient and reusable garbled circuits. J. Netw. Comput. Appl. 108, 1\u201319 (2018)","journal-title":"J. Netw. Comput. Appl."},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1186\/1472-6947-9-41","volume":"9","author":"R Schnell","year":"2009","unstructured":"Schnell, R., Bachteler, T., Reiher, J.: Privacy-preserving record linkage using bloom filters. BMC Med. Inform. Decis. Mak. 9, 41 (2009)","journal-title":"BMC Med. Inform. Decis. Mak."},{"key":"17_CR18","first-page":"271","volume":"34","author":"D Smith","year":"2017","unstructured":"Smith, D.: Secure pseudonymisation for privacy-preserving probabilistic record linkage. J. Inf. Secur. Appl. 34, 271\u2013279 (2017)","journal-title":"J. Inf. Secur. Appl."},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"Strubell, E., Ganesh, A., McCallum, A.: Energy and policy considerations for deep learning in NLP (2019). https:\/\/arxiv.org\/abs\/1906.02243","DOI":"10.18653\/v1\/P19-1355"}],"container-title":["Communications in Computer and Information Science","New Trends in Database and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-05727-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T07:44:32Z","timestamp":1758440672000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-05727-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,22]]},"ISBN":["9783032057266","9783032057273"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-05727-3_17","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,22]]},"assertion":[{"value":"22 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that\u00a0are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"ADBIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Advances in Databases and Information Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tampere","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Finland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adbis2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adbis2025.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}