Version Management of Hierarchical Data in Relational Database
- 535 Downloads
Hierarchical data structure is organized into a tree-like structure represented by parent- child relationship. The parent can have many children but each child has only one parent. It is also known as one-to-many relationship. There are many types of data can be represented by hierarchical data structure such as organization structures and programs in academies. In some applications, there is necessary to keep historical data or version that need to be used. Temporal data management is used to handle historical data but cause high data space usage by storing every version data which decrease database efficiency. In this paper, we propose logical design to manage versions of hierarchical data in relational database that that may change overtime but historical data is still needed by reusing duplicated records. This conceptual design can avoid data redundancy and increase database efficiency.
Keywordshierarchical data structure relational database version management temporal data management
Unable to display preview. Download preview PDF.
- 1.Celko, J.: Joe Celko’s Tree and Hierarchies in SQL for Smarties. Morgan Kaufmann, San Francisco (2004)Google Scholar
- 4.Güting, R.H., Schneider, M.: Moving Objects Databases. Morgan Kaufmann, San Francisco (2005)Google Scholar
- 6.Johnston, T., Weis, R.: Managing Time in Relational Databases: How to Design, Update and Query Temporal Data. Morgan Kaufmann, Burlington (2010)Google Scholar
- 7.Karwin, B.: SQL Antipatterns Avoiding the Pitfalls of Database Programming. Pragmatic Bookshelf (2010)Google Scholar
- 9.Snodgrass, R.T.: Developing Time-Oriented Database Application in SQL. Morgan Kaufmann, San Francisco (2000)Google Scholar
- 10.Zikopoulos, P., Baklarz, G., Huras, M., Rjaibi, W., McInnis, D., Nicola, M., Katsnelson, L.: Warp Speed, Time Travel, Big Data, and More; DB2 For Linux, UNIX, and Windows New Feature. McGraw-Hill (2012)Google Scholar