Author:
Fink Robert,Huang Jiewen,Olteanu Dan
Publisher
Springer Science and Business Media LLC
Subject
Hardware and Architecture,Information Systems
Reference60 articles.
1. Abiteboul, S., Kimelfeld, B., Sagiv, Y., Senellart, P.: On the expressiveness of probabilistic XML models. VLDB J. 18(5), 1041–1064 (2009)
2. Amsterdamer, Y., Deutch, D., Tannen, V.: Provenance for aggregate queries. In: PODS, pp. 153–164 (2011)
3. Antova, L., Jansen, T., Koch, C., Olteanu, D.: Fast and simple relational processing of uncertain data. In: ICDE, pp. 983–992 (2008)
4. Barcelo, P., Libkin, L., Romero, M.: Efficient approximations of conjunctive queries. In: PODS, pp. 249–260 (2012)
5. Birnbaum, E., Lozinskii, E.: The good old Davis-Putnam procedure helps counting models. J. AI Res. 10(6), 457–477 (1999)
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Applications and Computation of the Shapley Value in Databases and Machine Learning;Companion of the 2024 International Conference on Management of Data;2024-06-09
2. Probabilistic Query Evaluation: The Combined FPRAS Landscape;Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2023-06-18
3. Probabilistic Reasoning at Scale: Trigger Graphs to the Rescue;Proceedings of the ACM on Management of Data;2023-05-26
4. Efficient Uncertainty Tracking for Complex Queries with Attribute-level Bounds;Proceedings of the 2021 International Conference on Management of Data;2021-06-09
5. Chapter 26. Approximate Model Counting;Frontiers in Artificial Intelligence and Applications;2021-02-02