First-order queries on classes of structures with bounded expansion - Archive ouverte HAL Access content directly
Journal Articles Logical Methods in Computer Science Year : 2020

First-order queries on classes of structures with bounded expansion

(1) , (2)
1
2
Luc Segoufin
  • Function : Author
  • PersonId : 840446

Abstract

We consider the evaluation of first-order queries over classes of databases with bounded expansion. The notion of bounded expansion is fairly broad and generalizes bounded degree, bounded treewidth and exclusion of at least one minor. It was known that over a class of databases with bounded expansion, first-order sentences could be evaluated in time linear in the size of the database. We give a different proof of this result. Moreover, we show that answers to first-order queries can be enumerated with constant delay after a linear time preprocessing. We also show that counting the number of answers to a query can be done in time linear in the size of the database.
Fichier principal
Vignette du fichier
main-final.pdf (482.2 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01706665 , version 1 (12-02-2018)
hal-01706665 , version 2 (08-01-2021)

Identifiers

Cite

Wojciech Kazana, Luc Segoufin. First-order queries on classes of structures with bounded expansion. Logical Methods in Computer Science, 2020, 16 (1), ⟨10.23638/LMCS-16(1:25)2020⟩. ⟨hal-01706665v2⟩
137 View
61 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More