ACM Home Page
Please provide us with feedback. Feedback
Probabilistic temporal databases, I: algebra
Full text PdfPdf (878 KB)
Source ACM Transactions on Database Systems (TODS) archive
Volume 26 ,  Issue 1  (March 2001) table of contents
Pages: 41 - 95  
Year of Publication: 2001
ISSN:0362-5915
Authors
Alex Dekhtyar  Univ. of Maryland, College Park
Robert Ross  Univ. of Maryland, College Park
V. S. Subrahmanian  Univ. of Maryland, College Park
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 83,   Citation Count: 7
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/383734.383736
What is a DOI?

ABSTRACT

Dyreson and Snodgrass have drawn attention to the fact that, in many temporal database applications, there is often uncertainty about the start time of events, the end time of events, and the duration of events. When the granularity of time is small (e.g., milliseconds), a statement such as “Packet p was shipped sometime during the first 5 days of January, 1998” leads to a massive amount of uncertainty (5×24×60×60×1000) possibilities. As noted in Zaniolo et al. [1997], past attempts to deal with uncertainty in databases have been restricted to relatively small amounts of uncertainty in attributes. Dyreson and Snodgrass have taken an important first step towards solving this problem. In this article, 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, we present a temporal probabilistic algebra (TPA). We show that our definition of the TP-algebra provides a correct implementation of TATA despite the fact that it operates on implicit, succinct TP-relations instead of overwhemingly large annotated relations. Finally, we report on timings for an implementation of the TP-Algebra built on top of ODBC.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
 
4
BOOLE, G. 1854. The Laws of Thought, Macmillan, London.
 
5
 
6
 
7
DEKHTYAR, A., ROSS, R., AND SUBRAHMANIAN, V. S. 2001. Probabilistic temporal databases, Indexes, query optimization and updates, in preparation.
 
8
DEKHTYAR, A., AND SUBRAHMANIAN, V. S. 1997. Hybrid probabilistic logic programs, In Proceedings of the 1997 International Conference on Logic Programming, L. Naish, Ed., MIT Press.
 
9
DEKHTYAR, A., ROSS, R., AND SUBRAHMANIAN, V. S. 1998. Probabilistic temporal databases. Tech. Rep. CS-TR-3987, University of Maryland. http://www.cs.umd.edu:80/Dienst/UI/2.0/ Describe/ncstrl.umcp/CS-TR-3987?abstract=Dekhtyar.
10
11
 
12
DUBOIS,D.,AND PRADE, H. 1988. Certainty and uncertainty of vague knowledge and generalized dependencies in fuzzy databases. In Proceedings of the International Fuzzy Engineering Symposium, (Yokohama, Japan), 239-249.
 
13
DUBOIS,D.,AND PRADE, H. 1989. Processing Fuzzy Temporal Knowledge, IEEE Trans. Syst. Man Cybern. 19, 4, 729-744.
 
14
DUDA,R.O.,HART,P.E.,AND NILSSON, N. J. 1976. Subjective bayesian methods for rule-based inference systems, In Proceedings of the National Computer Conference, 1075-1082.
 
15
 
16
 
17
18
 
19
 
20
 
21
 
22
23
 
24
 
25
 
26
 
27
 
28
NG, R., AND SUBRAHMANIAN, V. S. 1993. A semantical framework for supporting subjective and conditional probabilities in deductive databases, J. Autom. Reasoning, 10, 2, 191-235.
 
29
 
30
 
31
SCHMIDT, H., KIESSLING, W., GUNTZER,U.,AND BAYER, R. 1987. Combining deduction by uncertainty with the power of magic. In Proceedings of the DOOD-89, (Kyoto, Japan), 205-224.
 
32
SHIRI, N. 1997. On a generalized theory of deductive databases, Ph.D. dissertation, Concordia University, Montreal, Canada, Aug.
 
33
SHOENFIELD, J. 1967. Mathematical Logic, Addison Wesley.
 
34
 
35
SNODGRASS, R. T. 1996. Personal communication to V.S. Subrahmanian.
 
36
SUBRAHMANIAN, V. S. 1987. On the semantics of quantitative logic programs, In Proceedings of the 4th IEEE Symposium on Logic Programming, Computer Society Press, 173-182.
 
37
SUBRAHMANIAN, V. S. 1988. Generalized triangular norm and co-norm based semantics for quantitative rule set logic programming, Logic Programming Research Group Tech. Rep. LPRG-TR- 88-22, Syracuse University.
 
38
 
39
THONE, H., KIESSLING,W.,AND GUNTZER, U. 1995. On cautious probabilistic inference and default detachment, Ann. Oper. Res. 55, 195-224.
 
40
 
41

CITED BY  7

Collaborative Colleagues:
Alex Dekhtyar: colleagues
Robert Ross: colleagues
V. S. Subrahmanian: colleagues