21 citations · 29 across the 14 of their papers we have counts for
10 papers · 1 filter
Getting to the Root: A Combined Complexity Perspective on Consistent Query Answering
Miika Hannula
We study the combined complexity of consistent query answering for Boolean self-join-free conjunctive queries with unary primary keys and acyclic attack graphs. Although every fixe…
Dichotomy for Axiomatising Inclusion Dependencies on K-Databases
Miika Hannula, Teymur Ismikhanov, Jonni Virtema
A relation consisting of tuples annotated by an element of a monoid K is called a K-relation. A K-database is a collection of K-relations. In this paper, we study entailment of inc…
Independence Under Incomplete Information
Miika Hannula, Minna Hirvonen, Juha Kontinen +1
We initiate an investigation how the fundamental concept of independence can be represented effectively in the presence of incomplete information in relational databases. The conce…
Parameterised Complexity of Consistent Query Answering via Graph Representations
Teemu Hankala, Miika Hannula, Yasir Mahmood +1
We study consistent query answering via different graph representations. First, we introduce solution-conflict hypergraphs in which nodes represent facts and edges represent either…
Conditional independence on semiring relations
Miika Hannula
Conditional independence plays a foundational role in database theory, probability theory, information theory, and graphical models. In databases, conditional independence appears…
Information inequality problem over set functions
Miika Hannula
Information inequalities appear in many database applications such as query output size bounds, query containment, and implication between data dependencies. Recently Khamis et al.…