Advertisement

A Time-Evolving Data Structure Scalable between Discrete and Continuous Attribute Modifications

  • Martin Danielsson
  • Rainer Müller
Chapter
  • 444 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2598)

Abstract

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.

Keywords

Active Transition Continuous Transition Relational Approach Object Space Active Object 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. A. Bubenko. The temporal dimension in information modelling. In Technical Report RC-6187-26479, IBM T. J. Watson Research Center, Nov. 1976.Google Scholar
  2. 2.
    J._Clifford and A. U. Tansel. On an algebra for historical relational database: Two views. In Proc. of the ACM SIGMOD International Conference on Management of Data, 1985.Google Scholar
  3. 3.
    J. Clifford and D. S. Warren. Formal Semantics for Time in Databases. ACM Transactions on Database Systems, 6(2):114–154, 1983.Google Scholar
  4. 4.
    M. Danielsson. Migration JEDAS-AOF. Master’s thesis, Computer Science Institute, University of Freiburg, Germany, Jan. 2002.Google Scholar
  5. 5.
    P. Deutsch. Deflate compressed data format specification version 1.3. Request for Comment, RFC 1951, IETF, May 1996.Google Scholar
  6. 6.
    J. R. Driscoll, N. Sarnak, D. Sleator, and R. E. Tarjan. Making Data Structures Persistent. Journal of Computer and System Science, 38:86–124, 1989.zbMATHMathSciNetCrossRefGoogle Scholar
  7. 7.
    W. Hürst and R. Mueller. A Synchronization Model for Recorded Presentations and its Relevance for Information Retrieval. In Proc. of ACM Multimedia’ 99, Orlando, Fl., Oct. 1999.Google Scholar
  8. 8.
    T. Lauer, R. Mueller, and T. Ottmann. Animations for Teaching Purposes, Now and Tomorrow. Special Issue on “Future of Computer Science Symposium (FOCSS)” of Journal of Universal Computer Science (J.UCS), 7(5), June 2001.Google Scholar
  9. 9.
    R. Mueller. Wahlfreier Zugriff in Präsentationsaufzeichnungen am Beispiel integrierter Applikationen. PhD thesis, Computer Science Institute, University of Freiburg, 2000.Google Scholar
  10. 10.
    R. Mueller and T. Ottmann. The “Authoring on the Fly” System for Automated Recording and Replay of (Tele)presentations. Special Issue on “Multimedia Authoring and Presentation Techniques” of ACM/Springer Multimedia Systems Journal, 8(3), May 2000.Google Scholar
  11. 11.
    R. Mueller and T. Ottmann. Electronic Note-Taking, chapter Technologies. Handbook on Information Technologies for Education and Training, Series: International Handbook on Information Systems, Editor: Adelsberger, H. H., Collis, B., Pawlowski, J. M. Springer-Verlag, 2002.Google Scholar
  12. 12.
    G. Ozsoyoglu and R. T. Snodgrass. Temporal and real-time databases: A survey. Knowledge and Data Engineering, 7(4):513–532, 1995.CrossRefGoogle Scholar
  13. 13.
    N. Pissinou, K. Makki, and Y. Yesha. On Temporal Modelling in the Context of Object Databases. ACM Computing Surveys, 22(3):8–15, Sept. 1993.Google Scholar
  14. 14.
    B. Salzberg and V. J. Tsotras. Comparison of AccessMethods for Time-Evolving Data. ACM Computing Surveys, 31(2):158–221, June 1999.CrossRefGoogle Scholar
  15. 15.
    J. Stasko. The Path-Transition Paradigm: A Practical Methodology for Adding Animation To Program Interfaces. Journal of Visual Languages and Computing, 3(1):213–236, Sept. 1990.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Martin Danielsson
    • 1
  • Rainer Müller
    • 1
  1. 1.imc AG Office FreiburgGermany

Personalised recommendations