Please use this identifier to cite or link to this item:
Title: Solving empty result problem in keyword search over relational databases
Keywords: keyword search over relational databases, keyword search, relational databases, empty result problem
Issue Date: 30-Dec-2011
Source: HU JUNFENG (2011-12-30). Solving empty result problem in keyword search over relational databases. ScholarBank@NUS Repository.
Abstract: Keyword search over relational databases provides a simple and intuitive query interface for normal users to retrieve information from databases. Most of the existing keyword search systems for relational databases use foreign key refer- ences to connect tuples. In this case, an answer to a keyword query is typically a joining network of tuples that are connected via a series of foreign key refer- ences, and contain all the keywords in the query. However, if no such joining network of tuples exists, which means foreign key relationship fails to connect tuples to cover all the keywords, no result would be returned to users. This problem is called the empty result problem, which usually would disappoint the user. Instead of returning nothing, in this thesis, we propose a solution to automatically find approximate answers that contain all the keywords in the query.
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
HuJ.pdf387.53 kBAdobe PDF



Page view(s)

checked on Dec 11, 2017


checked on Dec 11, 2017

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.