Dynamic Query Evaluation Over Structures with Low Degree

10/06/2020
by   Alexandre Vigny, et al.
0

We consider the evaluation of first-order queries over classes of databases that have bounded degree and low degree. More precisely, given a query and a database, we want to efficiently test whether there is a solution, count how many solutions there are, or be able to enumerate the set of all solutions. Bounded and low degree are rather natural notions and both yield efficient algorithms. For example, Berkholz, Keppeler, and Schweikardt showed in 2017 that over databases of bounded degree, not only any first order query can efficiently be tested, counted and enumerated, but the data structure used can be updated when the database itself is updated. This paper extends existing results in two directions. First, we show that over classes of databases with low degree, there is a data structure that enables us to test, count and enumerate the solutions of first order queries. This data structure can also be efficiently recomputed when the database is updated. Secondly, for classes of databases with bounded degree we show that, without increasing the preprocessing time, we can compute a data structure that does not depend on the query but only on its quantifier rank. We can therefore perform a single preprocessing that can later be used for many queries.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

10/16/2020

Enumerating Answers to First-Order Queries over Databases of Low Degree

A class of relational databases has low degree if for all δ>0, all but f...
02/13/2018

First-order queries on classes of structures with bounded expansion

We consider the evaluation of first-order queries over classes of databa...
07/19/2017

First-Order Query Evaluation with Cardinality Conditions

We study an extension of first-order logic that allows to express cardin...
08/15/2018

A Blockchain Database Application Platform

A blockchain is a decentralised linked data structure that is characteri...
01/15/2021

Towards Approximate Query Enumeration with Sublinear Preprocessing Time

This paper aims at providing extremely efficient algorithms for approxim...
03/02/2020

Constant delay enumeration with FPT-preprocessing for conjunctive queries of bounded submodular width

Marx (STOC 2010, J. ACM 2013) introduced the notion of submodular width ...
12/06/2018

vChain: Enabling Verifiable Boolean Range Queries over Blockchain Databases

Blockchains have recently been under the spotlight due to the boom of cr...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.