Models for incomplete and probabilistic information

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4254 LNCS, Issue , 2006, Pages 278-296

  Green, Todd J ^a   Tannen, Val ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; DATABASE SYSTEMS; INFORMATION TECHNOLOGY; MATHEMATICAL MODELS; PROBABILITY; QUERY LANGUAGES;

PROBABILISTIC DATABASE MODELS; RELATIONAL ALGEBRA;

INFORMATION SCIENCE;

EID: 33845234464     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11896548_24     Document Type: Conference Paper

References (35)

1. S. Abiteboul and O. M. Duschka. Complexity of Answering Queries Using Materialized Views. In PODS, pages 254-263, 1998.
2. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, Reading, MA, 1995.
3. S. Abiteboul, P. Kanellakis, and G. Granne. On the representation and querying of sets of possible worlds. Theor. Comput. Sci., 78(1):159-187, 1991.
4. M. Arenas, L. E. Bertossi, and J. Chomicki. Answer sets for consistent query answering in inconsistent databases. TPLP, 3(4-5):393-424, 2003.
5. D. Barbara, H. Garcia-Molina, and D. Porter. A probabilistic relational data model. In EDBT, pages 60-74, New York, NY, USA, 1990.
6. P. Buneman, S. Khanna, and W. C. Tan. Why and Where: A Characterization of Data Provenance. In ICDT, pages 316-330, 2001.
7. R. Cavallo and M. Pittarelli. The Theory of Probabilistic Databases. In VLDB, pages 71-81, 1987.
8. Y. Cui, J. Widom, and J. L. Wiener. Tracing the lineage of view data in a warehousing environment. ACM Trans. Database Syst., 25(2):179-227, 2000.
9. N. Dalvi and D. Suciu. Efficient Query Evaluation on Probabilistic Databases. In VLDB, pages 864-875, 2004.
10. D. Dey and S. Sarkar. A Probabilistic Relational Model and Algebra. ACM TODS, 21(3):339-369, 1996.
11. R. Durrett. Probability: Theory and Examples. Duxbury Press, 3rd edition, 2004.
12. T. Eiter, J. J. Lu, T. Lukasiewicz, and V. S. Subrahmanian. Probabilistic object bases. ACM Trans. Database Syst., 26(3):264-312, 2001.
13. R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data exchange: Semantics and query answering. In ICDT, pages 207-224, London, UK, 2003. Springer-Verlag.
14. N. Friedman, L. Getoor, D. Koller, and A. Pfeffer. Learning probabilistic relational models with structural uncertainty. In Proc. ICML, 2001.
15. N. Fuhr and T. Rölleke. A Probabilistic Relational Algebra for the Integration of Information Retrieval and Database Systems. ACM TODS, 14(1):32-66, 1997.
16. E. Grädel, Y. Gurevich, and C. Hirch. The Complexity of Query Reliability. In PODS, pages 227-234, 1998.
17. G. Grahne. Horn Tables - An Efficient Tool for Handling Incomplete Information in Databases. In PODS, pages 75-82. ACM Press, 1989.
18. G. Grahne. The Problem of Incomplete Information in Relational Databases, volume 554 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1991.
19. J. Y. Halpern. Reasoning About Uncertainty. MIT Press, Cambridge, MA, 2003.
20. T. Imieliński and W. Lipski, Jr. Incomplete Information in Relational Databases. J. ACM, 31(4):761-791, 1984.
21. T. Imieliński, S. A. Naqvi, and K. V. Vadaparty. Incomplete objects - a data model for design and planning applications. In SIGMOD, pages 288-297, 1991.
22. L. V. S. Lakshmanan, N. Leone, R. Ross, and V. S. Subrahmanian. Prob View: a Flexible Probabilistic Database System. ACM TODS, 22(3):419-469, 1997.
23. L. V. S. Lakshmanan and F. Sadri. Probabilistic deductive databases. In ILPS, pages 254-268, Cambridge, MA, USA, 1994. MIT Press.
24. N. Leone, F. Scarcello, and V. S. Subrahmanian. Optimal Models of Disjunctive Logic Programs: Semantics, Complexity, and Computation. IEEE Trans. Knowl. Data Eng., 16(4):487-503, 2004.
25. L. Libkin. Aspects of Partial Information in Databases. PhD thesis, University of Pennsylvania, 1994.
26. L. Libkin and L. Wong. Semantic representations and query languages for or-sets. J. Computer and System Sci., 52(1).-125-142, 1996.
27. R. Reiter. A sound and sometimes complete query evaluation algorithm for relational databases with null values. J. ACM, 33(2):349-370, 1986.
28. F. Sadri. Modeling Uncertainty in Databases. In ICDE, pages 122-131. IEEE Computer Society, 1991.
29. A. D. Sarma, O. Benjelloun, A. Halevy, and J. Widom. Working Models for Uncertain Data. In To appear in ICDE, April 2006.
30. D. Suciu and N. Dalvi. Foundations of probabilistic answers to queries (tutorial). In SIGMOD, pages 963-963, New York, NY, USA, 2005. ACM Press.
31. R. van der Meyden. Logical Approaches to Incomplete Information: A Survey. In J. Chomicki and G. Saake, editors, Logics for Databases and Information Systems. Kluwer Academic Publishers, Boston, 1998.
32. M. Y. Vardi. Querying Logical Databases. JCSS, 33(2):142-160, 1986.
33. J. Widom. Trio: A System for Integrated Management of Data, Accuracy, and Lineage. In CIDR, Jan. 2005.
34. E. Zimányi. Query evaluation in probabilistic databases. Theoretical Computer Science, 171(1-2):179-219, 1997.
35. E. Zimányi and A. Pirotte. Imperfect information in relational databases. In Uncertainty Management in Information Systems, pages 35-88. Kluwer, 1996.