Size-l Object Summaries for Relational Keyword Search

Details Size-l Object Summaries for Relational Keyword Search Size-l Object Summaries for Relational Keyword Search

2011-11-30

arxiv.org/abs/1111.7169v1

Proceedings of the VLDB Endowment (PVLDB), Vol. 5, No. 3, pp. 229-240 (2011)

Computer Science

Databases

VLDB2012

Scientific paper

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-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 tuples. We propose three algorithms for the efficient generation of size-l 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.

Affiliated with

Also associated with

No associations

Rating

Size-l Object Summaries for Relational Keyword Search does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Size-l Object Summaries for Relational Keyword Search, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Size-l Object Summaries for Relational Keyword Search will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-8597