A probabilistic relational model for the integration of IR and databases

ABSTRACT

In this paper, a probabilistic relational model is presented which combines relational algebra with probabilistic retrieval. Based on certain independence assumptions, the operators of the relational algebra are redefined such that the probabilistic algebra is a generalization of the standard relational algebra. Furthermore, a special join operator implementing probabilistic retrieval is proposed. When applied to typical document databases, queries can not only ask for documents, but for any kind of object in the database. In addition, an implicit ranking of these objects is provided in case the query relates to probabilistic indexing or uses the probabilistic join operator. The proposed algebra is intended as a standard interface to combined database and IR systems, as a basis for implementing user-friendly interfaces.

REFERENCES

• 1: Daniel Barbara , Hector Garcia-Molina , Daryl Porter, A probabilistic relational data model, Proceedings of the international conference on extending database technology on Advances in database technology, p.60-74, March 1990, Venice, Italy
• 2: David C. Blair, An extended relational document retrieval model, Information Processing and Management: an International Journal, v.24 n.3, p.349-371, May 1988 [doi>10.1016/0306-4573(88)90101-X]
• 3: Bookstein, A. (1983). Outline of a General Probabilistic Retrieval Model. Journal of Documental~,on 39(2), pages 63-72.
• 4: Buckles, B.; Perry, F. (1982). A Fuzzy Represent, ation of Data for Relational Databases. Fuzzy Sets and Systems 7, pages 213-226.
• 5: Roger Cavallo , Michael Pittarelli, The Theory of Probabilistic Databases, Proceedings of the 13th International Conference on Very Large Data Bases, p.71-81, September 01-04, 1987
• 6: C. J. Date, An introduction to database systems: vol. 1 (5th ed.), Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990
• 7: B. C. Desai , P. Goyal , F. Sadri, Non-first normal form universal relations: an application to information retrieval systems, Information Systems, v.12 n.1, p.49-55, Jan. 1987 [doi>10.1016/0306-4379(87)90017-2]
• 8: Fuhr, N.; Buckley, C. (1993). Optimizing Document Indexing and Search Term Weighting Based on Probabllistic Models. In: Harman, D. (ed.): The First Tezt REtrieval Conference (TREC1). National Institute of Standards and Technology Special Publication 500-207, Gaithersburg, Md. 20899.
• 9: Norbert Fuhr, Models for retrieval with probabilistic indexing, Information Processing and Management: an International Journal, v.25 n.1, p.55-72, 1989 [doi>10.1016/0306-4573(89)90091-5]
• 10: Norbert Fuhr, A probabilistic framework for vague queries and imprecise information in databases, Proceedings of the sixteenth international conference on Very large databases, p.696-707, September 1990, Brisbane, Australia
• 11: Norbert Fuhr, Integration of probabilistic fact and text retrieval, Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval, p.211-222, June 21-24, 1992, Copenhagen, Denmark [doi>10.1145/133160.133202]
• 12: Suk Kyoon Lee, An Extended Relational Database Model for Uncertain and Imprecise Information, Proceedings of the 18th International Conference on Very Large Data Bases, p.211-220, August 23-27, 1992
• 13: Macleod, I. (1991). Text Retrieval and the Relational Model. Journal of the Amer, can Society for Informat~.on Science 42(3), pages 155-165.
• 14: Reasoning with belief functions: an analysis of compatibility, International Journal of Approximate Reasoning, v.4 n.5-6, p.363-389, Sep./Nov. 1990 [doi>10.1016/0888-613X(90)90013-R]
• 15: Pfeifer, U.; Fuhr, N. (1993). Aufwandsabschiitzung fiir die Prozessierung vager Anfragen auf der Basis des Datenstrom-Ansatzes. In: Stucky, W. (ed.): Datenbank~ysterne ~,n BTi;r'o, Technik und Wissenschaft, pages 375-392. Springer, Berlin et al.
• 16: Prade, H.; Testemale, C. (1984). Generalizing Database Relational Algebra for the Treatment of Incomplete/Uncertain information and Vague Queries. InformatzoTL Sczence 34, pages 115-143.
• 17: Hans-Jörg Schek , Peter Pistor, Data Structures for an Integrated Data Base Management and Information Retrieval System, Proceedings of the 8th International Conference on Very Large Data Bases, p.197-207, September 08-10, 1982

INDEX TERMS

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

Additional Classification:
  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.1 Logical Design
          Subjects: Data models
      H.2.3 Languages

          Nouns: SQL

  I. Computing Methodologies
  I.1 SYMBOLIC AND ALGEBRAIC MANIPULATION

General Terms:
Algorithms, Design, Languages