Testing Dependencies and Inference Rules in Databases | Sciact - Система учета научной деятельности ИМ СО РАН

Testing Dependencies and Inference Rules in Databases Научная публикация

Журнал

Automatic Control and Computer Sciences
ISSN: 0146-4116 , E-ISSN: 1558-108X

Вых. Данные

Год: 2023, Том: 57, Номер: 7, Страницы: 788-802 Страниц : 15 DOI: 10.3103/S0146411623070179

Ключевые слова

relational databases, join dependencies, inference rules, testing

Авторы

Zykin S.V. ¹

Организации

1	Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences

Информация о финансировании (1)

Омский филиал ФГБУН «Институт математики им. С.Л. Соболева СО РАН».

FWNF-2022-0016

The process of testing dependencies and inference rules can be used in two ways. First of all, testing allows verifying hypotheses about unknown inference rules. In this case, the main goal is to search for a counterexample relation that showcases the feasibility of the initial dependencies and contradicts the consequence. A found counterexample refutes the hypothesis, and the absence of a counterexample allows searching for a generalization of the rule and for conditions of its feasibility. Testing cannot be used to prove the feasibility of inference rules because generalization requires searching for universal inference conditions for each rule, which is impossible to program since even the form of these conditions is unknown. Secondly, when designing a particular database, it may be necessary to test the feasibility of a rule for which there is no theoretical justification. Such a situation can take place in the presence of anomalies in the superkey. This problem is solved by using join dependency of the inference rules. A complete system of rules (axioms) for these dependencies is yet to be found. This article discusses (1) a technique for testing inference rules through the example of join dependencies, (2) proposes a testing algorithm scheme, (3) considers some hypotheses for which there are no counterexamples or inference rules, and (4) proposes an example of testing used to search for the correct decomposition of a superkey.

Zykin S.V.
Testing Dependencies and Inference Rules in Databases
Automatic Control and Computer Sciences. 2023. V.57. N7. P.788-802. DOI: 10.3103/S0146411623070179 WOS Scopus РИНЦ OpenAlex

Зыкин С.В.
Тестирование зависимостей и правил вывода в базах данных
Моделирование и анализ информационных систем. 2022. Т.29. №3. С.210-227. DOI: 10.18255/1818-1015-2022-3-210-227 РИНЦ OpenAlex

Поступила в редакцию:	30 июл. 2022 г.
Принята к публикации:	2 сент. 2022 г.
Опубликована в печати:	21 дек. 2023 г.
Опубликована online:	27 февр. 2024 г.

Web of science:	WOS:001171290500015
Scopus:	2-s2.0-85186138610
РИНЦ:	65552430
OpenAlex:	W4392188888

БД	Цитирований
OpenAlex	1