Abstract
This paper discusses relational algebra extended by recursive relations (tables). The interpretation of the recursive table is proposed, the closure of the extended relational algebra is proved, and a new approach to modeling a physical database structure is offered that is suitable for representing complicated hierarchical data sets. It combines methods of set theory for the recursive relations within the framework of a single modeling paradigm, which allows users to define self-similar, partially self-similar, or hierarchical sets. The use of recursive relations in the definitions of self-similar objects yields representations that can be rendered at varying levels of detail or precision at run time.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Codd, E.F.: Derivability, Redundancy, and Consistency of Relations Stored in Large Data Banks. IBM Research Report RJ599, vol. 4, 12–18 (1969)
Darwen, H., Date, C.J.: The Third Manifesto. ACM SIGMOD, 1. Record 24 (1995)
Chris, J.: Date: Introduction to Database Systems, 8th edn. Addison-Wesley (2003)
Celko, J.: Trees in SQL. Some Answers to Some Common Questions About SQL Trees and Hierarchies. Intelligent Enterprise Magazine (2010)
Kyte, T.: Expert Oracle Database Architecture: 9i and 10g Programming Techniques and Solutions. Apress (2005)
Codd, E.F.: A Relational Model of Data for Large Shared Data Banks. CACM 13(6), 30–42 (1970)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sokolova, V.V., Zamyatina, O.M. (2011). Theorem about Amplification of Relational Algebra by Recursive Objects. In: Wang, Y., Li, T. (eds) Knowledge Engineering and Management. Advances in Intelligent and Soft Computing, vol 123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25661-5_72
Download citation
DOI: https://doi.org/10.1007/978-3-642-25661-5_72
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25660-8
Online ISBN: 978-3-642-25661-5
eBook Packages: EngineeringEngineering (R0)