scientific article; zbMATH DE number 2080462
From MaRDI portal
Publication:4473259
Recommendations
Cited in
(21)- Tree pattern query minimization
- The complexity ecology of parameters: An illustration using bounded max leaf number
- Provenance circuits for trees and treelike instances
- Computing thejth solution of a first-order query
- Weighted hypertree decompositions and optimal query plans
- Combined tractability of query evaluation via tree automata and cycluits
- The semijoin algebra and the guarded fragment
- Query evaluation via tree-decompositions
- scientific article; zbMATH DE number 1759452 (Why is no real title available?)
- Obtaining a planar graph by vertex deletion
- Structural tractability of enumerating CSP solutions
- Algorithmic uses of the Feferman-Vaught theorem
- Evaluating Datalog via tree automata and cycluits
- Interpreting Tree-to-Tree Queries
- Static analysis and query answering for incomplete data trees with constraints
- scientific article; zbMATH DE number 2086293 (Why is no real title available?)
- The monadic second-order logic evaluation problem on finite colored trees: a database-theoretic approach
- Computer Science Logic
- Logic, languages, and rules for web data extraction and reasoning over data
- Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width.
- Conjunctive query evaluation by search-tree revisited
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4473259)
