Journal of Engineering and Applied Sciences
ISSN: Online 1818-7803ISSN: Print 1816-949x
Abstract
Most of the prevalent database applications in the contemporary environment maneuvers with the temporal data. Temporal records characteristically vary over a due course of time while conventional databases don’t facilitate any feature to manage multiple snapshots of these records captured at discrete intervals. Consequently, it becomes difficult to cope up with this varying nature of temporal records by using traditional database approach. This restraint has been resolved by various data models which are implemented as an extension of the conventional database systems. This study presents a Tuple timestamp multiple historical relation data model which possesses features like minimal storage and minimal query execution time unlike the earlier historical relation data models. Tuple timestamp multiple historical relation data model lays emphasis upon storage of the preceding instances of the records into multiple historical relations. B-Tree Indexing is applied for scaling up the efficiency of the data model.
How to cite this article:
Shailender Kumar. Performance Evaluation of Tuple Timestamp Multiple Historical
Relation Data Model.
DOI: https://doi.org/10.36478/jeasci.2018.222.230
URL: https://www.makhillpublications.co/view-article/1816-949x/jeasci.2018.222.230