We present a new structural characterization of the expressive power of the acyclic conjunctive queries in terms of guarded simulations, and give a finite preservation theorem for the guarded simulation invariant fragment of first order logic. We discuss the relevance of these results as a formal basis for constructing so-called guarded structural indexes. Structural indexes were first proposed in the context of semi-structured query languages and later successfully applied as an XML indexation mechanism for XPath-like queries on trees and graphs. Guarded structural indexes provide a generalization of structural indexes from graph databases to relational databases
The wide adoption of XML has increased the interest of the database community on tree-structured dat...
I present research on various encryption schemes and their applications in securing data. To do this...
IJCAI-2015 Honorable MentionInternational audienceExpressive query languages are gaining relevance i...
We present a new structural characterization of the expressive power of the acyclic conjunctive quer...
We present a new structural characterization of the expressive power of the acyclic conjunctive quer...
Traditional indices in relational databases are designed for queries that are selective by value. Ho...
Evaluating a boolean conjunctive query q over a guarded first-order theory T is equivalent to checki...
Abstract. Evaluating a Boolean conjunctive query q against a guarded first-order theory ϕ is equival...
A secure index is a data structure that allows a querier with a “trapdoor ” for a word x to test in ...
For many practical applications of logic-based methods there is a requirement to balance expressive ...
International audienceWe study static analysis, in particular the containment problem, for analogs o...
Unions of conjunctive queries, also known as select-project-join-union queries, are the most frequen...
We study the containment problem for conjunctive queries (CQs) expanded with negated atoms or arithm...
We study containment and equivalence of (unions of) conjunctive queries on relations annotated with ...
We extend some of the classical characterization theorems of relational database theory | par-ticula...
The wide adoption of XML has increased the interest of the database community on tree-structured dat...
I present research on various encryption schemes and their applications in securing data. To do this...
IJCAI-2015 Honorable MentionInternational audienceExpressive query languages are gaining relevance i...
We present a new structural characterization of the expressive power of the acyclic conjunctive quer...
We present a new structural characterization of the expressive power of the acyclic conjunctive quer...
Traditional indices in relational databases are designed for queries that are selective by value. Ho...
Evaluating a boolean conjunctive query q over a guarded first-order theory T is equivalent to checki...
Abstract. Evaluating a Boolean conjunctive query q against a guarded first-order theory ϕ is equival...
A secure index is a data structure that allows a querier with a “trapdoor ” for a word x to test in ...
For many practical applications of logic-based methods there is a requirement to balance expressive ...
International audienceWe study static analysis, in particular the containment problem, for analogs o...
Unions of conjunctive queries, also known as select-project-join-union queries, are the most frequen...
We study the containment problem for conjunctive queries (CQs) expanded with negated atoms or arithm...
We study containment and equivalence of (unions of) conjunctive queries on relations annotated with ...
We extend some of the classical characterization theorems of relational database theory | par-ticula...
The wide adoption of XML has increased the interest of the database community on tree-structured dat...
I present research on various encryption schemes and their applications in securing data. To do this...
IJCAI-2015 Honorable MentionInternational audienceExpressive query languages are gaining relevance i...