{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T16:27:07Z","timestamp":1756571227718},"reference-count":34,"publisher":"Association for Computing Machinery (ACM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2009,8]]},"abstract":"<jats:p>When a database query has a large number of results, the user can only be shown one page of results at a time. One popular approach is to rank results such that the \"best\" results appear first. However, standard database query results comprise a set of tuples, with no associated ranking. It is typical to allow users the ability to sort results on selected attributes, but no actual ranking is defined.<\/jats:p>\n          <jats:p>\n            An alternative approach to the first page is not to try to show the best results, but instead to help users learn what is available in the whole result set and direct them to finding what they need. In this paper, we demonstrate through a user study that a page comprising one representative from each of\n            <jats:italic>k<\/jats:italic>\n            clusters (generated through a\n            <jats:italic>k<\/jats:italic>\n            -medoid clustering) is superior to multiple alternative candidate methods for generating representatives of a data set.\n          <\/jats:p>\n          <jats:p>Users often refine query specifications based on returned results. Traditional clustering may lead to completely new representatives after a refinement step. Furthermore, clustering can be computationally expensive. We propose a tree-based method for efficiently generating the representatives, and smoothly adapting them with query refinement. Experiments show that our algorithms outperform the state-of-the-art in both result quality and efficiency.<\/jats:p>","DOI":"10.14778\/1687627.1687643","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"133-144","source":"Crossref","is-referenced-by-count":28,"title":["Using trees to depict a forest"],"prefix":"10.14778","volume":"2","author":[{"given":"Bin","family":"Liu","sequence":"first","affiliation":[{"name":"University of Michigan, Ann Arbor"}]},{"given":"H. V.","family":"Jagadish","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor"}]}],"member":"320","published-online":{"date-parts":[[2009,8]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Database usability research at university of michigan. http:\/\/www.eecs.umich.edu\/db\/usable\/.  Database usability research at university of michigan. http:\/\/www.eecs.umich.edu\/db\/usable\/."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148175"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276314"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143857"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1166074.1166085"},{"key":"e_1_2_1_6_1","volume-title":"Inst. f\u00fcr Informatik","author":"Ester M.","year":"1995","unstructured":"M. Ester , H. Kriegel , and X. Xu . A Database Interface for Clustering in Large Spatial Databases . Inst. f\u00fcr Informatik , 1995 . M. Ester, H. Kriegel, and X. Xu. A Database Interface for Clustering in Large Spatial Databases. Inst. f\u00fcr Informatik, 1995."},{"key":"e_1_2_1_7_1","first-page":"226","volume-title":"KDD","author":"Ester M.","year":"1996","unstructured":"M. Ester , H.-P. Kriegel , J. Sander , and X. Xu . A density-based algorithm for discovering clusters in large spatial databases with noise . In KDD , pages 226 -- 231 , 1996 . M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In KDD, pages 226--231, 1996."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/647224.718926"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375567"},{"key":"e_1_2_1_10_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey M.","year":"1979","unstructured":"M. Garey and D. Johnson . Computers and Intractability: A Guide to the Theory of NP-completeness . WH Freeman San Francisco , 1979 . M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. WH Freeman San Francisco, 1979."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276312"},{"key":"e_1_2_1_12_1","first-page":"890","volume-title":"VLDB","author":"Hua M.","year":"2007","unstructured":"M. Hua , J. Pei , A. W.-C. Fu , X. Lin , and H. fung Leung . Efficiently answering top-k typicality queries on large databases . In VLDB , pages 890 -- 901 , 2007 . M. Hua, J. Pei, A. W.-C. Fu, X. Lin, and H. fung Leung. Efficiently answering top-k typicality queries on large databases. In VLDB, pages 890--901, 2007."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2004.10.007"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1357054.1357327"},{"key":"e_1_2_1_15_1","series-title":"Wiley Series in Probability and Mathematical Statistics","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316801","volume-title":"Finding groups in data. an introduction to cluster analysis","author":"Kaufman L.","year":"1990","unstructured":"L. Kaufman and P. Rousseeuw . Finding groups in data. an introduction to cluster analysis . Wiley Series in Probability and Mathematical Statistics . Applied Probability and Statistics, New York : Wiley , 1990 . L. Kaufman and P. Rousseeuw. Finding groups in data. an introduction to cluster analysis. Wiley Series in Probability and Mathematical Statistics. Applied Probability and Statistics, New York: Wiley, 1990."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247496"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.34"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559997"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.908985"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2006.70"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535331_4"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-007-0045-2"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2002.1033770"},{"issue":"5","key":"e_1_2_1_24_1","first-page":"924","article-title":"Exemplar and prototype models revisited: Response strategies, selective attention, and stimulus generalization. Learning","volume":"28","author":"Nosofsky R.","year":"2002","unstructured":"R. Nosofsky and S. Zaki . Exemplar and prototype models revisited: Response strategies, selective attention, and stimulus generalization. Learning , Memory , 28 ( 5 ): 924 -- 940 , 2002 . R. Nosofsky and S. Zaki. Exemplar and prototype models revisited: Response strategies, selective attention, and stimulus generalization. Learning, Memory, 28(5):924--940, 2002.","journal-title":"Memory"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335384"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.69"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007730.1007731"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1037\/0096-3445.121.3.278"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.1983.1654471"},{"issue":"6","key":"e_1_2_1_30_1","first-page":"1411","article-title":"Prototypes in the mist: The early epochs of category learning. Learning","volume":"24","author":"Smith J.","year":"1998","unstructured":"J. Smith and J. Minda . Prototypes in the mist: The early epochs of category learning. Learning , Memory , 24 ( 6 ): 1411 -- 1436 , 1998 . J. Smith and J. Minda. Prototypes in the mist: The early epochs of category learning. Learning, Memory, 24(6):1411--1436, 1998.","journal-title":"Memory"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497431"},{"key":"e_1_2_1_32_1","first-page":"1314","volume-title":"VLDB","author":"Wu T.","year":"2007","unstructured":"T. Wu , X. Li , D. Xin , J. Han , J. Lee , and R. Redder . Datascope: Viewing database contents in google maps' way . In VLDB , pages 1314 -- 1317 , 2007 . T. Wu, X. Li, D. Xin, J. Han, J. Lee, and R. Redder. Datascope: Viewing database contents in google maps' way. In VLDB, pages 1314--1317, 2007."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2005.845141"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/233269.233324"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/1687627.1687643","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:24:19Z","timestamp":1672226659000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/1687627.1687643"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["10.14778\/1687627.1687643"],"URL":"https:\/\/doi.org\/10.14778\/1687627.1687643","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2009,8]]}}}