Abstract
The emergence of concepts such as big data and internet of things lead into a situation where the data structures and repositories have become more complex. So, there should be a way to analyze such data, and organize it into a meaningful and usable form.
Relational model is widely used model for organizing data. Adjacency model is a data model that relies on adjacency between elements. Relational data can be represented by adjacency model. Moreover, the adjacency model can be visualized as a graph. This paper discusses the similarities between the models based on the previous studies and theories. Furthermore, this paper aims to strengthen and quantify the similarities between the models by utilizing the graph theory concepts.
This study reveals that the previous considerations between the relational model and the adjacency model can be backed up with graph theory. If a relational database is represented by adjacency model and visualized as a graph called adjacency relation system, the elements of relational database can be identified from the graph. The identification of the elements is based on the graph theory concepts such as walk, vertex degree, leaf vertex, and graph domination.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Wanne, M.: Adjacency relation systems. Acta Wasaensia, 60: Computer Science 1. University of Vaasa, Vaasa (1998)
Wanne, M., Linna, M.: A General Model for Adjacency. Fundamenta Informaticae 38(1-2), 39–50 (1999)
Töyli, J., Linna, M., Wanne, M.: Modeling Relational Data by the Adjacency Model. In: Proceedings of the Fourth International Conference on Enterprise Information Systems, vol. 1, pp. 301–306 (2002)
Töyli, J., Linna, M., Wanne, M.: Modeling Semistructured Data by the Adjacency Model. In: Welzer Družovec, T., Yamamoto, S., Rozman, I. (eds.) Proceedings of the Fifth Joint Conference on Knowledge-Based Software Engineering, pp. 282–290. IOS Press, Amsterdam (2002)
Töyli, J.: Modeling semistructured data by the adjacency model. University of Vaasa, Vaasa (2002)
Töyli, J.: AdSchema – a Schema for Semistructured Data. Acta Wasaensia, 157: Computer Science 5. University of Vaasa, Vaasa (2006)
Heikkinen, S., Linna, M.: The Adjacency Model and Wind Power. In: Bourkas, P.D., Halaris, P. (eds.) EuroPes 2004. Acta Press, Calgary (2004)
Nyrhilä, V., Mäenpää, T., Linna, M., Antila, E.: Information modeling in the case of distribution energy production. WSEAS Transactions on Communications 12(4), 1325–1332 (2005)
Nyrhilä, V., Mäenpää, T., Linna, M., Antila, E.: A novel information model for distribution energy production. In: Proceedings of the WSEAS Conferences: 5th WSEAS Int. Conf. on Power Systems and Electromagnetic Compatibility. WSEAS, Athens (2005)
Mäenpää, T., Nyrhilä, V.: Framework for Representing Semantic Link Network with Adjacency Relation System. In: Giannakopoulos, G., Sakas, D.P., Vlachos, D.S., Kyriaki-Manessi, D. (eds.) Proceedings of the 2nd International Conference on Integrated Information, vol. 73, pp. 438–443. Elsevier Ltd., Oxford (2013)
Mäenpää, T., Nyrhilä, V.: Visualizing and Structuring Semantic Data. International Journal of Machine Learning and Computing 3(2), 209–213 (2013)
Zadravec, M., Brodnik, A., Mannila, M., Wanne, M., Zalik, B.: A practical approach to the 2D incremental nearest-point problem suitable for different point distributions. Pattern Recognition 41(2), 646–653 (2008)
Elmasri, R., Navathe, S.B.: Fundamentals of Database Systems. Addison Wesley, Boston (2007)
Codd, E.F.: A Relational Model of Data for Large Shared Data Banks. Communications of the ACM 13(6), 377–387 (1970)
Foulds, L.R.: Graph Theory Applications. Springer, New York (1992)
Jungnickel, D.: Graphs, Networks and Algorithms. In: Becker, E., Bronstein, M., Cohen, H., Eisenbud, D., Gilman, R. (eds.) Algorithms and Computation in Mathematics, vol. 5. Springer, Berlin (2002)
Newman, M.E.J.: Networks – An Introduction. Oxford University Press, Oxford (2010)
Jungnickel, D.: Graphs, Networks and Algorithms. In: Bronstein, M., Cohen, A.M., Cohen, H., Eisenbud, D., Sturmfels, B. (eds.) Algorithms and Computation in Mathematics, 4th edn., vol. 5. Springer, Heidelberg (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Mäenpää, T., Wanne, M. (2015). Review of Similarities between Adjacency Model and Relational Model. In: Le Thi, H., Pham Dinh, T., Nguyen, N. (eds) Modelling, Computation and Optimization in Information Systems and Management Sciences. Advances in Intelligent Systems and Computing, vol 360. Springer, Cham. https://doi.org/10.1007/978-3-319-18167-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-18167-7_7
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18166-0
Online ISBN: 978-3-319-18167-7
eBook Packages: EngineeringEngineering (R0)