Enumerating Answers to First-Order Queries over Databases of Low Degree - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Logical Methods in Computer Science Année : 2022

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

Résumé

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 with constant delay.
Fichier principal
Vignette du fichier
cdlin-lowdeg.pdf (336.73 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03809756 , version 1 (10-10-2022)

Identifiants

Citer

Arnaud Durand, Nicole Schweikardt, Luc Segoufin. Enumerating Answers to First-Order Queries over Databases of Low Degree. Logical Methods in Computer Science, 2022, 18 (2), pp.23. ⟨10.46298/lmcs-18(2:7)2022⟩. ⟨hal-03809756⟩
24 Consultations
13 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More