Graph-driven Exploration of Relational Databases for Efficient Keyword Search

Provided by: Creative Commons
Topic: Data Management
Format: PDF
Keyword-based search is becoming the standard way to access any kind of information and it is considered today an important add-on of relational database management systems. The approaches to keyword search over relational data usually rely on a two-step strategy in which, first, tree-shaped answers are built by connecting tuples matching the given keywords and, then, potential answers are ranked according to some relevance criteria. In this paper, the authors illustrate a novel technique to this problem that aims, rather, at generating directly the best answers.

Find By Topic