2 citations · 2 across the 3 of their papers we have counts for
Showing cs.DBShow all
2 papers · 1 filter
cs.DB2022
Querying Incomplete Numerical Data: Between Certain and Possible Answers
Marco Console, Leonid Libkin, Liat Peterfreund
Queries with aggregation and arithmetic operations, as well as incomplete data, are common in real-world database, but we lack a good understanding of how they should interact. On…
cs.DB2013★ 2 cited
Deep Separability of Ontological Constraints
Andrea Calì, Marco Console, Riccardo Frosini
When data schemata are enriched with expressive constraints that aim at representing the domain of interest, in order to answer queries one needs to consider the logical theory con…