ABSTRACT
On-line information services have become widespread in the Web nowadays. However, Web users are non-specialized and have a great variety of interests. Thus, interfaces for Web databases must be simple and uniform. In this paper we present an approach, based on Bayesian networks, for querying Web databases using keywords only. According to this approach, the user inputs a query through a simple search-box interface. 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. Our approach reduces the complexity of existing on-line interfaces and offers a solution to the problem of querying several distinct Web databases with a single interface. The applicability of the proposed approach was demonstrated by experimental results with 3 databases, obtained with a prototype search system that implements it. We have found that from 77% to 95% 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 from 60% to about 100%.
- Agrawal, S., Chaudhuri, S., and Das, G. DBXplorer: A System For Keyword-Based Search Over Relational Data ases.In In 18th International Conference on Data Engineering (San Jose, California, 2002). Google ScholarDigital Library
- Baeza-Yates, R., and Ribeiro-Neto, B. Modern Information Retrieval Addison Wesley, New York, NY, 1999. Google ScholarDigital Library
- Bruno, N., Gravano, L., and Marian, A. Evaluating top-k queries over web-accessible databases. In 20th International Conference on Data Engineering (San Jose, California, USA, 2002). Google ScholarDigital Library
- Chaudhuri, S., and Gravano, L. Evaluating top-k selection queries. In Proceedings of 25th International Conference on Very Large Data Bases (Edinburgh, Scotland, UK, 1999), pp.397--410. Google ScholarDigital Library
- Cohen, W. W. Reasoning a out Textual Similarity in a Web-Based Information Access System.Autonomous Agents and Multi-Agent Systems 2 1 (1999), 65--86. Google ScholarDigital Library
- Dar, S., Entin, G., Geva, S., and Palmon, E. DTL's DataSpot: Data ase exploration using plain language. In Proceedings of 24th International Conference on Very Large Data Bases (New York, New York, USA, 1998), pp.645--649. Google ScholarDigital Library
- Florescu, D., Kossmann, D., and Manolescu, I. Integrating Keyword Search into XML Query Processing. WWW9 / Computer Networks 33 1-6 (2000), 119--135. Google ScholarDigital Library
- Goldman, R., Shivakumar, N., Venkatasubramanian, S., and Garcia-Molina, H. Proximity search in databases. In Proceedings of 24th International Conference on Very Large Data Bases (New York, New York, USA, 1998), pp.26--37. Google ScholarDigital Library
- Pearl, J. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference Morgan Kaufmann Publishers, 1988. Google ScholarDigital Library
- Ribeiro-Neto, B., and Muntz, R. A belief network model for IR. In Proceedings of the 19th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (Zurich, Switzerland, August 1996), pp.253--260. Google ScholarDigital Library
- Ribeiro-Neto, B., Silva, I., and Muntz, R. Soft Computing in Information Retrieval: Techniques and Applications 1st ed. Springer Verlag, 2000, ch.11. Bayesian Network Models for IR, pp.259--291.Google Scholar
- Salton, G., and McGill, M. J. Introduction to Modern Information Retrieval 1st ed. McGraw-Hill, 1983. Google ScholarDigital Library
- Silva, I., Ribeiro-Neto, B., Calado, P., Moura, E., and Ziviani, N. Link-ased and Content-Based Evidential Information in a Belief Network Model. In Proceedings of the 23rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (Athens, Greece, July 2000), pp.96--103. Google ScholarDigital Library
- Turtle, H., and Croft, W. B. Evaluation of an Inference Network-Based Retrieval Model.ACM Transactions on Information Systems 9, 3 (July 1991), 187--222. Google ScholarDigital Library
Index Terms
Searching web databases by structuring keyword-based queries
Recommendations
Structuring keyword-based queries for web databases
JCDL '02: Proceedings of the 2nd ACM/IEEE-CS joint conference on Digital librariesThis 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 ...
A Bayesian network approach to searching Web databases through keyword-based queries
Special issue: Bayesian networks and information retrievalOn-line information services have become widespread in the Web nowadays. However, Web users are non-specialized and have a great variety of interests. Interfaces for Web databases must, therefore, be both simple and uniform. In this paper, we present a ...
Keyword-based queries over web databases
Effective databases for text & document managementIn this chapter, we propose an approach to using keywords (as in a Web search engine) for querying databases over the Web. The approach is based on a Bayesian network model and provides a suitable alternative to the use of interfaces based on multiple ...
Comments