Reactive Ranking for Cooperative Databases

A cooperative database allows the user to specify approximate or vague query conditions. A vague query requires the database system to rank the retrieved answers according to their similarity to that query. In this paper we discuss a reactive ranking strategy for cooperative databases. The reactiveness in our approach is provided by an interactive mechanism which allows the user to select the answers of his preference and then uses these answers to tune the original user query. The ranking formula we propose is derived from a parallel with the AutoClass II system — a bayesian probabilistic classification engine. The reactive mechanism we propose is derived from a parallel with the technique of relevance feedback widely used in the area of information retrieval. We implemented our cooperative and reactive ranking approach in a Web browser interface and did some experimentation. Our experiments provide initial evidence that our approach might help the user to solve query tasks more p...

• Type: Conference
• Year: 1997
• Where: SCCC
• Authors: Berthier A. Ribeiro-Neto, Guilherme T. de Assis
• Keywords: Cooperative Databases, SCCC 1997, Theoretical Computer Science, Vague Query, Vague Query Conditions