Valid-time database depicts a certain error-free effigy of database which besteads agile delegation of the set of interval objects that may be historical or condign to the current environment and even pertinent for the future aspects that can be ameliorated randomly at any point in valid time domain. As data is emerging endlessly with time in a vast magnitude so to retrieve it efficiently is a key idea of research. The access method is exigent for time-varying databases than conventional one due to their timely and eternally growing traits. In this paper, we have implemented data model and wielded the binary-tree approach to implement query retrieval acquisition of time-oriented database, which sustains the preferential scenario as collated to the extant approach supported by database environment. We also adumbrated the various proposed access approaches that support dynamic interval management. In the end of the paper, we have summarized them based on the time and capacity requirement.
Key words: Valid-time interval, temporal database, indexing.
|
