RT Journal Article
JF IEEE Transactions on Knowledge & Data Engineering
YR 2011
VO 24
IS
SP 426
TI A Probabilistic Scheme for Keyword-Based Incremental Query Construction
A1 Wolfgang Nejdl,
A1 Elena Demidova,
A1 Xuan Zhou,
K1 Query formulation
K1 search process.
AB Databases enable users to precisely express their informational needs using structured queries. However, database query construction is a laborious and error-prone process, which cannot be performed well by most end users. Keyword search alleviates the usability problem at the price of query expressiveness. As keyword search algorithms do not differentiate between the possible informational needs represented by a keyword query, users may not receive adequate results. This paper presents IQ^P—a novel approach to bridge the gap between usability of keyword search and expressiveness of database queries. IQ^P enables a user to start with an arbitrary keyword query and incrementally refine it into a structured query through an interactive interface. The enabling techniques of IQ^P include: 1) a probabilistic framework for incremental query construction; 2) a probabilistic model to assess the possible informational needs represented by a keyword query; 3) an algorithm to obtain the optimal query construction process. This paper presents the detailed design of IQ^P, and demonstrates its effectiveness and scalability through experiments over real-world data and a user study.
PB IEEE Computer Society, [URL:http://www.computer.org]
SN 1041-4347
LA English
DO 10.1109/TKDE.2011.40
LK http://doi.ieeecomputersociety.org/10.1109/TKDE.2011.40