Enumerating answers to first-order queries over databases of low degree

Arnaud Durand 1, 2 Nicole Schweikardt 3 Luc Segoufin 1
1 DAHU - Verification in databases
CNRS - Centre National de la Recherche Scientifique : UMR8643, Inria Saclay - Ile de France, ENS Cachan - École normale supérieure - Cachan, LSV - Laboratoire Spécification et Vérification [Cachan]
Abstract : A class of relational databases has low degree if for all delta, all but finitely many databases in the class have degree at most n^delta, 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. in time bounded by n^(1+epsilon), for all epsilon. We generalise 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 enumerating the answers to a query can be done with constant delay after a pseudo-linear time preprocessing.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-01070898
Contributor : Luc Segoufin <>
Submitted on : Thursday, October 2, 2014 - 4:16:05 PM
Last modification on : Tuesday, February 5, 2019 - 1:46:02 PM

Links full text

Identifiers

Collections

Citation

Arnaud Durand, Nicole Schweikardt, Luc Segoufin. Enumerating answers to first-order queries over databases of low degree. Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS'14, Snowbird, UT, USA, June 22-27, 2014, Jun 2014, Snowbird, United States. pp.121--131, ⟨10.1145/2594538.2594539⟩. ⟨hal-01070898⟩

Share

Metrics

Record views

178