Abstract
This chapter considers the computational complexity of evaluating constraint queries. Section 25.1 describes Turing machines, which form a simple model of computation. Section 25.2 reviews the most important complexity classes and complexity measures. Section 25.3 discusses the computational complexity of Datalog. Section 25.4 discusses the computational complexity of relational algebra.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer-Verlag London
About this chapter
Cite this chapter
Revesz, P. (2010). Computational Complexity. In: Introduction to Databases. Texts in Computer Science. Springer, London. https://doi.org/10.1007/978-1-84996-095-3_25
Download citation
DOI: https://doi.org/10.1007/978-1-84996-095-3_25
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-84996-094-6
Online ISBN: 978-1-84996-095-3
eBook Packages: Computer ScienceComputer Science (R0)