The Department of Computer Science at the University of Cyprus cordially invites you to the Colloquium entitled:
Size-l Object Summaries for Relational Keyword Search
Speaker: Dr. George Fakas
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. We investigate the effective and efficient retrieval of concise and informative OSs. We argue that a good size-l OS should be a stand-alone and meaningful synopsis of the most important information about the particular DS. More precisely, we define a size-l OS as a partial OS composed of l important nodes. More precisely, we propose size-l OS(t)s and size-l OS(a)s that consist of l tuples and attributes respectively. For this purpose, we propose an optimal dynamic programming algorithm (which requires exponential time), two greedy algorithms and two pre-processing algorithms. Experimental evaluation on DBLP, DBLP(M) and TPC-H databases verifies the effectiveness and efficiency of our approach.
Georgios Fakas is a Senior Lecturer at the School of Computing, Mathematics and Digital Technology (CMDT), Manchester Metropolitan University. Before that, he worked as a Research Associate at EPFL (Lausanne), Switzerland and at the University of Cyprus, Cyprus. He obtained his Ph.D., M.Phil and B.Sc. in Computation from the Department of Computation, UMIST, Manchester, UK. He was awarded the “ERCIM” Fellowship and the “Hosting of Experienced Researchers from Abroad” Fellowship from the Research Promotion Foundation of Cyprus.
Recorded Video available through
|Sponsor: The CS Colloquium Series is supported by a generous donation from