The complexity of acyclic conjunctive queries (Q3196620): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q59259727, #quickstatements; #temporary_batch_1714786519576 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/382780.382783 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2004485491 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q59259727 / rank | |||
Normal rank | |||
Latest revision as of 03:17, 4 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of acyclic conjunctive queries |
scientific article |
Statements
The complexity of acyclic conjunctive queries (English)
0 references
30 October 2015
0 references
CSP
0 references
LOGCFL
0 references
acyclic hypergraph
0 references
bounded treewidth
0 references
conjunctive query
0 references
constraint
0 references
constraint satisfaction problem
0 references
database theory
0 references
degree of cyclicity
0 references
hinge
0 references
join tree
0 references
parallel algorithm
0 references
query containment
0 references
subsumption
0 references
tree query
0 references
