© 1990 by British Computer Society
| ||||||||||||||||||||||||||||||||||||||||||||||||||
BRMQ: A Database Interface Facility based on Graph Traversals and Extended Relationships on Groups of Entities
Department of Computer Science, University of Essex, Wivenhoe Park, Colchester CO4 3SQ, UK
A binary relational database model is used as the heart of a coexistent database system architecture. The semantic binary relational model (SBRM) of information allows for evolutionary changes in the data base by breaking large constructs into atomic named objects. A graph representation of the SBRM schemas is used as an effective data base interface. Such an interface allows interrogation of the database by employing a sequence of graphical movements based on the schema graphs displayed on the screen. This paper describes a data base interface language which is based on manipulating graphical images of objects in an SBRM graph.
Received December 1985. revised November 1987.
* Author's present address: British Telecom, Scottish Mutual House, Lower Brook Street, Ipswich IP4 1AQ
Department of Computer Science, University of Essex, Wivenhoe Park, Colchester CO4 3SQ