MATEC Web Conf.
Volume 76, 201620th International Conference on Circuits, Systems, Communications and Computers (CSCC 2016)
|Number of page(s)||8|
|Published online||21 October 2016|
Employing finite-state machines in data integrity problems
Department of Applied Information Science, North-Caucasus Federal University. 1, Pushkin Street, Stavropol, Russian Federation.
a Corresponding author: AMalikov@ncfu.ru
This paper explores the issue of group integrity of tuple subsets regarding corporate integrity constraints in relational databases. A solution may be found by applying the finite-state machine theory to guarantee group integrity of data. We present a practical guide to coding such an automaton. After creating SQL queries to manipulate data and control its integrity for real data domains, we study the issue of query performance, determine the level of transaction isolation, and generate query plans.
Key words: database / integrity / finite-state machine / finite-state automaton / directed graph / SQL query
© The Authors, published by EDP Sciences, 2016
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.