{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T16:22:28Z","timestamp":1761582148808,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":52,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662645529"},{"type":"electronic","value":"9783662645536"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-662-64553-6_1","type":"book-chapter","created":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T18:07:30Z","timestamp":1638468450000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Parallel Quasi-identifier Discovery Scheme for Dependable Data Anonymisation"],"prefix":"10.1007","author":[{"given":"Nikolai J.","family":"Podlesny","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anne V. D. M.","family":"Kayem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christoph","family":"Meinel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Abedjan, Z., Naumann, F.: Advancing the discovery of unique column combinations. In: Proceedings of the 20th ACM International Conference on Information and Knowledge Management, pp. 1565\u20131570 (2011)","DOI":"10.1145\/2063576.2063801"},{"issue":"4","key":"1_CR2","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/s00778-015-0389-y","volume":"24","author":"Z Abedjan","year":"2015","unstructured":"Abedjan, Z., Golab, L., Naumann, F.: Profiling relational data: a survey. VLDB J. 24(4), 557\u2013581 (2015). https:\/\/doi.org\/10.1007\/s00778-015-0389-y","journal-title":"VLDB J."},{"issue":"4","key":"1_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2200\/S00878ED1V01Y201810DTM052","volume":"10","author":"Z Abedjan","year":"2018","unstructured":"Abedjan, Z., Golab, L., Naumann, F., Papenbrock, T.: Data profiling. Synth. Lect. Data Manage. 10(4), 1\u2013154 (2018)","journal-title":"Synth. Lect. Data Manage."},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-30570-5_17","volume-title":"Database Theory - ICDT 2005","author":"G Aggarwal","year":"2004","unstructured":"Aggarwal, G., et al.: Anonymizing tables. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol. 3363, pp. 246\u2013258. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30570-5_17"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Birnick, J., Bl\u00e4sius, T., Friedrich, T., Naumann, F., Papenbrock, T., Schirneck, M.: Hitting set enumeration with partial information for unique column combination discovery. In: Proceedings of the VLDB Endowment vol. 13, no. 11, pp. 2270\u20132283 (2020)","DOI":"10.14778\/3407790.3407824"},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Bl\u00e4sius, T., Friedrich, T., Schirneck, M.: The parameterized complexity of dependency detection in relational databases. In: Guo, J., Hermelin, D. (eds.) 11th International Symposium on Parameterized and Exact Computation (IPEC 2016), volume 63 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 6:1\u20136:13, Dagstuhl, Germany. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. ISBN: 978-3-95977-023-1 (2017). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2016.6, http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2017\/6920","DOI":"10.4230\/LIPIcs.IPEC.2016.6"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Bl\u00e4sius, T., Friedrich, T., Lischeid, J., Meeks, K., Schirneck, M.: Efficiently enumerating hitting sets of hypergraphs arising in data profiling. In: Algorithm Engineering and Experiments (ALENEX), pp. 130\u2013143 (2019)","DOI":"10.1137\/1.9781611975499.11"},{"key":"1_CR8","unstructured":"Braghin, S., Gkoulalas-Divanis, A., Wurst, M.: Detecting quasi-identifiers in datasets. US Patent 9,870,381, 16 January 2018"},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Cook, C., Zhao, H., Sato, T., Hiromoto, M., Tan, S.X.-D.: GPU-based ising computing for solving max-cut combinatorial optimization problems. Integration 69, 335\u2013344. ISSN: 0167-9260 (2019). https:\/\/doi.org\/10.1016\/j.vlsi.2019.07.003, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167926019301348","DOI":"10.1016\/j.vlsi.2019.07.003"},{"key":"1_CR10","unstructured":"Heer, D., Podlesny, J.: Process for the user-related answering of customer inquiries in data networks. US Patent 10,033,705, 24 July 2018"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-79228-4_1","volume-title":"Theory and Applications of Models of Computation","author":"C Dwork","year":"2008","unstructured":"Dwork, C.: Differential privacy: a survey of results. In: Agrawal, M., Du, D., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol. 4978, pp. 1\u201319. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79228-4_1"},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Dwork, C.: Differential privacy. In: van Tilborg, H.C.A., Jajodia, S. (eds.) Encyclopedia of Cryptography and Security. Springer, Boston (2011). https:\/\/doi.org\/10.1007\/978-1-4419-5906-5_752","DOI":"10.1007\/978-1-4419-5906-5_752"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Dwork, C., Roth, A., et al.: The algorithmic foundations of differential privacy. Found. Trends\u00ae Theoret. Comput. Sci. 9(3\u20134), 211\u2013407 (2014)","DOI":"10.1561\/0400000042"},{"key":"1_CR14","unstructured":"Gutmann, A., et al.: Privacy and progress in whole genome sequencing. Presidential Committee for the Study of Bioethical (2012)"},{"key":"1_CR15","unstructured":"Hamza, N., Hefny, H.A., et al.: Attacks on anonymization-based privacy-preserving: a survey for data mining and data publishing (2013)"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/978-3-319-11116-2_49","volume-title":"Web Technologies and Applications","author":"S Han","year":"2014","unstructured":"Han, S., Cai, X., Wang, C., Zhang, H., Wen, Y.: Discovery of unique column combinations with hadoop. In: Chen, L., Jia, Y., Sellis, T., Liu, G. (eds.) APWeb 2014. LNCS, vol. 8709, pp. 533\u2013541. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11116-2_49"},{"issue":"4","key":"1_CR17","doi-asserted-by":"publisher","first-page":"301","DOI":"10.14778\/2732240.2732248","volume":"7","author":"A Heise","year":"2013","unstructured":"Heise, A., Quian\u00e9-Ruiz, J.-A., Abedjan, Z., Jentzsch, A., Naumann, F.: Scalable discovery of unique column combinations. Proc. VLDB Endowment 7(4), 301\u2013312 (2013)","journal-title":"Proc. VLDB Endowment"},{"key":"1_CR18","unstructured":"Ilavarasi, A.K., Sathiyabhama, B., Poorani, S.: A survey on privacy preserving data mining techniques. Int. J. Comput. Sci. Bus. Inform. 7(1) (2013)"},{"key":"1_CR19","series-title":"The IBM Research Symposia Series","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. IRSS, pp. 85\u2013103. Springer, Boston (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Kavitha, S., Yamini, S., et al.: An evaluation on big data generalization using k-anonymity algorithm on cloud. In: 2015 IEEE 9th International Conference on Intelligent Systems and Control (ISCO), pp. 1\u20135. IEEE (2015)","DOI":"10.1109\/ISCO.2015.7282237"},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"S82","DOI":"10.1097\/MLR.0b013e3182585355","volume":"50","author":"CA Kushida","year":"2012","unstructured":"Kushida, C.A., Nichols, D.A., Jadrnicek, R., Miller, R., Walsh, J.K., Griffin, K.: Strategies for de-identification and anonymization of electronic health record data for use in multicenter research studies. Med. Care 50, S82\u2013S101 (2012)","journal-title":"Med. Care"},{"key":"1_CR22","doi-asserted-by":"publisher","unstructured":"Li, N., Li, T., Venkatasubramanian, S.: t-closeness: privacy beyond k-anonymity and l-diversity. In: 2007 IEEE 23rd ICDE, pp. 106\u2013115, April 2007. https:\/\/doi.org\/10.1109\/ICDE.2007.367856","DOI":"10.1109\/ICDE.2007.367856"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Li, N., Zeng, L., He, Q., Shi, Z.: Parallel implementation of apriori algorithm based on mapreduce. In 2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel\/Distributed Computing, pp. 236\u2013241. IEEE (2012)","DOI":"10.1109\/SNPD.2012.31"},{"issue":"1","key":"1_CR24","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1109\/TKDE.2006.14","volume":"18","author":"K Liu","year":"2006","unstructured":"Liu, K., Kargupta, H., Ryan, J.: Random projection-based multiplicative data perturbation for privacy preserving distributed data mining. IEEE Trans. Knowl. Data Eng. 18(1), 92\u2013106 (2006)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"1_CR25","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/1217299.1217302","volume":"1","author":"A Machanavajjhala","year":"2007","unstructured":"Machanavajjhala, A., Kifer, D., Gehrke, J., Venkitasubramaniam, M.: l-diversity: privacy beyond k-anonymity. ACM TKDD 1(1), 3 (2007)","journal-title":"ACM TKDD"},{"key":"1_CR26","unstructured":"Motwani, R., Xu, Y.: Efficient algorithms for masking and finding quasi-identifiers. In: Proceedings of the Conference on Very Large Data Bases (VLDB), pp. 83\u201393 (2007)"},{"issue":"2","key":"1_CR27","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1109\/MM.2010.41","volume":"30","author":"J Nickolls","year":"2010","unstructured":"Nickolls, J., Dally, W.J.: The GPU computing era. IEEE Micro 30(2), 56\u201369 (2010)","journal-title":"IEEE Micro"},{"issue":"5","key":"1_CR28","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1109\/JPROC.2008.917757","volume":"96","author":"JD Owens","year":"2008","unstructured":"Owens, J.D., Houston, M., Luebke, D., Green, S., Stone, J.E., Phillips, J.C.: GPU computing. Proc. IEEE 96(5), 879\u2013899 (2008)","journal-title":"Proc. IEEE"},{"key":"1_CR29","unstructured":"Papenbrock, T., Naumann, F.: A hybrid approach for efficient unique column combination discovery. Technologie und Web (BTW), Datenbanksysteme f\u00fcr Business, p. 2017 (2017)"},{"issue":"10","key":"1_CR30","doi-asserted-by":"publisher","first-page":"1082","DOI":"10.14778\/2794367.2794377","volume":"8","author":"T Papenbrock","year":"2015","unstructured":"Papenbrock, T., et al.: Functional dependency discovery: an experimental evaluation of seven algorithms. Proc. VLDB Endowment 8(10), 1082\u20131093 (2015)","journal-title":"Proc. VLDB Endowment"},{"key":"1_CR31","unstructured":"Podlesny, N.J.: Semi-synthetic genome data (2020). https:\/\/github.com\/jaSunny\/synthetic_genome_data"},{"key":"1_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-319-98809-2_6","volume-title":"Database and Expert Systems Applications","author":"NJ Podlesny","year":"2018","unstructured":"Podlesny, N.J., Kayem, A.V.D.M., von Schorlemer, S., Uflacker, M.: Minimising information loss on anonymised high dimensional data with greedy in-memory processing. In: Hartmann, S., Ma, H., Hameurlain, A., Pernul, G., Wagner, R.R. (eds.) DEXA 2018. LNCS, vol. 11029, pp. 85\u2013100. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98809-2_6"},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"Podlesny, N.J., Kayem, A.V.D.M., Meinel, C.: Identifying data exposure across high-dimensional health data silos through Bayesian networks optimised by multigrid and manifold. In: IEEE 17th International Conference on Dependable. Autonomic and Secure Computing (DASC), p. 2019. IEEE (2019)","DOI":"10.1109\/DASC\/PiCom\/CBDCom\/CyberSciTech.2019.00110"},{"key":"1_CR34","doi-asserted-by":"crossref","unstructured":"Podlesny, N.J., Kayem, A.V.D.M., Meinel, C.: Attribute compartmentation and greedy UCC discovery for high-dimensional data anonymization. In: Proceedings of the Ninth ACM Conference on Data and Application Security and Privacy, pp. 109\u2013119. ACM (2019)","DOI":"10.1145\/3292006.3300019"},{"key":"1_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-030-27615-7_3","volume-title":"Database and Expert Systems Applications","author":"NJ Podlesny","year":"2019","unstructured":"Podlesny, N.J., Kayem, A.V.D.M., Meinel, C.: Towards identifying de-anonymisation risks in distributed health data silos. In: Hartmann, S., K\u00fcng, J., Chakravarthy, S., Anderst-Kotsis, G., Tjoa, A.M., Khalil, I. (eds.) DEXA 2019. LNCS, vol. 11706, pp. 33\u201343. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-27615-7_3"},{"key":"1_CR36","doi-asserted-by":"crossref","unstructured":"Podlesny, N.J., Kayem, A.V.D.M., Meinel, C.: How data anonymisation techniques influence disease triage in digital health: a study on base rate neglect. In: Proceedings of the 2019 International Conference on Digital Health. ACM (2019)","DOI":"10.1145\/3357729.3357737"},{"key":"1_CR37","unstructured":"Podlesny, N.J.: High-dimensional data anonymization for in-memory applications. US Patent 10,747,901, 18 August 2020"},{"key":"1_CR38","unstructured":"Polat, H., Du, W.: Privacy-preserving collaborative filtering using randomized perturbation techniques. In Third IEEE International Conference on Data Mining. ICDM 2003, pp. 625\u2013628. IEEE (2003)"},{"key":"1_CR39","unstructured":"Presswala, F., Thakkar, A., Bhatt, N.: Survey on anonymization in privacy preserving data mining (2015)"},{"key":"1_CR40","volume-title":"CUDA by Example: An Introduction to General-Purpose GPU Programming","author":"J Sanders","year":"2010","unstructured":"Sanders, J., Kandrot, E.: CUDA by Example: An Introduction to General-Purpose GPU Programming. Addison-Wesley Professional, Boston (2010)"},{"key":"1_CR41","doi-asserted-by":"crossref","unstructured":"Sopaoglu, U., Abul, O.: A top-down k-anonymization implementation for apache spark. In 2017 IEEE International Conference On Big Data (Big Data), pp. 4513\u20134521. IEEE (2017)","DOI":"10.1109\/BigData.2017.8258492"},{"issue":"2","key":"1_CR42","first-page":"1314","volume":"11","author":"Y Sowmya","year":"2016","unstructured":"Sowmya, Y., Nagaratna, M.: Parallelizing k-anonymity algorithm for privacy preserving knowledge discovery from big data. Int. J. Appl. Eng. Res. 11(2), 1314\u20131321 (2016)","journal-title":"Int. J. Appl. Eng. Res."},{"key":"1_CR43","unstructured":"Sweeney, L.: Simple demographics often identify people uniquely. Technical Report Working Paper 3, Carnegie Mellon University, USA (2000). https:\/\/projects.iq.harvard.edu\/files\/privacytools\/files\/paper1.pdf"},{"key":"1_CR44","unstructured":"Sweeney, L.: Uniqueness of simple demographics in the us population. LIDAP-WP4 (2000)"},{"issue":"05","key":"1_CR45","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1142\/S021848850200165X","volume":"10","author":"L Sweeney","year":"2002","unstructured":"Sweeney, L.: Achieving k-anonymity privacy protection using generalization and suppression. Int. J. Uncertainty Fuzziness Knowl. Based Syst. 10(05), 571\u2013588 (2002)","journal-title":"Int. J. Uncertainty Fuzziness Knowl. Based Syst."},{"key":"1_CR46","unstructured":"Wong, R.C.-W., Fu, A.W.-C., Wang, K., Pei, J.: Minimality attack in privacy preserving data publishing. In: Proceedings of the 33rd International Conference on Very Large Data Bases, VLDB 2007, pp. 543\u2013554. VLDB Endowment. ISBN: 978-1-59-593649-3 (2007)"},{"key":"1_CR47","doi-asserted-by":"publisher","unstructured":"Wong, R.C.-W., Fu, A.W.-C., Wang, K., Pei, J.: Anonymization-based attacks in privacy-preserving data publishing. ACM Trans. Database Syst. 34(2). ISSN: 0362-5915 (2009). https:\/\/doi.org\/10.1145\/1538909.1538910","DOI":"10.1145\/1538909.1538910"},{"key":"1_CR48","doi-asserted-by":"publisher","unstructured":"Wong, R.C.-W., Fu, A.W.-C., Wang, K., Yu, P.S., Pei, J.: Can the utility of anonymized data be used for privacy breaches? ACM Trans. Knowl. Discov. Data 5(3). ISSN: 1556-4681 (2011). https:\/\/doi.org\/10.1145\/1993077.1993080","DOI":"10.1145\/1993077.1993080"},{"key":"1_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-642-04205-8_19","volume-title":"Database Systems for Advanced Applications","author":"M-R Zare-Mirakabad","year":"2009","unstructured":"Zare-Mirakabad, M.-R., Jantan, A., Bressan, S.: Privacy risk diagnosis: mining l-Diversity. In: Chen, L., Liu, C., Liu, Q., Deng, K. (eds.) DASFAA 2009. LNCS, vol. 5667, pp. 216\u2013230. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04205-8_19"},{"key":"1_CR50","unstructured":"Zhang, B., Dave, V., Mohammed, N., Al Hasan, M.: Feature selection for classification under anonymity constraint. arXiv preprint arXiv:1512.07158 (2015)"},{"key":"1_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-319-49145-5_31","volume-title":"Security, Privacy and Anonymity in Computation, Communication and Storage","author":"X Zhang","year":"2016","unstructured":"Zhang, X., Qi, L., He, Q., Dou, W.: Scalable iterative implementation of Mondrian for big data multidimensional anonymisation. In: Wang, G., Ray, I., Alcaraz Calero, J.M., Thampi, S.M. (eds.) SpaCCS 2016. LNCS, vol. 10067, pp. 311\u2013320. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49145-5_31"},{"key":"1_CR52","unstructured":"Zimmermann, T., et al.: Detecting fraudulent advertisements on a large e-commerce platform. In: EDBT\/ICDT Workshops (2017)"}],"container-title":["Lecture Notes in Computer Science","Transactions on Large-Scale Data- and Knowledge-Centered Systems L"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-64553-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T18:08:17Z","timestamp":1638468497000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-64553-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783662645529","9783662645536"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-64553-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}