Finding Top-k Answers in Keyword Search over Relational Databases Using Tuple Units

Existing studies on keyword search over relational databases usually find Steiner trees composed of connected database tuples as answers. They on-the-fly identify Steiner trees by discovering rich structural relationships between database tuples, and neglect the fact that such structural relationships can be precomputed and indexed. Recently, tuple units are proposed to improve search efficiency by indexing structural relationships, and existing methods identify a single tuple unit to answer keyword queries. However, in many cases, multiple tuple units should be integrated to answer a keyword query. Thus, these methods will involve false negatives. To address this problem, in this paper, the authors study how to integrate multiple related tuple units to effectively answer keyword queries.

Provided by: Institute of Electrical & Electronic Engineers Topic: Data Management Date Added: Sep 2012 Format: PDF

Find By Topic