Skip to main content
Article thumbnail
Location of Repository

Probabilistic Temporal Databases, I: Algebra

By et al. Alex Dekhtyar


... In this paper, we first introduce the syntax of Temporal-Probabilistic (TP) relations and then show how they can be converted to an explicit, significantly more space-consuming form called Annotated Relations. We then present a Theoretical Annotated Temporal Algebra (TATA). Being explicit, TATA is convenient for specifying how the algebraic operations should behave, but is impractical to use because annotated relations are overwhelmingly large. Next, w

Topics: Categories and Subject Descriptors, H.2.1 [Database Management, Logical Design--Data Models, H.2.3 [Database Management, Languages--Query Languages General Terms, probabilistic databases, temporal databases, relational algebra
Year: 2008
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.