Employing finite-state machines in data integrity problems

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. Aft...

Full description

Bibliographic Details
Main Authors: Malikov Andrey, Voronkin Vladimir, Shiryaev Nikolay
Format: Article
Language:English
Published: EDP Sciences 2016-01-01
Series:MATEC Web of Conferences
Subjects:
Online Access:http://dx.doi.org/10.1051/matecconf/20167604017
_version_ 1818352129034682368
author Malikov Andrey
Voronkin Vladimir
Shiryaev Nikolay
author_facet Malikov Andrey
Voronkin Vladimir
Shiryaev Nikolay
author_sort Malikov Andrey
collection DOAJ
description 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.
first_indexed 2024-12-13T18:48:43Z
format Article
id doaj.art-0988b974443f46b0ad719469c14e17ca
institution Directory Open Access Journal
issn 2261-236X
language English
last_indexed 2024-12-13T18:48:43Z
publishDate 2016-01-01
publisher EDP Sciences
record_format Article
series MATEC Web of Conferences
spelling doaj.art-0988b974443f46b0ad719469c14e17ca2022-12-21T23:35:00ZengEDP SciencesMATEC Web of Conferences2261-236X2016-01-01760401710.1051/matecconf/20167604017matecconf_cscc2016_04017Employing finite-state machines in data integrity problemsMalikov Andrey0Voronkin Vladimir1Shiryaev Nikolay2Department of Applied Information Science, North-Caucasus Federal UniversityDepartment of Applied Information Science, North-Caucasus Federal UniversityDepartment of Applied Information Science, North-Caucasus Federal UniversityThis 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.http://dx.doi.org/10.1051/matecconf/20167604017databaseintegrityfinite-state machinefinite-state automatondirected graphSQL query
spellingShingle Malikov Andrey
Voronkin Vladimir
Shiryaev Nikolay
Employing finite-state machines in data integrity problems
MATEC Web of Conferences
database
integrity
finite-state machine
finite-state automaton
directed graph
SQL query
title Employing finite-state machines in data integrity problems
title_full Employing finite-state machines in data integrity problems
title_fullStr Employing finite-state machines in data integrity problems
title_full_unstemmed Employing finite-state machines in data integrity problems
title_short Employing finite-state machines in data integrity problems
title_sort employing finite state machines in data integrity problems
topic database
integrity
finite-state machine
finite-state automaton
directed graph
SQL query
url http://dx.doi.org/10.1051/matecconf/20167604017
work_keys_str_mv AT malikovandrey employingfinitestatemachinesindataintegrityproblems
AT voronkinvladimir employingfinitestatemachinesindataintegrityproblems
AT shiryaevnikolay employingfinitestatemachinesindataintegrityproblems