A transient hypergraph-based model for data access
- 1 April 1990
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information Systems
- Vol. 8 (2) , 77-102
- https://doi.org/10.1145/96105.96107
Abstract
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.Keywords
This publication has 27 references indexed in Scilit:
- A data model for flexible hypertext database systemsACM Transactions on Information Systems, 1989
- Petri-net-based hypertext: document structure with browsing semanticsACM Transactions on Information Systems, 1989
- Abstraction mechanisms in hypertextCommunications of the ACM, 1988
- Hypertext and the Oxford English dictionaryCommunications of the ACM, 1988
- Query Translation Based on Hypergraph ModelsThe Computer Journal, 1988
- Contexts—a partitioning concept for hypertextACM Transactions on Information Systems, 1987
- Maximal objects and the semantics of universal relation databasesACM Transactions on Database Systems, 1983
- A simplied universal relation assumption and its propertiesACM Transactions on Database Systems, 1982
- A vector space model for automatic indexingCommunications of the ACM, 1975
- On Relevance, Probabilistic Indexing and Information RetrievalJournal of the ACM, 1960