Approximate Query Answering over Incomplete Data

1. Transaction Processing Performance Council. TPC benchmark h standard specification (2014). Revision 2.17.1. (TPC-H)

   Google Scholar 

2. Abiteboul, S., Grahne, G.: Update semantics for incomplete databases. In: Proceedings of Very Large Data Bases (VLDB) Conference, pp. 1–12 (1985)

   Google Scholar 

3. Arenas, M., Bertossi, L.E., Chomicki, J.: Consistent query answers in inconsistent databases. In: Proceedings of the Symposium on Principles of Database Systems (PODS), pp. 68–79 (1999)

   Google Scholar 

4. Bertossi, L.E.: Database Repairing and Consistent Query Answering. Synthesis Lectures on Data Management. Morgan & Claypool Publishers, San Rafael (2011)

   Book  Google Scholar 

5. Bienvenu, M., Ortiz, M.: Ontology-mediated query answering with data-tractable description logics. In: Reasoning Web, pp. 218–307 (2015)

   Chapter  Google Scholar 

6. Calautti, M., Greco, S., Molinaro, C., Trubitsyna, I.: Exploiting equality generating dependencies in checking chase termination. PVLDB 9(5), 396–407 (2016)

   Google Scholar 

7. Calautti, M., Greco, S., Molinaro, C., Trubitsyna, I.: Using linear constraints for logic program termination analysis. TPLP 16(3), 353–377 (2016)

   MathSciNet  MATH  Google Scholar 

8. Calautti, M., Greco, S., Spezzano, F., Trubitsyna, I.: Checking termination of bottom-up evaluation of logic programs with function symbols. TPLP 15(6), 854–889 (2015)

   MathSciNet  MATH  Google Scholar 

9. Calautti, M., Greco, S., Trubitsyna, I.: Detecting decidable classes of finitely ground logic programs with function symbols. ACM Trans. Comput. Log. 18(4), 28:1–28:42 (2017)

   Article  MathSciNet  Google Scholar 

10. Calì, A., Gottlob, G., Lukasiewicz, T.: A general datalog-based framework for tractable query answering over ontologies. J. Web Semant. 14, 57–83 (2012)

    Article  Google Scholar 

11. Caroprese, L., Trubitsyna, I., Truszczynski, M., Zumpano, E.: The view-update problem for indefinite databases. In: Logics in Artificial Intelligence - 13th European Conference, JELIA 2012, Toulouse, France, September 26–28, 2012. Proceedings. pp. 134–146 (2012)

    Google Scholar 

12. Caroprese, L., Trubitsyna, I., Truszczynski, M., Zumpano, E.: A measure of arbitrariness in abductive explanations. TPLP 14(4–5), 665–679 (2014)

    MathSciNet  MATH  Google Scholar 

13. Console, M., Guagliardo, P., Libkin, L.: Approximations and refinements of certain answers via many-valued logics. In: Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning (KR), pp. 349–358 (2016)

    Google Scholar 

14. De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: On reconciling data exchange, data integration, and peer data management. In: Proceedings of the Symposium on Principles of Database Systems (PODS), pp. 133–142 (2007)

    Google Scholar 

15. Fiorentino, N., Greco, S., Molinaro, C., Trubitsyna, I.: ACID: A system for computing approximate certain query answers over incomplete databases. In: Proceedings of the International Conference on Management of Data (SIGMOD), pp. 1685–1688 (2018)

    Google Scholar 

16. Furfaro, F., Greco, S., Molinaro, C.: A three-valued semantics for querying and repairing inconsistent databases. Ann. Math. Artif. Intell. 51(2–4), 167–193 (2007)

    Article  MathSciNet  Google Scholar 

17. Grahne, G.: The Problem of Incomplete Information in Relational Databases. Lecture Notes in Computer Science, vol. 554. Springer, Berlin (1991)

    Google Scholar 

18. Greco, S., Molinaro, C., Spezzano, F.: Incomplete Data and Data Dependencies in Relational Databases. Synthesis Lectures on Data Management. Morgan & Claypool Publishers, San Rafael (2012)

    Book  Google Scholar 

19. Greco, S., Molinaro, C., Trubitsyna, I.: Computing approximate certain answers over incomplete databases. In: Proceedings of the Alberto Mendelzon International Workshop on Foundations of Data Management and the Web (AMW) (2017)

    Google Scholar 

20. Greco, S., Molinaro, C., Trubitsyna, I.: Approximation algorithms for querying incomplete databases. Inf. Syst. 86, 28–45 (2019). https://doi.org/10.1016/j.is.2019.03.010

    Article  Google Scholar 

21. Greco, S., Spezzano, F., Trubitsyna, I.: Checking chase termination: Cyclicity analysis and rewriting techniques. IEEE Trans. Knowl. Data Eng. 27(3), 621–635 (2015)

    Article  Google Scholar 

22. Guagliardo, P., Libkin, L.: Making SQL queries correct on incomplete databases: A feasibility study. In: Proceedings of the Symposium on Principles of Database Systems (PODS), pp. 211–223 (2016)

    Google Scholar 

23. Imielinski, T., Lipski, Jr., W.: Incomplete information in relational databases. J. ACM 31(4), 761–791 (1984)

    Article  MathSciNet  Google Scholar 

24. Koutris, P., Wijsen, J.: The data complexity of consistent query answering for self-join-free conjunctive queries under primary key constraints. In: Proceeding of the Symposium on Principles of Database Systems (PODS), pp. 17–29 (2015)

    Google Scholar 

25. Lenzerini, M.: Data integration: a theoretical perspective. In: Proceedings of the Symposium on Principles of Database Systems (PODS), pp. 233–246 (2002)

    Google Scholar 

26. Libkin, L.: How to define certain answers. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 4282–4288 (2015)

    Google Scholar 

27. Libkin, L.: SQL’s three-valued logic and certain answers. ACM Trans. Database Syst. 41(1), 1 (2016)

    Article  MathSciNet  Google Scholar 

28. Lipski, W.: On relational algebra with marked nulls. In: Proceedings of the Symposium on Principles of Database Systems (PODS), pp. 201–203 (1984)

    Google Scholar 

Download references