SPIDER: a multiuser information retrieval system for semistructured and dynamic data

ABSTRACT

The access structure, the retrieval model, and the system architecture of the SPIDER information retrieval system are described. The access structure provides efficient weighted retrieval on dynamic data collections. It is based on signatures and non-inverted item descriptions. The signatures provide upper bounds for the exact retrieval status values such that only a small number of exact retrieval status values have to be computed. SPIDER's retrieval model is a probabilistic retrieval model that is capable to exploit the database scheme of semistructured data collections. This model can be considred as a further development of the Binary Independence Indexing (BII) model. The system architecture was derived systematically from a given set of requirements such as effective and efficient retrieval on dynamic data collections, exploitation of the database scheme, computed views, and the integration of information retrieval functionality and database functionality.

REFERENCES

• 1: C. Berrut , Y. Chiaramella, Indexing medical reports in a multimedia environment: the RIME experimental approach, Proceedings of the 12th annual international ACM SIGIR conference on Research and development in information retrieval, p.187-197, June 25-28, 1989, Cambridge, Massachusetts, United States
• 2: Birkhoff, G., & Lipson, j. D. (1970). Heterogeneous Algebras. Journal of Combznatorial Theory, 8,115- 133.
• 3: CardelIi, L. (1989). Typeful Programming. Technical Report 45, DEC Systems Research Center, Palo Alto.
• 4: R. G. G. Cattell , J. Skeen, Object operations benchmark, ACM Transactions on Database Systems (TODS), v.17 n.1, p.1-31, March 1992 [doi>10.1145/128765.128766]
• 5: Chandra, A., &z Harel, D. (1980). Computable Queries for Relational Databases. Journal of Compuler and System Sciences, 21(2),156-178.
• 6: Ashok K. Chandra, Theory of database queries, Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.1-9, March 1988, Austin, Texas, United States [doi>10.1145/308386.308396]
• 7: Y. Chiaramella , B. Defude , M. F. Bruandet , D. Kerkouba, IOTA: a full text information retrieval system, Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval, p.207-213, September 1986, Palazzo dei Congressi, Pisa, Italy [doi>10.1145/253168.253212]
• 8: W. Bruce Croft , Pasquale Savino, Implementing ranking strategies using text signatures, ACM Transactions on Information Systems (TOIS), v.6 n.1, p.42-62, Jan. 1988 [doi>10.1145/42279.45947]
• 9: W. Bruce Croft , Lisa A. Smith , Howard R. Turtle, A loosely-coupled integration of a text retrieval system and an object-oriented database system, Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval, p.223-232, June 21-24, 1992, Copenhagen, Denmark [doi>10.1145/133160.133203]
• 10: D. Cutting , J. Pedersen, Optimization for dynamic inverted index maintenance, Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval, p.405-411, September 05-07, 1990, Brussels, Belgium [doi>10.1145/96749.98245]
• 11: Chris Faloutsos, Access methods for text, ACM Computing Surveys (CSUR), v.17 n.1, p.49-74, March 1985 [doi>10.1145/4078.4080]
• 12: Fret, It. P., & SehKuble, P. (1991a). Designing a Hypermedia Information System, In Karagiannis, D., editor, DEXA '91 Conf., pp. 449-454. Springer-Verlag.
• 13: H. P. Frei , P. Schäuble, Determining the effectiveness of retrieval algorithms, Information Processing and Management: an International Journal, v.27 n.2-3, p.153-164, Feb./March 1991 [doi>10.1016/0306-4573(91)90046-O]
• 14: 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]
• 15: 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
• 16: 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]
• 17: Norbert Fuhr , Chris Buckley, A probabilistic learning approach for document indexing, ACM Transactions on Information Systems (TOIS), v.9 n.3, p.223-248, July 1991 [doi>10.1145/125187.125189]
• 18: V. K. Govindan , A. P. Shivaprasad, Character recognition—a review, Pattern Recognition, v.23 n.7, p.671-683, Jul. 1990 [doi>10.1016/0031-3203(90)90091-X]
• 19: Donna Harman, Relevance feedback revisited, Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval, p.1-10, June 21-24, 1992, Copenhagen, Denmark [doi>10.1145/133160.133167]
• 20: Donna Harman , R. Baeza-Yates , Edward Fox , W. Lee, Inverted files, Information retrieval: data structures and algorithms, Prentice-Hall, Inc., Upper Saddle River, NJ, 1992
• 21: David J. Harper , Andrew D. M. Walker, ECLAIR: an extensible class library for information retrieval, The Computer Journal, v.35 n.3, p.256-267, June 1992 [doi>10.1093/comjnl/35.3.256]
• 22: Jens Hoppe, Integrated Management of Technical Documentation: The System Sprite, Springer-Verlag New York, Inc., Secaucus, NJ, 1992
• 23: Lee, K. F. (September, 1989). Hidden Markov Models: Past, Present, Future. In European Conference on Speech Communication and Technology, pp. 148- 155.
• 24: K. Li , J. F. Naughton, Multiprocessor main memory transaction processing, Proceedings of the first international symposium on Databases in parallel and distributed systems, p.177-187, December 05-07, 1988, Austin, Texas, United States
• 25: Alistair Moffat , Justin Zobel, Parameterised compression for sparse bitmaps, Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval, p.274-285, June 21-24, 1992, Copenhagen, Denmark [doi>10.1145/133160.133210]
• 26: Pogue, C., & Willet, P. (1987). Use of Text Signatures for Document Retrieval in a Highly Parallel Environmen. Parallel Computing, 4(3),259-268.
• 27: Robertson, S. E. (1977). The Probability Ranking Principle in IR. Journal of Documentation, 33(4),294- 304.
• 28: K. Salem , H. Garcia-Molina, System M: A Transaction Processing Testbed for Memory Resident Data, IEEE Transactions on Knowledge and Data Engineering, v.2 n.1, p.161-172, March 1990 [doi>10.1109/69.50911]
• 29: Gerard Salton , Chris Buckley, Parallel text search methods, Communications of the ACM, v.31 n.2, p.202-215, Feb. 1988 [doi>10.1145/42372.42380]
• 30: Gerard Salton , Christopher Buckley, Term-weighting approaches in automatic text retrieval, Information Processing and Management: an International Journal, v.24 n.5, p.513-523, 1988 [doi>10.1016/0306-4573(88)90021-0]
• 31: Sch~iuble, P. (1992). A Tutorial on Information Retrieval. Information Retrieval Course 1991/92, ETH Zurich.
• 32: Sch~iuble, P., & Wiithrich, B. (1992). On the Expressive Power of Query Languages. Technical Report 173, ETH Zurich, Department of Computer Science.
• 33: Craig Stanfill, Parallel information retrieval algorithms, Information retrieval: data structures and algorithms, Prentice-Hall, Inc., Upper Saddle River, NJ, 1992
• 34: Craig Stanfill , Brewster Kahle, Parallel free-text search on the connection machine system, Communications of the ACM, v.29 n.12, p.1229-1239, Dec. 1986 [doi>10.1145/7902.7907]
• 35: C. (Costantino) Thanos, Multi-Media Office Filing: The Multos Approach, Elsevier Science Inc., New York, NY, 1990

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.4 Systems
          Subjects: Concurrency; Query processing
  H.3 INFORMATION STORAGE AND RETRIEVAL
      H.3.1 Content Analysis and Indexing
          Subjects: Indexing methods

  I. Computing Methodologies
  I.1 SYMBOLIC AND ALGEBRAIC MANIPULATION

General Terms:
Algorithms, Design