{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T06:14:59Z","timestamp":1769926499863,"version":"3.49.0"},"reference-count":23,"publisher":"Association for Computing Machinery (ACM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2011,11]]},"abstract":"<jats:p>A previously proposed keyword search paradigm produces, as a query result, a ranked list of Object Summaries (OSs). An OS is a tree structure of related tuples that summarizes all data held in a relational database about a particular Data Subject (DS). However, some of these OSs are very large in size and therefore unfriendly to users that initially prefer synoptic information before proceeding to more comprehensive information about a particular DS. In this paper, we investigate the effective and efficient retrieval of concise and informative OSs. We argue that a good size-<jats:italic>l<\/jats:italic>OS should be a stand-alone and meaningful synopsis of the most important information about the particular DS. More precisely, we define a size-<jats:italic>l<\/jats:italic>OS as a partial OS composed of<jats:italic>l<\/jats:italic>important tuples. We propose three algorithms for the efficient generation of size-<jats:italic>l<\/jats:italic>OSs (in addition to the optimal approach which requires exponential time). Experimental evaluation on DBLP and TPC-H databases verifies the effectiveness and efficiency of our approach.<\/jats:p>","DOI":"10.14778\/2078331.2078338","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"229-240","source":"Crossref","is-referenced-by-count":15,"title":["Size-<i>l<\/i>object summaries for relational keyword search"],"prefix":"10.14778","volume":"5","author":[{"given":"Georgios J.","family":"Fakas","sequence":"first","affiliation":[{"name":"Manchester Metropolitan University, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhi","family":"Cai","sequence":"additional","affiliation":[{"name":"Manchester Metropolitan University, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikos","family":"Mamoulis","sequence":"additional","affiliation":[{"name":"The University of Hong Kong, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,11]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Data protection act 1988. http:\/\/en.wikipedia.org\/wiki\/Data_Protection_Act_1998. Data protection act 1988. http:\/\/en.wikipedia.org\/wiki\/Data_Protection_Act_1998."},{"key":"e_1_2_1_2_1","first-page":"1083","volume-title":"VLDB","author":"Aditya B.","year":"2002","unstructured":"B. Aditya , G. Bhalotia , S. Chakrabarti , A. Hulgeri , C. Nakhe , and P. S. Sudarshan . BANKS: Browsing and keyword searching in relational databases . In VLDB , pages 1083 -- 1086 , 2002 . B. Aditya, G. Bhalotia, S. Chakrabarti, A. Hulgeri, C. Nakhe, and P. S. Sudarshan. BANKS: Browsing and keyword searching in relational databases. In VLDB, pages 1083--1086, 2002."},{"key":"e_1_2_1_3_1","first-page":"564","volume-title":"VLDB","author":"Balmin A.","year":"2004","unstructured":"A. Balmin , V. Hristidis , and Y. Papakonstantinou . Objectrank: Authority-based keyword search in databases . In VLDB , pages 564 -- 575 , 2004 . A. Balmin, V. Hristidis, and Y. Papakonstantinou. Objectrank: Authority-based keyword search in databases. In VLDB, pages 564--575, 2004."},{"key":"e_1_2_1_4_1","first-page":"431","volume-title":"ICDE","author":"Bhalotia G.","year":"2002","unstructured":"G. Bhalotia , A. Hulgeri , C. Nakhe , S. Chakrabarti , and S. Sudarshan . Keyword searching and browsing in databases using BANKS . In ICDE , pages 431 -- 440 , 2002 . G. Bhalotia, A. Hulgeri, C. Nakhe, S. Chakrabarti, and S. Sudarshan. Keyword searching and browsing in databases using BANKS. In ICDE, pages 431--440, 2002."},{"key":"e_1_2_1_5_1","first-page":"107","volume-title":"WWW Conference","author":"Brin S.","year":"1998","unstructured":"S. Brin and L. Page . The anatomy of a large-scale hypertextual web search engine . In WWW Conference , pages 107 -- 117 , 1998 . S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. In WWW Conference, pages 107--117, 1998."},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1145\/375551.375567","volume-title":"PODS","author":"Fagin R.","year":"2001","unstructured":"R. Fagin , A. Lotem , and M. Naor . Optimal aggregation algorithms for middleware . In PODS , pages 102 -- 113 , 2001 . 10.1145\/375551.375567 R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. In PODS, pages 102--113, 2001. 10.1145\/375551.375567"},{"key":"e_1_2_1_7_1","first-page":"564","volume-title":"ICDE","author":"Fakas G. J.","year":"2008","unstructured":"G. J. Fakas . Automated generation of object summaries from relational databases: A novel keyword searching paradigm. In DBRank'08 , ICDE , pages 564 -- 567 , 2008 . 10.1109\/ICDEW.2008.4498381 G. J. Fakas. Automated generation of object summaries from relational databases: A novel keyword searching paradigm. In DBRank'08, ICDE, pages 564--567, 2008. 10.1109\/ICDEW.2008.4498381"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2010.11.003"},{"key":"e_1_2_1_9_1","first-page":"1580","volume-title":"ICDE","author":"Fakas G. J.","year":"2009","unstructured":"G. J. Fakas and Z. Cai . Ranking of object summaries. In DBRank'09 , ICDE , pages 1580 -- 1583 , 2009 . 10.1109\/ICDE.2009.171 G. J. Fakas and Z. Cai. Ranking of object summaries. In DBRank'09, ICDE, pages 1580--1583, 2009. 10.1109\/ICDE.2009.171"},{"issue":"2","key":"e_1_2_1_10_1","first-page":"193","article-title":"Automated generation of personal data reports from relational databases","volume":"10","author":"Fakas G. J.","year":"2011","unstructured":"G. J. Fakas , B. Cawley , and Z. Cai . Automated generation of personal data reports from relational databases . JIKM , 10 ( 2 ): 193 -- 208 , 2011 . G. J. Fakas, B. Cawley, and Z. Cai. Automated generation of personal data reports from relational databases. JIKM, 10(2):193--208, 2011.","journal-title":"JIKM"},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/872757.872762","volume-title":"SIGMOD","author":"Guo L.","year":"2003","unstructured":"L. Guo , F. Shao , C. Botev , and J. Shanmugasundaram . XRANK: Ranked keyword search over XML documents . In SIGMOD , pages 16 -- 27 , 2003 . 10.1145\/872757.872762 L. Guo, F. Shao, C. Botev, and J. Shanmugasundaram. XRANK: Ranked keyword search over XML documents. In SIGMOD, pages 16--27, 2003. 10.1145\/872757.872762"},{"key":"e_1_2_1_12_1","first-page":"850","volume-title":"VLDB","author":"Hristidis V.","year":"2003","unstructured":"V. Hristidis , L. Gravano , and Y. Papakonstantinou . Efficient ir-style keyword search over relational databases . In VLDB , pages 850 -- 861 , 2003 . V. Hristidis, L. Gravano, and Y. Papakonstantinou. Efficient ir-style keyword search over relational databases. In VLDB, pages 850--861, 2003."},{"key":"e_1_2_1_13_1","first-page":"670","volume-title":"VLDB","author":"Hristidis V.","year":"2002","unstructured":"V. Hristidis and Y. Papakonstantinou . Discover: Keyword search in relational databases . In VLDB , pages 670 -- 681 , 2002 . V. Hristidis and Y. Papakonstantinou. Discover: Keyword search in relational databases. In VLDB, pages 670--681, 2002."},{"key":"e_1_2_1_14_1","first-page":"315","volume-title":"SIGMOD","author":"Huang Y.","year":"2008","unstructured":"Y. Huang , Z. Liu , and Y. Chen . Query biased snippet generation in XML search . In SIGMOD , pages 315 -- 326 , 2008 . 10.1145\/1376616.1376651 Y. Huang, Z. Liu, and Y. Chen. Query biased snippet generation in XML search. In SIGMOD, pages 315--326, 2008. 10.1145\/1376616.1376651"},{"key":"e_1_2_1_15_1","first-page":"69","volume-title":"ICDE","author":"Koutrika G.","year":"2006","unstructured":"G. Koutrika , A. Simitsis , and Y. Ioannidis . Pr\u00e9cis: The essence of a query answer . In ICDE , pages 69 -- 79 , 2006 . 10.1109\/ICDE.2006.114 G. Koutrika, A. Simitsis, and Y. Ioannidis. Pr\u00e9cis: The essence of a query answer. In ICDE, pages 69--79, 2006. 10.1109\/ICDE.2006.114"},{"key":"e_1_2_1_16_1","first-page":"563","volume-title":"SIGMOD","author":"Liu F.","year":"2006","unstructured":"F. Liu , C. Yu , W. Meng , and A. Chowdhury . Effective keyword search in relational databases . In SIGMOD , pages 563 -- 574 , 2006 . 10.1145\/1142473.1142536 F. Liu, C. Yu, W. Meng, and A. Chowdhury. Effective keyword search in relational databases. In SIGMOD, pages 563--574, 2006. 10.1145\/1142473.1142536"},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1145\/1247480.1247495","volume-title":"SIGMOD","author":"Luo Y.","year":"2007","unstructured":"Y. Luo , X. Lin , W. Wang , and X. Zhou . SPARK: Top-k keyword query in relational databases . In SIGMOD , pages 115 -- 126 , 2007 . 10.1145\/1247480.1247495 Y. Luo, X. Lin, W. Wang, and X. Zhou. SPARK: Top-k keyword query in relational databases. In SIGMOD, pages 115--126, 2007. 10.1145\/1247480.1247495"},{"key":"e_1_2_1_18_1","first-page":"1163","volume-title":"ICDE","author":"Markowetz A.","year":"2009","unstructured":"A. Markowetz , Y. Yang , and D. Papadias . Reachability indexes for relational keyword search . In ICDE , pages 1163 -- 1166 , 2009 . 10.1109\/ICDE.2009.191 A. Markowetz, Y. Yang, and D. Papadias. Reachability indexes for relational keyword search. In ICDE, pages 1163--1166, 2009. 10.1109\/ICDE.2009.191"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-007-0075-9"},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/290941.290947","volume-title":"SIGIR","author":"Tombros A.","year":"1998","unstructured":"A. Tombros and M. Sanderson . Advantages of query biased summaries in information retrieval . In SIGIR , pages 2 -- 10 , 1998 . 10.1145\/290941.290947 A. Tombros and M. Sanderson. Advantages of query biased summaries in information retrieval. In SIGIR, pages 2--10, 1998. 10.1145\/290941.290947"},{"key":"e_1_2_1_21_1","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1145\/1277741.1277766","volume-title":"SIGIR","author":"Turpin A.","year":"2007","unstructured":"A. Turpin , Y. Tsegay , D. Hawking , and H. E. Williams . Fast generation of result snippets in web search . In SIGIR , pages 127 -- 134 , 2007 . 10.1145\/1277741.1277766 A. Turpin, Y. Tsegay, D. Hawking, and H. E. Williams. Fast generation of result snippets in web search. In SIGIR, pages 127--134, 2007. 10.1145\/1277741.1277766"},{"key":"e_1_2_1_22_1","first-page":"883","volume-title":"ICDE","author":"Varadarajan R.","year":"2008","unstructured":"R. Varadarajan , V. Hristidis , and L. Raschid . Explaining and reformulating authority flow queries . In ICDE , pages 883 -- 892 , 2008 . 10.1109\/ICDE.2008.4497497 R. Varadarajan, V. Hristidis, and L. Raschid. Explaining and reformulating authority flow queries. In ICDE, pages 883--892, 2008. 10.1109\/ICDE.2008.4497497"},{"key":"e_1_2_1_23_1","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1145\/1247480.1247498","volume-title":"SIGMOD","author":"Yu B.","year":"2007","unstructured":"B. Yu , G. Li , K. Sollins , and A. K. H. Tung . Effective keyword-based selection of relational databases . In SIGMOD , pages 139 -- 150 , 2007 . 10.1145\/1247480.1247498 B. Yu, G. Li, K. Sollins, and A. K. H. Tung. Effective keyword-based selection of relational databases. In SIGMOD, pages 139--150, 2007. 10.1145\/1247480.1247498"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2078331.2078338","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T14:42:20Z","timestamp":1689345740000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2078331.2078338"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["10.14778\/2078331.2078338"],"URL":"https:\/\/doi.org\/10.14778\/2078331.2078338","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2011,11]]}}}