%0 Journal Article %1 10.1109/TKDE.2011.40 %A Demidova, Elena %A Zhou, Xuan %A Nejdl, Wolfgang %C Los Alamitos, CA, USA %D 2012 okkam livingknowledge %I IEEE Computer Society %J IEEE Transactions on Knowledge and Data Engineering %K myown %N 3 %P 426-439 %R http://doi.ieeecomputersociety.org/10.1109/TKDE.2011.40 %T A Probabilistic Scheme for Keyword-Based Incremental Query Construction %V 24 %X 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 IQP - a novel approach to bridge the gap between usability of keyword search and expressiveness of database queries. IQP 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 IQP 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 IQP, and demonstrates its effectiveness and scalability through experiments over real-world data and a user study.

@article{10.1109/TKDE.2011.40, abstract = {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 IQP - a novel approach to bridge the gap between usability of keyword search and expressiveness of database queries. IQP 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 IQP 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 IQP, and demonstrates its effectiveness and scalability through experiments over real-world data and a user study.}, added-at = {2013-03-01T22:04:45.000+0100}, address = {Los Alamitos, CA, USA}, author = {Demidova, Elena and Zhou, Xuan and Nejdl, Wolfgang}, biburl = {https://www.bibsonomy.org/bibtex/206bc486943e2c1d16341a712a391f338/demidova}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2011.40}, interhash = {ee15c4fdb1e4e7b7c7f529b8cdbc46c8}, intrahash = {06bc486943e2c1d16341a712a391f338}, issn = {1041-4347}, journal = {IEEE Transactions on Knowledge and Data Engineering}, keywords = {myown}, number = 3, pages = {426-439}, publisher = {IEEE Computer Society}, timestamp = {2016-04-24T23:04:59.000+0200}, title = {A Probabilistic Scheme for Keyword-Based Incremental Query Construction}, volume = 24, year = {2012 okkam livingknowledge} }