Efficient associative data structures for bitemporal databases.

dc.contributor.advisorMatwin, S.,
dc.contributor.authorEid, Ashraf.
dc.identifier.citationSource: Masters Abstracts International, Volume: 41-02, page: 0561.
dc.description.abstractMost applications require storing multiple versions of data and involve a lot of temporal semantics in their schema. This requires maintenance and querying of temporal relations. A Bitemporal DBMS will simplify the development and maintenance of such applications by moving temporal support from the application into the DBMS engine. The success of such Bitemporal DBMSs relies mainly on the availability of high performance indices that handle update and search operations efficiently. A successful associative data structure (index) is the one that can efficiently partition the space of the attributes that are used within the keys. Temporal attributes have unique characteristics and should support now-relative intervals. These intervals grow as time grows and thus we need an index that can handle attributes with variable values. The proposed bitemporal index partitions the bitemporal space into four subspaces according to the end value of the temporal intervals. This results in separating those keys that have variable intervals from those that have fixed interval(s). In this thesis we have used on-the-shelf index that successfully indexes spatial attributes. But instead of representing the two temporal dimensions as a rectangle, we have represented them as 4 dimensional points. This results in better partitioning of each subtree space and in better search performance.
dc.format.extent180 p.
dc.publisherUniversity of Ottawa (Canada)
dc.subject.classificationComputer Science.
dc.titleEfficient associative data structures for bitemporal databases.
CollectionTh├Ęses, 1910 - 2010 // Theses, 1910 - 2010

MQ72761.PDF5.95 MBAdobe PDFOpen