Queries with Arithmetic on Incomplete Databases

作者: Marco Console , Matthias Hofer , Leonid Libkin

DOI: 10.1145/3375395.3387666

关键词:

摘要: The standard notion of query answering over incomplete database is that certain answers, guaranteeing correctness regardless how data interpreted. In majority real-life databases, relations have numerical columns and queries use arithmetic comparisons. Even though the answers still applies, we explain it becomes much more problematic in situations when missing occurs columns.We propose a new general framework allows us to assign measure certainty answers. We test agnostic scenario where do not prior information about values attributes, similarly predominant approach handling which assumes each null can be interpreted as an arbitrary value domain. key technical challenge lack uniform distribution entire domain such real numbers. overcome this by associating with asymptotic behavior volumes some subsets Euclidean space. show well-defined, describe approaches computing approximating it. While computationally hard, or result irrational number, even for simple constraints, produce polynomial-time randomized approximation schemes multiplicative guarantees conjunctive queries, additive first-order queries. also set experimental results confirm feasibility approach.

参考文章(31)
Witold Lipski, On Relational Algebra with Marked Nulls. symposium on principles of database systems. pp. 201- 203 ,(1984)
Yuri Matijasevič, Julia Robinson, Reduction of an arbitrary diophantine equation to one in 13 unknowns Acta Arithmetica. ,vol. 27, pp. 521- 553 ,(1975) , 10.4064/AA-27-1-521-553
Nilesh Dalvi, Gerome Miklau, Dan Suciu, Asymptotic Conditional Probabilities for Conjunctive Queries Database Theory - ICDT 2005. pp. 289- 305 ,(2004) , 10.1007/978-3-540-30570-5_20
Tomasz Imieliński, Witold Lipski, Incomplete Information in Relational Databases Journal of the ACM. ,vol. 31, pp. 761- 791 ,(1984) , 10.1145/1634.1886
Maurizio Lenzerini, Data integration: a theoretical perspective symposium on principles of database systems. pp. 233- 246 ,(2002) , 10.1145/543613.543644
Foto Afrati, Phokion G. Kolaitis, Answering aggregate queries in data exchange Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '08. pp. 129- 138 ,(2008) , 10.1145/1376916.1376936
Foto Afrati, Chen Li, Prasenjit Mitra, Answering queries using views with arithmetic comparisons symposium on principles of database systems. pp. 209- 220 ,(2002) , 10.1145/543613.543641
Anthony Klug, On conjunctive queries containing inequalities Journal of the ACM. ,vol. 35, pp. 146- 160 ,(1988) , 10.1145/42267.42273
Ron van der Meyden, The Complexity of Querying Indefinite Data about Linearly Ordered Domains Journal of Computer and System Sciences. ,vol. 54, pp. 113- 135 ,(1997) , 10.1006/JCSS.1997.1455
Witold Lipski, On relational algebra with marked nulls preliminary version Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems - PODS '84. pp. 201- 203 ,(1984) , 10.1145/588011.588040