TY - GEN
T1 - Minimum-effort driven dynamic faceted search in structured databases
AU - Roy, Senjuti Basu
AU - Wang, Haidong
AU - Das, Gautam
AU - Nambiar, Ullas
AU - Mohania, Mukesh
PY - 2008
Y1 - 2008
N2 - In this paper, we propose minimum-effort driven navigational techniques for enterprise database systems based on the faceted search paradigm. Our proposed techniques dynamically suggest facets for drilling down into the database such that the cost of navigation is minimized. At every step, the system asks the user a question or a set of questions on different facets and depending on the user response, dynamically fetches the next most promising set of facets, and the process repeats. Facets are selected based on their ability to rapidly drill down to the most promising tuples, as well as on the ability of the user to provide desired values for them. Our facet selection algorithms also work in conjunction with any ranked retrieval model where a ranking function imposes a bias over the user preferences for the selected tuples. Our methods are principled as well as efficient, and our experimental study validates their effectiveness on several application scenarios.
AB - In this paper, we propose minimum-effort driven navigational techniques for enterprise database systems based on the faceted search paradigm. Our proposed techniques dynamically suggest facets for drilling down into the database such that the cost of navigation is minimized. At every step, the system asks the user a question or a set of questions on different facets and depending on the user response, dynamically fetches the next most promising set of facets, and the process repeats. Facets are selected based on their ability to rapidly drill down to the most promising tuples, as well as on the ability of the user to provide desired values for them. Our facet selection algorithms also work in conjunction with any ranked retrieval model where a ranking function imposes a bias over the user preferences for the selected tuples. Our methods are principled as well as efficient, and our experimental study validates their effectiveness on several application scenarios.
KW - Data browsing
KW - Dynamic facet generation
KW - Minimum-effort entity search
UR - http://www.scopus.com/inward/record.url?scp=70349250370&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70349250370&partnerID=8YFLogxK
U2 - 10.1145/1458082.1458088
DO - 10.1145/1458082.1458088
M3 - Conference contribution
AN - SCOPUS:70349250370
SN - 9781595939913
T3 - International Conference on Information and Knowledge Management, Proceedings
SP - 13
EP - 22
BT - Proceedings of the 17th ACM Conference on Information and Knowledge Management, CIKM'08
T2 - 17th ACM Conference on Information and Knowledge Management, CIKM'08
Y2 - 26 October 2008 through 30 October 2008
ER -