Querying Incomplete Data : Complexity and Tractability via Datalog and First-Order Rewritings

To answer database queries over incomplete data the gold standard is finding certain answers: those that are true regardless of how incomplete data is interpreted. Such answers can be found efficiently for conjunctive queries and their unions, even in the presence of constraints. With negation added, the problem becomes intractable however. We concentrate on the complexity of certain answers under constraints, and on effficiently answering queries outside the usual classes of (unions) of conjunctive queries by means of rewriting as Datalog and first-order queries. We first notice that there are three different ways in which query answering can be cast as a decision problem. We complete the existing picture and provide precise complexity bounds on all versions of the decision problem, for certain and best answers. We then study a well-behaved class of queries that extends unions of conjunctive queries with a mild form of negation. We show that for them, certain answers can be expressed in Datalog with negation, even in the presence of functional dependencies, thus making them tractable in data complexity. We show that in general Datalog cannot be replaced by first-order logic, but without constraints such a rewriting can be done in first-order. The paper is under consideration in Theory and Practice of Logic Programming (TPLP).Comment: Under consideration in Theory and Practice of Logic Programming (TPLP

Certain Answers of Extensions of Conjunctive Queries by Datalog and First-Order Rewriting

International audienc

A Researcher’s Digest of GQL

International audienceGQL (Graph Query Language) is being developed as a new ISO standard for graph query languages to play the same role for graph databases as SQL plays for relational. In parallel, an extension of SQL for querying property graphs, SQL/PGQ, is added to the SQL standard; it shares the graph pattern matching functionality with GQL. Both standards (not yet published) are hard-to-understand specifications of hundreds of pages. The goal of this paper is to present a digest of the language that is easy for the research community to understand, and thus to initiate research on these future standards for querying graphs. The paper concentrates on pattern matching features shared by GQL and SQL/PGQ, as well as querying facilities of GQL

Certain Answers of Extensions of Conjunctive Queries by Datalog and First-Order Rewriting

International audienc

Experimental Assessment of Possible Factors Associated with Tick-Borne Encephalitis Vaccine Failure

Currently the only effective measure against tick-borne encephalitis (TBE) is vaccination. Despite the high efficacy of approved vaccines against TBE, rare cases of vaccine failures are well documented. Both host- and virus-related factors can account for such failures. In this work, we studied the influence of mouse strain and sex and the effects of cyclophosphamide-induced immunosuppression on the efficacy of an inactivated TBE vaccine. We also investigated how an increased proportion of non-infectious particles in the challenge TBE virus would affect the protectivity of the vaccine. The vaccine efficacy was assessed by mortality, morbidity, levels of viral RNA in the brain of surviving mice, and neutralizing antibody (NAb) titers against the vaccine strain and the challenge virus. Two-dose vaccination protected most animals against TBE symptoms and death, and protectivity depended on strain and sex of mice. Immunosuppression decreased the vaccine efficacy in a dose-dependent manner and changed the vaccine-induced NAb spectrum. The vaccination protected mice against TBE virus neuroinvasion and persistence. However, viral RNA was detected in the brain of some asymptomatic animals at 21 and 42 dpi. Challenge with TBE virus enriched with non-infectious particles led to lower NAb titers in vaccinated mice after the challenge but did not affect the protective efficacy

GPC: A Pattern Calculus for Property Graphs

The development of practical query languages for graph databases runs well ahead of the underlying theory. The ISO committee in charge of database query languages is currently developing a new standard called Graph Query Language (GQL) as well as an extension of the SQL Standard for querying property graphs represented by a relational schema, called SQL/PGQ. The main component of both is the pattern matching facility, which is shared by the two standards. In many aspects, it goes well beyond RPQs, CRPQs, and similar queries on which the research community has focused for years. Our main contribution is to distill the lengthy standard specification into a simple Graph Pattern Calculus (GPC) that reflects all the key pattern matching features of GQL and SQL/PGQ, and at the same time lends itself to rigorous theoretical investigation. We describe the syntax and semantics of GPC, along with the typing rules that ensure its expressions are well-defined, and state some basic properties of the language. With this paper we provide the community a tool to embark on a study of query languages that will soon be widely adopted by industry

GPC: A Pattern Calculus for Property Graphs

The development of practical query languages for graph databases runs well ahead of the underlying theory. The ISO committee in charge of database query languages is currently developing a new standard called Graph Query Language (GQL) as well as an extension of the SQL Standard for querying property graphs represented by a relational schema, called SQL/PGQ. The main component of both is the pattern matching facility, which is shared by the two standards. In many aspects, it goes well beyond RPQs, CRPQs, and similar queries on which the research community has focused for years. Our main contribution is to distill the lengthy standard specification into a simple Graph Pattern Calculus (GPC) that reflects all the key pattern matching features of GQL and SQL/PGQ, and at the same time lends itself to rigorous theoretical investigation. We describe the syntax and semantics of GPC, along with the typing rules that ensure its expressions are well-defined, and state some basic properties of the language. With this paper we provide the community a tool to embark on a study of query languages that will soon be widely adopted by industry