Representing Temporal and Factual Uncertainty

  • P. Chountas
  • I. Petrounias
Conference paper
Part of the Advances in Soft Computing book series (AINSC, volume 7)


The task of an information system is the representation and management of indicative information from multiple sources describing the state of some enterprise. Most snapshot database models represent enterprises that are crisp where all relationships are fixed, and all attributes are atomic valued. In temporal databases, approaches are dealing mainly with precise absolute times. Very few approaches deal with imprecise absolute times or with infinite absolute times. No consideration has been given to imprecise infinite times. Many algebraic models are dealing with temporal or value imperfection, with no description of the semantics of uncertain information. This paper suggests an application independent conceptual framework describing the semantics of temporal and incomplete information and translates this to database representation.


Entity Type Relation Schema Fact Type Factual Uncertainty Probability Interval 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    P. Chountas, I. Petrounias, Precise Enterprises and Imperfect Data, Proc. of 4th IEEE International Baltic Workshop on DB and IS, Lithuania, May 2000.Google Scholar
  2. 2.
    P. Haddway. Believiing Change and Changing Belief. IEEE Transaction in Systems, Man, and Cybernetics, 26 (3): 385–409, May 1996.Google Scholar
  3. 3.
    C.E. Dyreson, R.T. Snodgrass, Support Valid-Time Indeterminacy, ACM, TODS Vol. 23, No. 1, pp. 1–57, 1998.Google Scholar
  4. 4.
    F. Kabanza, J-M. Stevenne, P. Wolper, Handling Infinite Temporal Data, Proc. of ACM Symposium on Principles of Database Systems (PODS), 1990.Google Scholar
  5. 5.
    D. Barbara, H. Garcia-Molina, D. Porter, The Management of Probabilistic Data, IEEE Transactions on Knowledge and Data Engineering, Vol. 4, No, 5, 1992.Google Scholar
  6. 6.
    N. Fuhr, T.Rölleke, A Probabilistic Relational Algebra for the Integration of Information Retrieval and Database Systems, ACM TOIS Vol. 15, No 1, pp 32–66, 1997.Google Scholar
  7. 7.
    A. Dekhtyar, R. Ross, V. S. Subrahmanian, TATA Probabilistic Temporal Databases, I: Algebra, Technical Report CS-TR-3987, University of Maryland, USA, 1999.Google Scholar
  8. 8.
    I. Petrounias, A Conceptual Development Framework for Temporal Information Systems, Proc. ER ‘87, LA, California, USA, November 1997.Google Scholar
  9. 9.
    M. Delgado, S. Moral, On the concept of Possibility-Probability Consistency in Fuzzy Sets For Intelligent Systems, D.Dubois, H.Prade and R. Yager (eds), Morgan Kaufman Publishers, pp 247–250, 1993.Google Scholar
  10. H.C. Liu, K.Ramamohanarao, Algebraic Equivalences Among Nested Relational Expressions, Proc. of CIKM, 1994Google Scholar
  11. L.Lin, T.Risch, Querying Continuous Time Sequences, Proc. of 24th International Conference on Very Large Databases (VLDB), pp. 170–181, New York, 1998.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • P. Chountas
    • 1
  • I. Petrounias
    • 1
  1. 1.Department of ComputationUMISTManchesterUK

Personalised recommendations