Evaluating Datalog via tree automata and cycluits (Q2322722): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: Wikidata QID (P12): Q128626663, #quickstatements; #temporary_batch_1726270017965
 
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: ComputeTW / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3104480332 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1808.04663 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding and counting given length cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combined Tractability of Query Evaluation via Tree Automata and Cycluits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provenance Circuits for Trees and Treelike Instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rewriting Guarded Negation Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarded Negation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic Datalog, Tree Validity, and Limited Access Containment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic Datalog Containment / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Step Up in Expressiveness of Decidable Fixpoint Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective interpolation and preservation in guarded logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to clique minimal separator decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games and Model Checking for Guarded Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: State-complexity of finite-state devices, state compressibility and incompressibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth computations. I: Upper bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Way Tree Automata Solving Pushdown Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Implication Problem for Functional and Inclusion Dependencies is Undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplicial decompositions of graphs: A survey of applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of acyclicity for hypergraphs and relational database schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query evaluation via tree-decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Datalog LITE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypertree decompositions and tractable queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic datalog over finite structures of bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarded fixed point logics and the monadic theory of countable trees. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint solving via fractional edge covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incomplete Information in Relational Databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal decomposition by clique separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: The semijoin algebra and the guarded fragment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of cyclic combinational circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Indexing Framework for Queries on Probabilistic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Regular Simple Paths in Graph Databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4135489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The implication problem for functional and inclusion dependencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic Boolean circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition by clique separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lattice-theoretical fixpoint theorem and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming Techniques: Regular expression search algorithm / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128626663 / rank
 
Normal rank

Latest revision as of 00:38, 14 September 2024

scientific article
Language Label Description Also known as
English
Evaluating Datalog via tree automata and cycluits
scientific article

    Statements

    Evaluating Datalog via tree automata and cycluits (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 September 2019
    0 references
    database theory
    0 references
    Datalog
    0 references
    automata
    0 references
    provenance
    0 references
    circuits
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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