Keyword search in relational databases

Authors:
Jaehui Park;Sang-goo Lee
Affiliations:
Seoul National University, School of Computer Science and Engineering, 151-742, Seoul, Republic of Korea;Seoul National University, School of Computer Science and Engineering, 151-742, Seoul, Republic of Korea
Venue:
Knowledge and Information Systems
Year:
2011

Citing 0
Cited 4

Ranking objects by following paths in entity-relationship graphs

Proceedings of the 4th workshop on Workshop for Ph.D. students in information & knowledge management
KESOSD: keyword search over structured data

KEYS '12 Proceedings of the Third International Workshop on Keyword Search on Structured Data
Scalable top-k keyword search in relational databases

DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part II
Query matching for report recommendation

Proceedings of the 22nd ACM international conference on Conference on information & knowledge management

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper surveys research on enabling keyword search in relational databases. We present fundamental characteristics and discuss research dimensions, including data representation, ranking, efficient processing, query representation, and result presentation. Various approaches for developing the search system are described and compared within a common framework. We discuss the evolution of new research strategies to resolve the issues associated with probabilistic models, efficient top-k query processing, and schema analysis in relational databases.