Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
On temporal modeling in the context of object databases
ACM SIGMOD Record
On an algebra for historical relational databases: two views
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
A synchronization model for recorded presentations and its relevance for information retrieval
MULTIMEDIA '99 Proceedings of the seventh ACM international conference on Multimedia (Part 1)
Comparison of access methods for time-evolving data
ACM Computing Surveys (CSUR)
Formal semantics for time in databases
ACM Transactions on Database Systems (TODS)
Temporal and Real-Time Databases: A Survey
IEEE Transactions on Knowledge and Data Engineering
The "Authoring on the Fly" system for automated recording and replay of (tele)presentations
Multimedia Systems - Special issue: Multimedia authoring and presentation techniques
| Hi-index | 0.00 |
Time-evolving data structures deal with the temporal development of object sets describing in turn some kind of real-world phenomena. In the bitemporal case also objects having counterparts with an own predefined temporal component can be modelled. In this paper, we consider a subset of the problems usually covered by this context, having many real applications in which certain real-time constraints have to be met: synchronizability and random real-time access. We present a solution called the relational approach, which is based on a generalization of interval objects. By comparing this approach with the original simple transaction-based solution, we show its free scalability in the length of these interval objects, reducing the redundancy, in data representation to a minimum.