Abstract
A huge amount of data is produced daily, which should be managed, handled and stored in the database. Intelligent system characteristics are mostly based on storing data over the time with regards to validity. The core of the system is therefore framed by the temporal database, which offers the possibility for data analysis, decision making or creating future prognoses. None of the data should be stored indefinitely, effective data management is an inevitable part. This paper references historical background and temporal evolution with emphasis on various granularity modeling and managing describes index structure types used in database approaches covering access paths taken out by optimizer techniques. The main contribution of this paper is Flower Index Approach, which aim is to eliminate the impact of database High Water Mark if Full Table Scan access method is used. Thanks to that, we can optimize costs, reduce processing time and increase performance, which is also supported by experiment comparisons.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Aibin, M., Walkowiak, K.: Defragmentation algorithm for joint dynamic and static routing problems in elastic optical networks with unicast and anycast traffic. In: 2016 International Conference on Computing, Networking and Communications (ICNC) (2016)
Arora, S.: A comparative study on temporal database models: a survey (2015)
Ahsan, K., Vijay, P.: Temporal Databases: Information Systems. Booktango, Bloomington (2014)
Claramunt, Ch., Schneider, M., Wong, R.C.-W., Xiong, L., Loh, W.-K., Shahabi, C., Li, K.-J. (eds.): SSTD 2015. LNCS, vol. 9239. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-22363-6
Chomicki, J., Wihsen, J.: Consistent query answering for atemporal constraints over temporal databases (2016)
Goevert, K., Cloutier, R., Roth, M., Lindemann, U.: Concept of system architecture database analysis. In: 2016 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM) (2016)
Johnston, T.: Bi-temporal Data – Theory and Practice. Morgan Kaufmann, San Francisco (2014)
Karima, T., Abdellatif, A., Ounalli, H.: Data mining based fragmentation technique for distributed data warehouses environment using predicate construction technique. In: The 6th International Conference on Networked Computing and Advanced Information Management (2010)
Kvet, M., Matiaško, K.: Transaction management. In: 9th Iberian Conference on Information Systems and Technologies (CISTI) 2014, Barcelona (2014)
Kvet, M., Matiaško, K.: Temporal transaction integrity constraints management. Cluster Comput. 20(1), 673–688 (2017)
Pedrozo, W., Vaz, M.: A tool for automatic index selection in database management systems. In: 2014 International Symposium on Computer, Consumer and Control (2014)
Tuzhilin, A.: Using Temporal Logic and Datalog to Query Databases Evolving in Time. Forgotten Books, London (2017)
Acknowledgment
This publication is the result of the project implementation:
Centre of excellence for systems and services of intelligent transport, ITMS 26220120028 supported by the Research & Development Operational Programme funded by the ERDF and Centre of excellence for systems and services of intelligent transport II., ITMS 26220120050 supported by the Research & Development Operational Programme funded by the ERDF.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Kvet, M., Matiasko, K. (2018). Temporal Flower Index Eliminating Impact of High Water Mark. In: Hodoň, M., Eichler, G., Erfurth, C., Fahrnberger, G. (eds) Innovations for Community Services. I4CS 2018. Communications in Computer and Information Science, vol 863. Springer, Cham. https://doi.org/10.1007/978-3-319-93408-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-93408-2_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-93407-5
Online ISBN: 978-3-319-93408-2
eBook Packages: Computer ScienceComputer Science (R0)