ACM Home Page
Please provide us with feedback. Feedback
Probabilistic object bases
Full text PdfPdf (664 KB)
Source ACM Transactions on Database Systems (TODS) archive
Volume 26 ,  Issue 3  (September 2001) table of contents
Pages: 264 - 312  
Year of Publication: 2001
ISSN:0362-5915
Authors
Thomas Eiter  Technische Universität Wien, Wien, Austria
James J. Lu  Bucknell University, Lewisburg, PA
Thomas Lukasiewicz  Technische Universität Wien, Wien, Austria
V. S. Subrahmanian  University of Maryland, College Park
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 51,   Citation Count: 4
Additional Information:

abstract   references   cited by   additional resources   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/502030.502031
What is a DOI?

ABSTRACT

Although there are many applications where an object-oriented data model is a good way of representing and querying data, current object database systems are unable to handle objects whose attributes are uncertain. In this article, we extend previous work by Kornatzky and Shimony to develop an algebra to handle object bases with uncertainty. We propose concepts of consistency for such object bases, together with an NP-completeness result, and classes of probabilistic object bases for which consistency is polynomially checkable. In addition, as certain operations involve conjunctions and disjunctions of events, and as the probability of conjunctive and disjunctive events depends both on the probabilities of the primitive events involved as well as on what is known (if anything) about the relationship between the events, we show how all our algebraic operations may be performed under arbitrary probabilistic conjunction and disjunction strategies. We also develop a host of equivalence results in our algebra, which may be used as rewrite rules for query optimization. Last but not least, we have developed a prototype probabilistic object base server on top of ObjectStore. We describe experiments to assess the efficiency of different possible rewrite rules.


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
ATKINSON, M., DEWITT, D., MAIER, D., BANCILHON, F., DITTRICH, K., AND ZDONIK, S. 1989. The objectoriented database system manifesto. In Proceedings of DOOD-89, Elsevier Science, Amsterdam, the Netherlands, 40-57.
 
3
 
4
 
5
 
6
BOOLE, G. 1854. The Laws of Thought. Macmillan, London.
 
7
 
8
DEKHTYAR,A.AND SUBRAHMANIAN, V. S. 1997. Hybrid probabilistic programs. In Proceedings of the Fourteenth International Conference on Logic Programming (ICLP '97 ), MIT Press, Cambridge, Mass., 391-405.
9
 
10
11
 
12
EITER, T., LU,J.J.,LUKASIEWICZ,T.,AND SUBRAHMANIAN, V. S. 1999. Probabilistic object bases. Tech. Rep. INFSYS RR-1843-99-11, Institut f~r Informationssysteme, Technische Universit~t Wien.
 
13
EITER, T., LUKASIEWICZ,T.,AND WALTER, M. 2000a. A data model and algebra for probabilistic complex values. Tech. Rep. INFSYS RR-1843-00-04, Institut f~ur Informationssysteme, Technische Universit~t Wien.
 
14
 
15
 
16
FUHR,N.AND R~LLEKE, T. 1996. A probabilistic NF2 relational algebra for integrated information retrieval and database systems. In Proceedings of the Second World Conference on Integrated Design and Process Technology, Society for Design and Process Science, 17-30.
17
 
18
 
19
GRAEFE, G. 1995. The cascades framework for query optimization. Data Eng. Bull. 18, 3, 19-29.
 
20
21
 
22
HADDAWY, P. 1994. Generating Bayesian networks from probability logic knowledge bases. In Proceedings of the Tenth Conference on Uncertainty in Artificial Intelligence (UAI-94), Morgan Kaufmann, Los Altos, Calif., 262-269.
 
23
 
24
 
25
 
26
 
27
KOLLER,D.AND PFEFFER, A. 1997. Object-oriented Bayesian networks. In Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence (UAI-97), Morgan Kaufmann, Los Altos, Calif., 302-313.
 
28
 
29
KYBURG,JR., H. E. AND PITTARELLI, M. 1996. Set-based Bayesianism. IEEE Trans. Syst. Man Cybern. A: Syst. Humans 26, 3, 324-339.
 
30
 
31
 
32
33
 
34
LASKEY,K.B.AND MAHONEY, S. M. 1997. Network fragments: Representing knowledge for constructing probabilistic models. In Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence (UAI-97), Morgan-Kaufmann, Los Altos, Calif., 334-341.
 
35
 
36
 
37



Collaborative Colleagues:
Thomas Eiter: colleagues
James J. Lu: colleagues
Thomas Lukasiewicz: colleagues
V. S. Subrahmanian: colleagues