Representing and querying conceptual graphs with relational database management systems is possible

This is an experimental study on the feasibility of maintaining medical concept dictionaries in production grade relational database management systems (RDBMS.) In the past, RDBMS did not support transitive relational structures and had therefore been unsuitable for managing knowledge bases. The rev...

Full description

Saved in:
Bibliographic Details
Published inProceedings - AMIA Symposium pp. 598 - 602
Main Authors Schadow, G, Barnes, M R, McDonald, C J
Format Journal Article
LanguageEnglish
Published United States American Medical Informatics Association 2001
Subjects
Artificial Intelligence
Database Management Systems
Feasibility Studies
Medical Records Systems, Computerized - organization & administration
Programming Languages
Software
Vocabulary, Controlled
Online AccessGet full text

Cover

More Information
Summary:This is an experimental study on the feasibility of maintaining medical concept dictionaries in production grade relational database management systems (RDBMS.) In the past, RDBMS did not support transitive relational structures and had therefore been unsuitable for managing knowledge bases. The revised SQL-99 standard, however, may change this. In this paper we show that modern RDBMS that support recursive queries are capable of querying transitive relationships in a generic data model. We show a simple but efficient indexed representation of transitive closure. We could confirm that even challenging combined transitive relationships can be queried in SQL.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1531-605X