Show simple item record

dc.contributor.advisorSnodgrass, Richard T.en_US
dc.contributor.authorSoo, Michael Dennis, 1962-
dc.creatorSoo, Michael Dennis, 1962-en_US
dc.date.accessioned2013-05-09T11:36:13Z
dc.date.available2013-05-09T11:36:13Z
dc.date.issued1996en_US
dc.identifier.urihttp://hdl.handle.net/10150/290685
dc.description.abstractTemporal database management systems provide integrated support for the storage and retrieval of time-varying information. Despite the extensive research which has been performed in this area over the last fifteen years, no commercial products exist and few viable prototypes have been constructed. It is our thesis that through the use of the proper abstractions, it is possible to construct a temporal database management system with robust semantics, without sacrificing performance, and with minimal implementation cost. Our approach parallels the development of relational database management systems, beginning with a theoretically sound abstract model, and then developing the underlying techniques to efficiently implement it. The major theme underlying this research is practicality, in terms of both semantics and implementation. We will show that expressive temporal semantics can be supported while still maintaining reasonable performance, and with relatively small implementation effort. This is made possible, in part, by minimally extending the relational model to support time, thereby allowing the reuse or easy adaptation of well-established relational technology. In particular, we investigate how relational database design, algebras, architectures, and query evaluation can be adapted or extended to the temporal context. Our aim is that software vendors could incorporate these results into existing non-temporal, commercial products with relatively small effort.
dc.language.isoen_USen_US
dc.publisherThe University of Arizona.en_US
dc.rightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.en_US
dc.subjectComputer Science.en_US
dc.titleConstructing a temporal database management systemen_US
dc.typetexten_US
dc.typeDissertation-Reproduction (electronic)en_US
thesis.degree.grantorUniversity of Arizonaen_US
thesis.degree.leveldoctoralen_US
dc.identifier.proquest9720650en_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.disciplineComputer Scienceen_US
thesis.degree.namePh.D.en_US
dc.description.noteThis item was digitized from a paper original and/or a microfilm copy. If you need higher-resolution images for any content in this item, please contact us at repository@u.library.arizona.edu.
dc.identifier.bibrecord.b34568128en_US
dc.description.admin-noteOriginal file replaced with corrected file October 2023.
refterms.dateFOA2018-06-16T01:12:17Z
html.description.abstractTemporal database management systems provide integrated support for the storage and retrieval of time-varying information. Despite the extensive research which has been performed in this area over the last fifteen years, no commercial products exist and few viable prototypes have been constructed. It is our thesis that through the use of the proper abstractions, it is possible to construct a temporal database management system with robust semantics, without sacrificing performance, and with minimal implementation cost. Our approach parallels the development of relational database management systems, beginning with a theoretically sound abstract model, and then developing the underlying techniques to efficiently implement it. The major theme underlying this research is practicality, in terms of both semantics and implementation. We will show that expressive temporal semantics can be supported while still maintaining reasonable performance, and with relatively small implementation effort. This is made possible, in part, by minimally extending the relational model to support time, thereby allowing the reuse or easy adaptation of well-established relational technology. In particular, we investigate how relational database design, algebras, architectures, and query evaluation can be adapted or extended to the temporal context. Our aim is that software vendors could incorporate these results into existing non-temporal, commercial products with relatively small effort.


Files in this item

Thumbnail
Name:
azu_td_9720650_sip1_c.pdf
Size:
18.73Mb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record