skip to main content
research-article
Free Access

Probabilistic databases: diamonds in the dirt

Published:01 July 2009Publication History
Skip Abstract Section

Abstract

Treasures abound from hidden facts found in imprecise data sets.

References

  1. Andritsos, P. and Fuxman, A., Miller, R.J. Clean answers over dirty databases. In ICDE (2006). Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Antova, L., Jansen, T., Koch, C. and Olteanu, D. Fast and simple relational processing of uncertain data. In ICDE (2008). Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Barbara, D., Garcia-Molina, H. and Porter, D. The management of probabilistic data. IEEE Trans. Knowl. Data Eng. 4, 5 (1992), 487--502. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Benjelloun, O., Sarma, A.D., Halevy, A., Theobald, M. and Widom, J. Databases with uncertainty and lineage. VLDBJ 17, 2 (2008), 243--264. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Burdick, D., Deshpande, P., Jayram, T.S., Ramakrishnan, R. and Vaithyanathan, S. Efficient allocation algorithms for OLAP over imprecise data. In VLDB (2006), 391--402. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Cavallo, R. and Pittarelli, M. The theory of probabilistic databases. In Proceedings of VLDB (1987), 71--81. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Cheng, R., Kalashnikov, D. and Prabhakar, S. Evaluating probabilistic queries over imprecise data. In SIGMOD (2003), 551--562. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Codd, E.F. Relational completeness of data base sublanguages. In Database Systems (1972), Prentice-Hall, 65--98.Google ScholarGoogle Scholar
  9. Cowell, R., Dawid, P., Lauritzen, S. and Spiegelhalter D., eds. Probabilistic Networks and Expert Systems (1999), Springer. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Dalvi, N. and Suciu, D. The dichotomy of conjunctive queries on probabilistic structures. In PODS (2007), 293--302. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Dalvi, N. and Suciu, D. Efficient query evaluation on probabilistic databases. VLDB J. 16, 4 (2007), 523--544. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Dalvi, N. and Suciu, D. Management of probabilistic data: Foundations and challenges. In PODS (Beijing, China, 2007) 1--12 (invited talk). Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Darwiche, A. A differential approach to inference in bayesian networks. J. ACM 50, 3 (2003), 280--305. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. DeRose, P., Shen, W., Chen, F., Lee, Y., Burdick, D., Doan, A. and Ramakrishnan, R. Dblife: A community information management platform for the database research community. In CIDR (2007), 169--172.Google ScholarGoogle Scholar
  15. Deshpande, A., Guestrin, C., Madden, S., Hellerstein, J.M. and Hong, W. Model-driven data acquisition in sensor networks. In VLDB (2004), 588--599. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Fagin, R., Lotem, A. and Naor, M. Optimal aggregation algorithms for middleware. In Proceedings of the 20th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (2001), ACM Press, 102--113. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Friedman, N., Getoor, L., Koller, D. and Pfeffer A. Learning probabilistic relational models. In IJCAI (1999), 1300--1309. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Fuhr, N. and Roelleke, T. A probabilistic relational algebra for the integration of information retrieval and database systems. ACM Trans. Inf. Syst. 15, 1 (1997), 32--66. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Grädel, E., Gurevich, Y. and Hirsch, C. The complexity of query reliability. In PODS (1998), 227--234. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Gupta, R. and Sarawagi, S. Creating probabilistic databases from information extraction models. In VLDB (2006), 965--976. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Halevy, A. Answering queries using views: A survey. VLDB J. 10, 4 (2001), 270--294. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Imielinski, T. and Lipski, W. Incomplete information in relational databases. J. ACM 31 (Oct. 1984), 761--791. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Jampani, R., Xu, F., Wu, M., Perez, L., Jermaine, C. and Haas, P. MCDB: A Monte Carlo approach to managing uncertain data. In SIGMOD (2008), 687--700. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Jayram, T., Kale, S. and Vee, E. Efficient aggregation algorithms for probabilistic data. In SODA (2007). Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Kanagal, B. and Deshpande, A. Online filtering, smoothing and probabilistic modeling of streaming data. In ICDE (2008), 1160--1169. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Lafferty, J., McCallum, A. and Pereira, F. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In ICML (2001). Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Lakshmanan, L., Leone, N., Ross, R. and Subrahmanian, V. Probview: A flexible probabilistic database system. ACM Trans. Database Syst. 22, 3 (1997). Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Nierman, A. and Jagadish, H. ProTDB: Probabilistic data in XML. In VLDB (2002), 646--657. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Olteanu, D., Huang, J. and Koch, C. SPROUT: Lazy vs. eager query plans for tuple independent probabilistic databases. In ICDE (2009). Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Rastogi, V., Suciu, D. and Hong, S. The boundary between privacy and utility in data publishing. In VLDB (2007). Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Ré, C., Dalvi, N. and Suciu, D. Efficient Top-k query evaluation on probabilistic data. In ICDE (2007).Google ScholarGoogle Scholar
  32. Ré, C., Suciu, D. Efficient evaluation of having queries on a probabilistic database. In Proceedings of DBPL (2007). Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. Ré, C. and Suciu, D. Materialized views in probabilistic databases for information exchange and query optimization. In Proceedings of VLDB (2007) Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. Ré, C., Letchner, J., Balazinska, M. and Suciu, D. Event queries on correlated probabilistic streams. In SIGMOD (Vancouver, Canada, 2008). Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. Roth, D. On the hardness of approximate reasoning. Artif. Intell. 82, 1--2 (1996), 273--302. Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. Sen, P. and Deshpande, A. Representing and querying correlated tuples in probabilistic databases. In ICDE, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  37. Soliman, M.A., Ilyas, I.F. and Chang, K.C.-C. Probabilistic top- and ranking-aggregate queries. ACM Trans. Database Syst. 33, 3 (2008). Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. Vardi, M.Y. The complexity of relational query languages. In Proceedings of 14th ACM SIGACT Symposium on the Theory of Computing (San Francisco, California, 1982), 137--146. Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. Verma, T. and Pearl, J. Causal networks: Semantics and expressiveness. Uncertainty Artif. Intell. 4 (1990), 69--76. Google ScholarGoogle ScholarDigital LibraryDigital Library
  40. Wong, E. A statistical approach to incomplete information in database systems. ACM Trans. Database Syst. 7, 3 (1982), 470--488. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Probabilistic databases: diamonds in the dirt

                  Recommendations

                  Comments

                  Login options

                  Check if you have access through your login credentials or your institution to get full access on this article.

                  Sign in

                  Full Access

                  • Published in

                    cover image Communications of the ACM
                    Communications of the ACM  Volume 52, Issue 7
                    Barbara Liskov: ACM's A.M. Turing Award Winner
                    July 2009
                    141 pages
                    ISSN:0001-0782
                    EISSN:1557-7317
                    DOI:10.1145/1538788
                    Issue’s Table of Contents

                    Copyright © 2009 ACM

                    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                    Publisher

                    Association for Computing Machinery

                    New York, NY, United States

                    Publication History

                    • Published: 1 July 2009

                    Permissions

                    Request permissions about this article.

                    Request Permissions

                    Check for updates

                    Qualifiers

                    • research-article
                    • Popular
                    • Refereed

                  PDF Format

                  View or Download as a PDF file.

                  PDF

                  eReader

                  View online with eReader.

                  eReader

                  HTML Format

                  View this article in HTML Format .

                  View HTML Format