Designing a Hypermedia Information System

  • H. P. Frei
  • P. Schäuble


The purpose of a Hypermedia Information System is to provide access to stored hypermedia information. In particular, it has to allow the users of the system to browse through the information and to search for specified parts of the stored data. Hypermedia information is invariably partitioned into single information portions, so-called nodes. These nodes contain information of arbitrary types, i.e., text, graphics, images, or movies. The nodes themselves are connected by arcs, usually called links. These links allow the user to move through the hypermedia data collection at will and ‘read’ the content of the nodes he or she encounters.


Information Retrieval Query Language Multimedia Document Semantic Link Operation Report 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Church, K.: A Stochastics Program and Noun Phrase Parser for Unrestricted Text. Int. Conf. on Acoustics, Speech, and Signal Processing, pp. 695–698, 1989.Google Scholar
  2. [2]
    Conklin, J.: Hypertext: An Introduction and Survey. IEEE Computer 20, No. 9, Sept. 1987, pp. 17–41.CrossRefGoogle Scholar
  3. [3]
    Fagan, J.L.: Experiments in automatic phrase indexing for document retrieval: A comparison of syntactic and non-syntactic methods. PhD thesis, Department of Computer Science, Cornell University, TR 87–868, Sept. 1987.Google Scholar
  4. [4]
    Frei, H.P., Stieger, D.: The Retrieval View, a Component of the Document Architecture. Hypertext/ Hypermedia ‘81, Informatik-Fachberichte 276, Springer-Verlag, Berlin, 1991, pp. 99–108.Google Scholar
  5. [5]
    Fuhr, N.: A Probabilistic Framework for Vague Queries and Imprecise Information in Databases. Proc. 16th Int. Conf. on VLDB, Morgan Kaufmann Publishers, Palo Alto, CA, 1990, pp. 696–707.Google Scholar
  6. [6]
    Goodman, D.: The Complete Hypercard Handbook. Bantam, New York, 1987.Google Scholar
  7. [7]
    Haas, L.M, Freytag, J.C., Lohman, G.M., Pirahesh, H.: Extensible query processing in Starburst. Proc. ACM SIGMOD, Portland, OR, May 1989, pp. 377–388.Google Scholar
  8. [8]
    Halasz, F.G.: Reflections on NoteCards: Seven Issues for the next Generation of Hypermedia Systems. Commun. ACM 31, No. 7, July 1988, pp. 836–852.CrossRefGoogle Scholar
  9. [9]
    Kienitz-Vollmer, B., Reichardt, J.: Bestimmung von Mehrwortgruppen mithilfe des Begrenzerverfahrens. Lustig, G. (ed.): Automatische Indexierung zwischen Forschung und Anwendung, 01m. Hildesheim, 1986, pp. 1830.Google Scholar
  10. [10]
    Mauldin, M.L.: Information Retrieval by Text Skimming. PhD thesis, Department of Computer Science, Carnegie Mellon University, 1989.Google Scholar
  11. [11]
    Motro, A.: VAGUE: A User Interface to Relational Databases that Permits Vague Queries. ACM TOIS 6, No. 3, 1988, pp. 187–214.CrossRefGoogle Scholar
  12. [12]
    Raymond, D.R., Tompa, F.W.: Hypertext and the Oxford English Dictionary. Commun. ACM 31, No. 7, July 1988, pp. 871–879.CrossRefGoogle Scholar
  13. [13]
    Saxton, L.V., Raghavan, V.V.: Design of an Integrated Information Retrieval/Database Management System. IEEE Transactions on Knowledge and Data Engineering 2, No. 2, 1990, pp. 210–219.CrossRefGoogle Scholar
  14. [14]
    Schäuble, P., Wüthrich, B.: On the Expressive Power of Query Languages. Technical Report, ETH Zurich, Department of Computer Science, 1991.Google Scholar
  15. [15]
    Schäuble, P., Glavitsch, U.: A Probabilistic Hypermedia Retrieval Model Based on Hidden Markov Models. Proc. Workshop Intelligent Access to Information Systems, Darmstadt, Nov. 1990.Google Scholar
  16. [16]
    Schäuble, P.: On the Compatibility of Retrieval Functions, Preference Relations, and Document Descriptions. Technical Report No. 113, ETH Zurich, Department of Computer Science, 1989.Google Scholar
  17. [17]
    Schek, H.-J., Paul, H.-B., Scholl, M.H., Weikum, G.: The DASDBS Project: Objectives, Experiences, and Future Prospects. IEEE Transactions on Knowledge and Data Engineering 2, No. 2, Special Issue on Prototype Systems, March 1990, pp. 25–43.Google Scholar
  18. [18]
    Stanfill, C., Kahle, B.: Parallel Free-Text Search on the Connection Machine System. Commun. ACM 29, No. 12, Dec. 1986, pp. 1229–1239.CrossRefGoogle Scholar
  19. [19]
    Teufel, B.: Informationsspuren zum numerischen und graphischen Vergleich von reduzierten natürlich-sprachlichen Texten. Informatik-Dissertationen ETH Zürich, No. 13, vdf Verlag, Zürich, 1989.Google Scholar

Copyright information

© Springer-Verlag Wien 1991

Authors and Affiliations

  • H. P. Frei
    • 1
  • P. Schäuble
    • 1
  1. 1.Department of Computer ScienceSwiss Federal Institute of Technology (ETH) ZurichZurichSwitzerland

Personalised recommendations