On the complexity of database queries
From MaRDI portal
Publication:1307689
Recommendations
Cites work
- scientific article; zbMATH DE number 3974318 (Why is no real title available?)
- scientific article; zbMATH DE number 1222098 (Why is no real title available?)
- scientific article; zbMATH DE number 1142327 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- Color-coding
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
- Graph minors. XIII: The disjoint paths problem
- Nondeterminism within $P^ * $
- On conjunctive queries containing inequalities
- On limited nondeterminism and the complexity of the V-C dimension
Cited in
(48)- On finding short resolution refutations and small unsatisfiable subsets
- Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits
- An algorithm for handling many relational calculus queries efficiently.
- On the complexity of resilience for aggregation queries
- scientific article; zbMATH DE number 7561480 (Why is no real title available?)
- On the Computational Power of Querying the History
- On the expression complexity of equivalence and isomorphism of primitive positive formulas
- The parameterized complexity of dependency detection in relational databases
- The hardness of resilience for nested aggregation query
- scientific article; zbMATH DE number 4043316 (Why is no real title available?)
- Conjunctive query evaluation by search-tree revisited
- Transducing Markov sequences
- The parameterized complexity and kernelization of resilience for database queries
- On the number of databases and closure operations
- scientific article; zbMATH DE number 4058873 (Why is no real title available?)
- scientific article; zbMATH DE number 2020203 (Why is no real title available?)
- Constraint satisfaction with bounded treewidth revisited
- The complexity of tree automata and XPath on grammar-compressed trees
- On the expressive power of database queries with intermediate types
- Approximately counting answers to conjunctive queries with disequalities and negations
- On the complexity of query result diversification
- On the complexity of queries in the logical data model
- Approximate Query Complexity
- On the computational hardness based on linear fpt-reductions
- Parameterized complexity: the main ideas and connections to practical computing
- Characterizing tractability of simple well-designed pattern trees with projection
- Computing thejth solution of a first-order query
- Some characterizations of \(\gamma \) and \(\beta \)-acyclicity of hypergraphs
- Boolean tensor decomposition for conjunctive queries with negation
- Strong computational lower bounds via parameterized complexity
- A parametric analysis of the state-explosion problem in model checking
- Analysis parameterized algorithms on the bases of elasticity to functions complexity
- A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties
- Machine-based methods in parameterized complexity theory
- Database query processing using finite cursor machines
- Parameterized computation and complexity: a new approach dealing with NP-hardness
- The complexity of evaluating relational queries
- A more general theory of static approximations for conjunctive queries
- Enumeration complexity of conjunctive queries with functional dependencies
- A more general theory of static approximations for conjunctive queries
- Enumeration complexity of conjunctive queries with functional dependencies
- scientific article; zbMATH DE number 1735629 (Why is no real title available?)
- FPT-algorithms and their classification on the basis of elasticity
- The query complexity of certification
- Semantic acyclicity for conjunctive queries: approximations and constraints
- First-order queries on classes of structures with bounded expansion
- Expressivity and complexity of MongoDB queries
- scientific article; zbMATH DE number 4064541 (Why is no real title available?)
This page was built for publication: On the complexity of database queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1307689)
