Enumeration complexity of conjunctive queries with functional dependencies
type: Item
instance of: scholarly article
title: Enumeration complexity of conjunctive queries with functional dependencies
zbMATH Open document ID: 1446.68052
author: Nofar Carmeli
author: Markus Kröll
published in: Theory of Computing Systems
publication date: 2020-07-02T00:00:00Z
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/8598/
Mathematics Subject Classification ID: 68P15
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 7217008
zbMATH Keywords: enumeration
zbMATH Keywords: complexity
zbMATH Keywords: conjunctive queries
zbMATH Keywords: functional dependencies
MaRDI profile type: Publication
OpenAlex ID: W2967222032
cites work: Q4598262
cites work: On Acyclic Conjunctive Queries and Constant Delay Enumeration
cites work: On the Desirability of Acyclic Database Schemes
cites work: Q3174897
cites work: Incremental delay enumeration: space and time
cites work: Q3305356
cites work: A complexity theory for hard enumeration problems
cites work: Query evaluation via tree-decompositions
cites work: Sorting, linear time and the satisfiability problem
cites work: Powers of tensors and fast matrix multiplication
cites work: Q4607968
cites work: On the complexity of database queries
cites work: Q3174913
Wikidata QID: Q127365199
DOI: 10.1007/S00224-019-09937-9
Recommended article: Q3305356
Recommended article: The complexity of acyclic conjunctive queries
Recommended article: Computing Supports of Conjunctive Queries on Relational Tables with Functional Dependencies
Recommended article: Entropy Bounds for Conjunctive Queries with Functional Dependencies
Recommended article: Structural tractability of counting of solutions to conjunctive queries
Recommended article: Parameterized complexity of completeness reasoning for conjunctive queries
Recommended article: Theory and Applications of Satisfiability Testing
Recommended article: Semantically Acyclic Conjunctive Queries under Functional Dependencies
Recommended article: Complexity of Default Logic on Generalized Conjunctive Queries
Recommended article: On the complexity of join dependencies
description: scientific article; zbMATH DE number 7217008