Skip Navigation

The Computer Journal 1990 33(1):31-39; doi:10.1093/comjnl/33.1.31
© 1990 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by AZMOODEH, M.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

BRMQ: A Database Interface Facility based on Graph Traversals and Extended Relationships on Groups of Entities

M. AZMOODEH *

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


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.