The complexity of evaluating relational queries

DOI10.1016/S0019-9958(83)80059-XzbMath0544.68065MaRDI QIDQ3334110

Stavros S. Cosmandakis

Publication date: 1983

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

completenessenumeration problemrelational databasepolynomial-time hierarchyhardnesspolynomial transformationNPco-NPevaluation of relational queriesrelational expression

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Information storage and retrieval of data (68P20)

Related Items (2)

On the representation and querying of sets of possible worlds ⋮ A probabilistic model for assigning queries at the edge

This page was built for publication: The complexity of evaluating relational queries