The complexity of acyclic conjunctive queries (Q3196620)

From MaRDI portal
Revision as of 03:17, 4 May 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q59259727, #quickstatements; #temporary_batch_1714786519576)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references