A transient hypergraph-based model for data access

Two major methods of accessing data in current database systems are querying and browsing. The more traditional query method returns an answer set that may consist of data values (DBMS), items containing the answer (full text), or items referring the user to items containing the answer (bibliographic). Browsing within a database, as best exemplified by hypertext systems, consists of viewing a database item and linking to related items on the basis of some attribute or attribute value. A model of data access has been developed that supports both query and browse access methods. The model is based on hypergraph representation of data instances. The hyperedges and nodes are manipulated through a set of operators to compose new nodes and to instantiate new links dynamically, resulting in transient hypergraphs. These transient hypergraphs are virtual structures created in response to user queries, and lasting only as long as the query session. The model provides a framework for general data access that accommodates user-directed browsing and querying, as well as traditional models of information and data retrieval, such as the Boolean, vector space, and probabilistic models. Finally, the relational database model is shown to provide a reasonable platform for the implementation of this transient hypergraph-based model of data access.

[1]  W. Bruce Croft,et al.  I3R: A new approach to the design of document retrieval systems , 1987, J. Am. Soc. Inf. Sci..

[2]  W. Bruce Croft,et al.  I 3 R: a new approach to the design of document retrieval systems , 1987 .

[3]  K. Garg Pankaj,et al.  Abstraction mechanisms in hypertext , 1987, CACM.

[4]  Ronald Fagin,et al.  A simplied universal relation assumption and its properties , 1982, TODS.

[5]  Leslie L. Miller,et al.  Query Translation Based on Hypergraph Models , 1988, Comput. J..

[6]  Frank G. Halasz,et al.  Reflections on NoteCards: seven issues for the next generation of hypermedia systems , 1987, CACM.

[7]  Nicolas Spyratos,et al.  Implementing Queries and Updates on Universal Scheme Interfaces , 1988, VLDB.

[8]  Theodor Holm Nelson.  Managing immense storage , 1988 .

[9]  Mark E. Frisse.  Searching for Information in a Hypertext Medical Handbook , 1987, Hypertext.

[10]  Carlo Batini,et al.  Schema Hypergraphs: A Formalism to Investigate Logical Data Base Design , 1980, WG.

[11]  Nicholas J. Belkin,et al.  Using structural representation of anomalous states of knowledge for choosing document retrieval strategies , 1986, SIGIR '86.

[12]  James A. Larson.  A Visual Approach to Browsing in a Database Environment , 1986, Computer.

[13]  Pankaj K. Garg.  Abstraction mechanisms in hypertext , 1988, CACM.

[14]  Janet Fiderio.  The Grand Vision , 1988 .

[15]  Frank Wm. Tompa,et al.  Hypertext and the Oxford English dictionary , 1988, CACM.

[16]  Jeff Conklin,et al.  Hypertext: An Introduction and Survey , 1987, Computer.

[17]  Michael A. Shepherd,et al.  Transient hypergraphs for citation networks , 1990, Inf. Process. Manag..

[18]  Gerard Salton,et al.  A vector space model for automatic indexing , 1975, CACM.

[19]  Gerard Salton,et al.  Automatic Information Organization And Retrieval , 1968 .

[20]  P. David Stotts,et al.  Petri-net-based hypertext: document structure with browsing semantics , 1989, TOIS.

[21]  Frank Wm. Tompa.  A data model for flexible hypertext database systems , 1989, TOIS.

[22]  R. Raymond Darrell,et al.  Hypertext and the Oxford English dictionary , 1988 .

[23]  G. Halasz Frank,et al.  Reflections on NoteCards: seven issues for the next generation of hypermedia systems , 1987, CACM.

[24]  Mark E. Frisse,et al.  Information retrieval from hypertext: update on the dynamic medical handbook project , 1989, Hypertext.

[25]  Steven M. Drucker,et al.  Intermedia: the concept and the construction of a seamless information environment , 1988, Computer.

[26]  H. Van Dyke Parunak,et al.  Hypermedia topologies and user navigation , 1989, Hypertext.

[27]  Don R. Swanson,et al.  Probabilistic models for automatic indexing , 1974, J. Am. Soc. Inf. Sci..

[28]  W. Bruce Croft,et al.  A retrieval model incorporating hypertext links , 1989, Hypertext.

[29]  P. David Stotts,et al.  Programmable browsing semantics in Trellis , 1989, Hypertext.

[30]  Alberto O. Mendelzon,et al.  Expressing structural hypertext queries in graphlog , 1989, Hypertext.

[31]  Giorgio Ausiello,et al.  Graph Algorithms for the Synthesis and Manipulation of Data Base Schemes , 1980, WG.

[32]  Donald H. Kraft,et al.  TIRS: a topological information retrieval system satisfying the requirements of the Waller-Kraft wish list , 1987, SIGIR '87.

[33]  David Maier,et al.  Maximal objects and the semantics of universal relation databases , 1983, TODS.

[34]  Jeffrey D. Ullman,et al.  Principles of Database Systems , 1980 .

[35]  Mayer D. Schwartz,et al.  Neptune: a hypertext system for CAD applications , 1986, SIGMOD '86.

[36]  Moshé M. Zloof.  Query-by-Example: A Data Base Language , 1977, IBM Syst. J..

[37]  Walt Scacchi,et al.  On designing intelligent hypertext systems for information management in software engineering , 1987, Hypertext.

[38]  Carolyn J. Crouch,et al.  The use of cluster hierarchies in hypertext information retrieval , 1989, Hypertext.

[39]  M. E. Maron,et al.  On Relevance, Probabilistic Indexing and Information Retrieval , 1960, JACM.

[40]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[41]  Mayer D. Schwartz,et al.  Contexts - A Partitioning Concept for Hypertext , 1987, ACM Trans. Inf. Syst..