Abstract
In this chapter, we discuss several questions of database theory which are related to the database model defined in the previous chapter. The discussion is based on the definition given in § 2 of that chapter, and as a rule, we restrict the consideration to the particular case where the *-automaton (F, Q, R) has its origin in the subautomaton (F, U, R) of some AtmD. The algebra of input queries Q is the result of compression of the universal algebra U, and the components α and γ in the representation p = (α,β,γ) are trivial. In this particular case we shall speak of a concrete database; and as for an abstract database, it is one with a non-trivial representation p.
This is a preview of subscription content, log in via an institution to check access.
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
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Plotkin, B. (1994). Equivalence and Reorganization of Databases. In: Universal Algebra, Algebraic Logic, and Databases. Mathematics and Its Applications, vol 272. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-0820-1_14
Download citation
DOI: https://doi.org/10.1007/978-94-011-0820-1_14
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-4352-6
Online ISBN: 978-94-011-0820-1
eBook Packages: Springer Book Archive