Approximating predicates and expressive queries on probabilistic databases

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2008, Pages 99-108

  Koch, Christoph ^a  

^a Cornell University ^*  (United States)

Author keywords

Algorithms; Languages; Theory

Indexed keywords

APPROXIMATION ALGORITHMS; CLEANING; DATA PROCESSING; LINGUISTICS; POLYNOMIAL APPROXIMATION; PROBABILITY; QUERY LANGUAGES;

APPROXIMATE QUERIES; CONDITIONAL PROBABILITIES; DATA CLEANINGS; LANGUAGES; OF SENSORS; PROBABILISTIC DATABASES; THEORY; USE CASES;

DATABASE SYSTEMS;

EID: 57349104042     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1376916.1376932     Document Type: Conference Paper

References (19)

1. L. Antova, T, Jansen, C. Koch, and D. Olteanu. "Fast and Simple Relational Processing of Uncertain Data", In Proc. ICDE, 2008.
2. L. Antova, C. Koch, and D. Olteanu. "From Complete to Incomplete Information and Back". In Proc. SIGMOD, 2007.
3. L. Antova, C. Koch, and D. Olteanu. "Query language support for incomplete information in the MayBMS system". In Proc. VLDB, 2007. Demonstration Paper.
4. L. Antova, C. Koch, and D. Olteanu. "World-set Decompositions: Expressiveness and Efficient Algorithms". In Proc. ICDT, 2007.
5. O. Benjelloun, A. Das Sarma, A. Halevy, and J. Widom. "ULDBs: Databases with Uncertainty and Lineage". In Proc. VLDB, 2006.
6. J. Boulos, N. Dalvi, B. Mandhani, S. Mathur, C. Re, and D. Suciu. MYSTIQ: a system for finding more answers by using probabilities. In Proc. SIGMOD, 2005.
7. N. Dalvi and D. Suciu. "Efficient query evaluation on probabilistic databases". In Proc. VLDB, 2004.
8. N. Dalvi and D. Suciu. "The dichotomy of conjunctive queries on probabilistic structures". In Proc. PODS, 2007.
9. M. de Rougemont. "The Reliability of Queries". In Proc. PODS, pages 286-291, 1995.
10. E. Grädel, Y. Gurevich, and C. Hirsch. "The Complexity of Query Reliability". In Proc. PODS, pages 227-234, 1998.
11. J. Y. Halpern. Reasoning about Uncertainty. MIT Press, 2003.
12. J. M. Hellerstein, P. J. Haas, and H. J. Wang. "Online Aggregation". In Proc. SIGMOD, pages 171-182, 1997.
13. C. M. Jermaine, S. Arumugam, A. Pol, and A. Dobra. "Scalable approximate query processing with the DBO engine". In Proc. SIGMOD, pages 725-736, 2007.
14. R. M. Karp and M. Luby. "Monte-Carlo Algorithms for Enumeration and Reliability Problems". In Proc. FOCS, pages 56-64, 1983.
15. M. Mitzenmacher and E. Upfal. Probability and Computing. Cambridge University Press, 2005.
16. C. Re, N. Dalvi, and D. Suciu. Efficient top-k query evaluation on probabilistic data. In Proc. ICDE, 2007.
17. P. Sen and A. Deshpande. "Representing and Querying Correlated Tuples in Probabilistic Databases". In Proc. ICDE, pages 596-605, 2007.
18. Stanford Trio Project. "TriQL - The Trio Query Language", 2006. http://infolab.stanford.edu/-wadom/triql.html.
19. M. Y. Vardi. "The Complexity of Relational Query Languages". In Proc. STOC, pages 137-146, 1982.