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

by   Arnaud Durand, et al.

A class of relational databases has low degree if for all δ>0, all but finitely many databases in the class have degree at most n^δ, where n is the size of the database. Typical examples are databases of bounded degree or of degree bounded by log n. It is known that over a class of databases having low degree, first-order boolean queries can be checked in pseudo-linear time, i.e. for all ϵ>0 in time bounded by n^1+ϵ. We generalize this result by considering query evaluation. We show that counting the number of answers to a query can be done in pseudo-linear time and that after a pseudo-linear time preprocessing we can test in constant time whether a given tuple is a solution to a query or enumerate the answers to a query ith constant delay.



There are no comments yet.


page 1

page 2

page 3

page 4


First-order queries on classes of structures with bounded expansion

We consider the evaluation of first-order queries over classes of databa...

Towards Approximate Query Enumeration with Sublinear Preprocessing Time

This paper aims at providing extremely efficient algorithms for approxim...

Aggregate Queries on Sparse Databases

We propose an algebraic framework for studying efficient algorithms for ...

Dynamic Query Evaluation Over Structures with Low Degree

We consider the evaluation of first-order queries over classes of databa...

Query Preserving Watermarking Schemes for Locally Treelike Databases

Watermarking is a way of embedding information in digital documents. Muc...

Universal (and Existential) Nulls

Incomplete Information research is quite mature when it comes to so call...

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 ...
This week in AI

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