{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T16:15:34Z","timestamp":1761581734237,"version":"3.41.0"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319988085"},{"type":"electronic","value":"9783319988092"}],"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-98809-2_6","type":"book-chapter","created":{"date-parts":[[2018,8,8]],"date-time":"2018-08-08T12:19:34Z","timestamp":1533730774000},"page":"85-100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Minimising Information Loss on Anonymised High Dimensional Data with Greedy In-Memory Processing"],"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":"Stephan","family":"von Schorlemer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Uflacker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,9]]},"reference":[{"key":"6_CR1","unstructured":"Aggarwal, C.C.: On k-anonymity and the curse of dimensionality. In: Proceedings of the 31st International Conference on Very Large Data Bases, VLDB 2005 (2005)"},{"key":"6_CR2","unstructured":"Barbaro, M., Zeller, T., Hansell, S.: A face is exposed for AOL searcher no. 4417749. New York Times 9(2008), 8 (2006). https:\/\/www.nytimes.com\/2006\/08\/09\/technology\/09aol.html"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Bayardo, R.J., Agrawal, R.: Data privacy through optimal k-anonymization. In: Proceedings of the 21st International Conference on Data Engineering, ICDE 2005, pp. 217\u2013228. IEEE (2005)","DOI":"10.1109\/ICDE.2005.42"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Bhaskar, R., Laxman, S., Smith, A., Thakurta, A.: Discovering frequent patterns in sensitive data. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 503\u2013512. ACM (2010)","DOI":"10.1145\/1835804.1835869"},{"key":"6_CR5","unstructured":"Bl\u00e4sius, T., Friedrich, T., Schirneck, M.: The parameterized complexity of dependency detection in relational databases. In: LIPIcs-Leibniz International Proceedings in Informatics. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)"},{"issue":"12","key":"6_CR6","doi-asserted-by":"publisher","first-page":"1422","DOI":"10.14778\/2536274.2536329","volume":"6","author":"L Bonomi","year":"2013","unstructured":"Bonomi, L., Xiong, L.: Mining frequent patterns with differential privacy. Proc. VLDB Endow. 6(12), 1422\u20131427 (2013)","journal-title":"Proc. VLDB Endow."},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"1376","DOI":"10.1038\/srep01376","volume":"3","author":"YA De Montjoye","year":"2013","unstructured":"De Montjoye, Y.A., Hidalgo, C.A., Verleysen, M., Blondel, V.D.: Unique in the crowd: the privacy bounds of human mobility. Sci. Rep. 3, 1376 (2013)","journal-title":"Sci. Rep."},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-22993-0_26","volume-title":"Mathematical Foundations of Computer Science 2011","author":"R Dondi","year":"2011","unstructured":"Dondi, R., Mauri, G., Zoppis, I.: On the complexity of the l-diversity problem. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol. 6907, pp. 266\u2013277. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22993-0_26"},{"key":"6_CR9","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":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/11681878_14","volume-title":"Theory of Cryptography","author":"C Dwork","year":"2006","unstructured":"Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 265\u2013284. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_14"},{"issue":"1","key":"6_CR11","first-page":"28","volume":"35","author":"F F\u00e4rber","year":"2012","unstructured":"F\u00e4rber, F., et al.: The SAP HANA database-an architecture overview. IEEE Data Eng. Bull. 35(1), 28\u201333 (2012)","journal-title":"IEEE Data Eng. Bull."},{"issue":"1","key":"6_CR12","first-page":"221","volume":"4","author":"SE Fienberg","year":"2012","unstructured":"Fienberg, S.E., Jin, J.: Privacy-preserving data sharing in high dimensional regression and classification settings. J. Priv. Confid. 4(1), 221\u2013243 (2012)","journal-title":"J. Priv. Confid."},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/j.procs.2015.08.120","volume":"60","author":"FB Fredj","year":"2015","unstructured":"Fredj, F.B., Lammari, N., Comyn-Wattiau, I.: Abstracting anonymization techniques: a prerequisite for selecting a generalization algorithm. Procedia Comput. Sci. 60, 206\u2013215 (2015)","journal-title":"Procedia Comput. Sci."},{"issue":"6","key":"6_CR14","doi-asserted-by":"publisher","first-page":"1673","DOI":"10.1137\/09076828X","volume":"41","author":"A Ghosh","year":"2012","unstructured":"Ghosh, A., Roughgarden, T., Sundararajan, M.: Universally utility-maximizing privacy mechanisms. SIAM J. Comput. 41(6), 1673\u20131693 (2012)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"6_CR15","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"OH Ibarra","year":"1978","unstructured":"Ibarra, O.H.: Reversal-bounded multicounter machines and their decision problems. J. ACM (JACM) 25(1), 116\u2013133 (1978)","journal-title":"J. ACM (JACM)"},{"issue":"8","key":"6_CR16","doi-asserted-by":"publisher","first-page":"1214","DOI":"10.1016\/j.knosys.2011.05.011","volume":"24","author":"MZ Islam","year":"2011","unstructured":"Islam, M.Z., Brankovic, L.: Privacy preserving data mining: a noise addition framework using a novel clustering technique. Knowl.-Based Syst. 24(8), 1214\u20131223 (2011)","journal-title":"Knowl.-Based Syst."},{"key":"6_CR17","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":"6_CR18","doi-asserted-by":"crossref","unstructured":"Kifer, D., Machanavajjhala, A.: No free lunch in data privacy. In: Proceedings of the 2011 ACM SIGMOD, SIGMOD 2011, pp. 193\u2013204. ACM (2011)","DOI":"10.1145\/1989323.1989345"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.jbi.2013.12.002","volume":"50","author":"F Kohlmayer","year":"2014","unstructured":"Kohlmayer, F., Prasser, F., Eckert, C., Kuhn, K.A.: A flexible approach to distributed data anonymization. J. Biomed. Inform. 50, 62\u201376 (2014)","journal-title":"J. Biomed. Inform."},{"key":"6_CR20","unstructured":"Koufogiannis, F., Han, S., Pappas, G.J.: Optimality of the Laplace mechanism in differential privacy (2015)"},{"issue":"2","key":"6_CR21","first-page":"28","volume":"36","author":"J Lee","year":"2013","unstructured":"Lee, J., et al.: High-performance transaction processing in SAP HANA. IEEE Data Eng. Bull. 36(2), 28\u201333 (2013)","journal-title":"IEEE Data Eng. Bull."},{"issue":"6","key":"6_CR22","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/s00778-015-0398-x","volume":"24","author":"C Li","year":"2015","unstructured":"Li, C., Miklau, G., Hay, M., McGregor, A., Rastogi, V.: The matrix mechanism: optimizing linear counting queries under differential privacy. VLDB J. 24(6), 757\u2013781 (2015)","journal-title":"VLDB J."},{"key":"6_CR23","doi-asserted-by":"crossref","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","DOI":"10.1109\/ICDE.2007.367856"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-642-37487-6_26","volume-title":"Database Systems for Advanced Applications","author":"H Liang","year":"2013","unstructured":"Liang, H., Yuan, H.: On the complexity of t-closeness anonymization and related problems. In: Meng, W., Feng, L., Bressan, S., Winiwarter, W., Song, W. (eds.) DASFAA 2013. LNCS, vol. 7825, pp. 331\u2013345. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37487-6_26"},{"key":"6_CR25","unstructured":"Liu, F.: Generalized Gaussian mechanism for differential privacy (2016)"},{"issue":"1","key":"6_CR26","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":"6_CR27","doi-asserted-by":"crossref","unstructured":"McSherry, F., Talwar, K.: Mechanism design via differential privacy. In: 48th IEEE Symposium Foundations of Computer Science, FOCS 2007 (2007)","DOI":"10.1109\/FOCS.2007.66"},{"key":"6_CR28","doi-asserted-by":"crossref","unstructured":"Meyer, A.R., Stockmeyer, L.J.: The equivalence problem for regular expressions with squaring requires exponential space. In: SWAT (FOCS), pp. 125\u2013129 (1972)","DOI":"10.1109\/SWAT.1972.29"},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"Meyerson, A., Williams, R.: On the complexity of optimal k-anonymity. In: Proceedings of the Twenty-Third ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 223\u2013228. ACM (2004)","DOI":"10.1145\/1055558.1055591"},{"issue":"4","key":"6_CR30","first-page":"18","volume":"4","author":"N Mohammed","year":"2010","unstructured":"Mohammed, N., Fung, B., Hung, P.C., Lee, C.K.: Centralized and distributed anonymization for high-dimensional healthcare data. ACM TKDD 4(4), 18 (2010)","journal-title":"ACM TKDD"},{"key":"6_CR31","unstructured":"Papenbrock, T., Naumann, F.: A hybrid approach for efficient unique column combination discovery. Proc. der Fachtagung Business, Technologie und Web (2017)"},{"key":"6_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55270-0","volume-title":"A Course in In-Memory Data Management","author":"H Plattner","year":"2013","unstructured":"Plattner, H., et al.: A Course in In-Memory Data Management. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-55270-0"},{"key":"6_CR33","unstructured":"Polonetsky, J., Tene, O., Finch, K.: Shades of gray: seeing the full spectrum of practical data de-identification (2016)"},{"key":"6_CR34","unstructured":"Rubinstein, I., Hartzog, W.: Anonymization and risk (2015)"},{"issue":"28","key":"6_CR35","doi-asserted-by":"publisher","first-page":"11694","DOI":"10.1073\/pnas.0704820104","volume":"104","author":"A Rzhetsky","year":"2007","unstructured":"Rzhetsky, A., Wajngurt, D., Park, N., Zheng, T.: Probing genetic overlap among complex human phenotypes. Proc. Nat. Acad. Sci. 104(28), 11694\u201311699 (2007)","journal-title":"Proc. Nat. Acad. Sci."},{"issue":"2","key":"6_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pcbi.1000662","volume":"6","author":"S Suthram","year":"2010","unstructured":"Suthram, S., Dudley, J.T., Chiang, A.P., Chen, R., Hastie, T.J., Butte, A.J.: Network-based elucidation of human disease similarities reveals common functional modules enriched for pluripotent drug targets. PLoS Comput. Biol. 6(2), 1\u201310 (2010)","journal-title":"PLoS Comput. Biol."},{"issue":"05","key":"6_CR37","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. Uncertain. Fuzziness Knowl.-Based Syst. 10(05), 571\u2013588 (2002)","journal-title":"Int. J. Uncertain. Fuzziness Knowl.-Based Syst."},{"issue":"05","key":"6_CR38","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L Sweeney","year":"2002","unstructured":"Sweeney, L.: K-anonymity: a model for protecting privacy. Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 10(05), 557\u2013570 (2002)","journal-title":"Int. J. Uncertain. Fuzziness Knowl.-Based Syst."},{"issue":"1","key":"6_CR39","doi-asserted-by":"publisher","first-page":"115","DOI":"10.14778\/1453856.1453874","volume":"1","author":"M Terrovitis","year":"2008","unstructured":"Terrovitis, M., Mamoulis, N., Kalnis, P.: Privacy-preserving anonymization of set-valued data. Proc. VLDB Endow. 1(1), 115\u2013125 (2008)","journal-title":"Proc. VLDB Endow."},{"key":"6_CR40","doi-asserted-by":"crossref","unstructured":"Vaidya, J., Clifton, C.: Privacy-preserving k-means clustering over vertically partitioned data. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 206\u2013215. ACM (2003)","DOI":"10.1145\/956755.956776"},{"issue":"4","key":"6_CR41","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1007\/s00778-006-0041-y","volume":"17","author":"J Vaidya","year":"2008","unstructured":"Vaidya, J., Kantarc\u0131o\u011flu, M., Clifton, C.: Privacy-preserving Naive Bayes classification. VLDB J.\u2014Int. J. Very Large Data Bases 17(4), 879\u2013898 (2008)","journal-title":"VLDB J.\u2014Int. J. Very Large Data Bases"},{"key":"6_CR42","unstructured":"Vessenes, P., Seidensticker, R.: System and method for analyzing transactions in a distributed ledger. US Patent 9,298,806, 29 March 2016"},{"issue":"1","key":"6_CR43","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s00779-012-0633-z","volume":"18","author":"M Wernke","year":"2014","unstructured":"Wernke, M., Skvortsov, P., D\u00fcrr, F., Rothermel, K.: A classification of location privacy attacks and approaches. Pers. Ubiquit. Comput. 18(1), 163\u2013175 (2014)","journal-title":"Pers. Ubiquit. Comput."},{"key":"6_CR44","doi-asserted-by":"crossref","unstructured":"Wimmer, H., Powell, L.: A comparison of the effects of k-anonymity on machine learning algorithms. In: Proceedings of the Conference for Information Systems Applied Research ISSN, vol. 2167, p. 1508 (2014)","DOI":"10.14569\/IJACSA.2014.051126"},{"key":"6_CR45","unstructured":"Zhang, B., Dave, V., Mohammed, N., Hasan, M.A.: Feature selection for classification under anonymity constraint. arXiv preprint arXiv:1512.07158 (2015)"},{"issue":"2","key":"6_CR46","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1109\/TPDS.2013.48","volume":"25","author":"X Zhang","year":"2014","unstructured":"Zhang, X., Yang, L.T., Liu, C., Chen, J.: A scalable two-phase top-down specialization approach for data anonymization using mapreduce on cloud. IEEE Trans. Parallel Distrib. Syst. 25(2), 363\u2013373 (2014)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"6_CR47","doi-asserted-by":"publisher","first-page":"4212","DOI":"10.1038\/ncomms5212","volume":"5","author":"X Zhou","year":"2014","unstructured":"Zhou, X., Menche, J., Barab\u00e1si, A.L., Sharma, A.: Human symptoms-disease network. Nat. Commun. 5, 4212 (2014)","journal-title":"Nat. Commun."}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-98809-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T07:41:09Z","timestamp":1751787669000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-98809-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319988085","9783319988092"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98809-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"9 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Regensburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.dexa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}