{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T18:54:36Z","timestamp":1775328876130,"version":"3.50.1"},"reference-count":43,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1109\/icde.2015.7113287","type":"proceedings-article","created":{"date-parts":[[2015,6,3]],"date-time":"2015-06-03T19:23:28Z","timestamp":1433359408000},"page":"231-242","source":"Crossref","is-referenced-by-count":28,"title":["Result selection and summarization for Web Table search"],"prefix":"10.1109","author":[{"given":"Thanh Tam","family":"Nguyen","sequence":"first","affiliation":[]},{"given":"Quoc Viet","family":"Hung Nguyen","sequence":"additional","affiliation":[]},{"given":"Matthias","family":"Weidlich","sequence":"additional","affiliation":[]},{"given":"Karl","family":"Aberer","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767846"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.14778\/2002938.2002939"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s00357-005-0012-9"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242667"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/0031-3203(80)90042-4"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1670564.1670572"},{"key":"ref37","year":"0"},{"key":"ref36","year":"0"},{"key":"ref35","year":"0"},{"key":"ref34","author":"tan","year":"2007","journal-title":"Introduction to Data Mining"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.14778\/2180912.2180920"},{"key":"ref11","first-page":"817","article-title":"Finding Related Tables","author":"sarma","year":"0","journal-title":"SIGMOD 2012"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687699"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/20.4.364"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.14778\/2428536.2428538"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1860702.1860709"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816716"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010050"},{"key":"ref17","author":"garey","year":"1990","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness W H Freeman & Co"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807286"},{"key":"ref19","first-page":"1142","article-title":"Gender: A generic diversified ranking algorithm","author":"he","year":"2012","journal-title":"NIPS"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687750"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/568518.568519"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/26.4.354"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1739041.1739072"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453916"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.14778\/2336664.2336665"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148245"},{"key":"ref7","article-title":"Summarization-compressing data into an informative representation","author":"chandola","year":"2005","journal-title":"ICDM"},{"key":"ref2","first-page":"695","article-title":"Generic Schema Matching, Ten Years Later","author":"bernstein","year":"2011","journal-title":"PVLDB"},{"key":"ref9","article-title":"Google squared: Web scale, open domain information extraction and presentation","author":"crow","year":"0","journal-title":"ECIR 2010"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066283"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/331499.331504"},{"key":"ref22","volume":"3","author":"knuth","year":"1973","journal-title":"The Art of Computer Programming Sorting and Searching"},{"key":"ref21","author":"kaufman","year":"1987","journal-title":"Clustering by Means of Medoids"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.14778\/2535568.2448943"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076120"},{"key":"ref23","first-page":"715","article-title":"Diversified recommendation on graphs: pitfalls, measures, and algorithms","author":"k\u00fc\u00e7\u00fcktun\u00e7","year":"2013","journal-title":"WWW"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/860435.860440"},{"key":"ref26","first-page":"1","article-title":"On the Stable Marriage of Maximum Weight Royal Couples","author":"marie","year":"2007","journal-title":"IIWeb"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465276"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809071"}],"event":{"name":"2015 IEEE 31st International Conference on Data Engineering (ICDE)","location":"Seoul","start":{"date-parts":[[2015,4,13]]},"end":{"date-parts":[[2015,4,17]]}},"container-title":["2015 IEEE 31st International Conference on Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7109453\/7113253\/07113287.pdf?arnumber=7113287","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,17]],"date-time":"2020-09-17T20:28:18Z","timestamp":1600374498000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7113287\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4]]},"references-count":43,"URL":"https:\/\/doi.org\/10.1109\/icde.2015.7113287","relation":{},"subject":[],"published":{"date-parts":[[2015,4]]}}}