{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T16:02:12Z","timestamp":1761580932122,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":8,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,10,24]],"date-time":"2011-10-24T00:00:00Z","timestamp":1319414400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,10,24]]},"DOI":"10.1145\/2063576.2063801","type":"proceedings-article","created":{"date-parts":[[2011,11,16]],"date-time":"2011-11-16T10:40:21Z","timestamp":1321440021000},"page":"1565-1570","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["Advancing the discovery of unique column combinations"],"prefix":"10.1145","author":[{"given":"Ziawasch","family":"Abedjan","sequence":"first","affiliation":[{"name":"Hasso-Plattner-Institut, Potsdam, Germany"}]},{"given":"Felix","family":"Naumann","sequence":"additional","affiliation":[{"name":"Hasso-Plattner-Institut, Potsdam, Germany"}]}],"member":"320","published-online":{"date-parts":[[2011,10,24]]},"reference":[{"key":"e_1_3_2_1_2_1","first-page":"487","volume-title":"Proceedings of the International Conference on Very Large Databases (VLDB)","author":"Agrawal R.","year":"1994","unstructured":"R. Agrawal and R. Srikant . Fast algorithms for mining association rules in large databases . In Proceedings of the International Conference on Very Large Databases (VLDB) , pages 487 -- 499 , San Francisco, CA , 1994 . R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In Proceedings of the International Conference on Very Large Databases (VLDB), pages 487--499, San Francisco, CA, 1994."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1216155.1216159"},{"key":"e_1_3_2_1_4_1","unstructured":"C. Giannella and C. Wyss. Finding minimal keys in a relation instance. http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.41.7086 1999. Last accessed on 2010-09--29.  C. Giannella and C. Wyss. Finding minimal keys in a relation instance. http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.41.7086 1999. Last accessed on 2010-09--29."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/42.2.100"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1002\/int.4550070703"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1041624.1041658"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/39.2.124"},{"key":"e_1_3_2_1_9_1","first-page":"691","volume-title":"Proceedings of the International Conference on Very Large Databases (VLDB)","author":"Sismanis Y.","year":"2006","unstructured":"Y. Sismanis , P. Brown , P. J. Haas , and B. Reinwald . Gordian: efficient and scalable discovery of composite keys . In Proceedings of the International Conference on Very Large Databases (VLDB) , pages 691 -- 702 , 2006 . Y. Sismanis, P. Brown, P. J. Haas, and B. Reinwald. Gordian: efficient and scalable discovery of composite keys. In Proceedings of the International Conference on Very Large Databases (VLDB), pages 691--702, 2006."}],"event":{"name":"CIKM '11: International Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Glasgow Scotland, UK","acronym":"CIKM '11"},"container-title":["Proceedings of the 20th ACM international conference on Information and knowledge management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2063576.2063801","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2063576.2063801","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:54:36Z","timestamp":1750240476000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2063576.2063801"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,24]]},"references-count":8,"alternative-id":["10.1145\/2063576.2063801","10.1145\/2063576"],"URL":"https:\/\/doi.org\/10.1145\/2063576.2063801","relation":{},"subject":[],"published":{"date-parts":[[2011,10,24]]},"assertion":[{"value":"2011-10-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}