|Title:||QUERY LANGUAGES FOR HIERARCHIC DATABASES
|Authors:||E. Dahlhaus and J .A. Makowsky
|Abstract:||We generalize relational data bases such as to include also hierarchic structures in the form of directories of relations and directories of directories. In this framework we study computable directory transformations which generalize the computable queries introduced by A. Chandra and D. Harel. We introduce a transformation language DL .. and show its completeness. The language DL can serve as a basis for specification and correctness of directory transformations and also as a basis to study their complexity. The method developed can be seen also in a broader context: It allows the general manipulation of "objects" (as in SMALLTALK or SETL) and adds to it a construct for parallelism (as in VAL). We also discuss the relationship of our approach to various other models of hierarchic and obj~ct-oriented database models.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1990/CS/CS0652), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1990
To the main CS technical reports page
Computer science department, Technion