Structuring keyword-based queries for web databases

ABSTRACT

This paper describes a framework, based on Bayesian belief networks, for querying Web databases using keywords only. According to this framework, the user inputs a query through a simple search-box. From the input query, one or more plausible structured queries are derived and submitted to Web databases. The results are then retrieved and presented to the user as ranked answers. To evaluate our framework, an experiment using 38 example queries was carried out. We found out that 97% of the time, one of the top three resulting structured queries is the proper one. Further, when the user selects one of these three top queries for processing, the ranked answers present average precision figures of 92%.

REFERENCES

• 1: Agrawal S., et. al. DBXplorer: A system for keyword-based search over relational databases. In Intl. Conf. on Data Eng. (2002)
• 2: Roger H. L. Chiang , Cecil Eng Huang Chua , Veda C. Storey, A smart web query method for semantic retrieval of web data, Data & Knowledge Engineering, v.38 n.1, p.63-84, 07/01/2001 [doi>10.1016/S0169-023X(01)00017-9]
• 3: Daniela Florescu , Donald Kossmann , Ioana Manolescu, Integrating keyword search into XML query processing, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.33 n.1-6, p.119-135, June 2000
• 4: Berthier A. N. Ribeiro , Richard Muntz, A belief network model for IR, Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval, p.253-260, August 18-22, 1996, Zurich, Switzerland [doi>10.1145/243199.243272]

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.3 INFORMATION STORAGE AND RETRIEVAL
      H.3.3 Information Search and Retrieval
          Subjects: Retrieval models

General Terms:
Algorithms, Experimentation

Keywords:
bayesian belief networks, web databases, web query