| | |
| | |
Stat |
Members: 3643 Articles: 2'487'895 Articles rated: 2609
28 March 2024 |
|
| | | |
|
Article overview
| |
|
First-order queries on structures of bounded degree are computable with constant delay | Arnaud Durand
; Etienne Grandjean
; | Date: |
7 Jul 2005 | Subject: | Logic in Computer Science; Computational Complexity | cs.LO cs.CC | Abstract: | A bounded degree structure is either a relational structure all of whose relations are of bounded degree or a functional structure involving bijective functions only. In this paper, we revisit the complexity of the evaluation problem of not necessarily Boolean first-order queries over structures of bounded degree. Query evaluation is considered here as a dynamical process. We prove that any query on bounded degree structures is $constantdelaylin$, i.e., can be computed by an algorithm that has two separate parts: it has a precomputation step of linear time in the size of the structure and then, it outputs all tuples one by one with a constant (i.e. depending on the size of the formula only) delay between each. Seen as a global process, this implies that queries on bounded structures can be evaluated in total time $O(f(|phi|).(|calS|+|phi(calS)|))$ and space $O(f(|phi|).|calS|)$ where $calS$ is the structure, $phi$ is the formula, $phi(calS)$ is the result of the query and $f$ is some function. Among other things, our results generalize a result of cite{Seese-96} on the data complexity of the model-checking problem for bounded degree structures. Besides, the originality of our approach compared to that cite{Seese-96} and comparable results is that it does not rely on the Hanf’s model-theoretic technic (see cite{Hanf-65}) and is completely effective. | Source: | arXiv, cs.LO/0507020 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |