|
Intelligent systems. Theory and applications, 2016, Volume 20, Issue 1, Pages 223–254
(Mi ista144)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Lowest possible degree of branching information graph of radius visibility one that supports arbitrary query stream to a dynamic database
A. A. Pletnev Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
Abstract:
This work considers dynamic task of searching identical objects. In this work it is shown that there is final multiple state machines dynamic information graph (MDIG) with a radius of visibility one and with degree of branching two the processing arbitary stream of requests. This the lowest possible MDIG with a radius of visibility one, solves the problem.
Keywords:
Dynamic Databases, Information Graph, State Machine, Flow of Requests.
Citation:
A. A. Pletnev, “Lowest possible degree of branching information graph of radius visibility one that supports arbitrary query stream to a dynamic database”, Intelligent systems. Theory and applications, 20:1 (2016), 223–254
Linking options:
https://www.mathnet.ru/eng/ista144 https://www.mathnet.ru/eng/ista/v20/i1/p223
|
Statistics & downloads: |
Abstract page: | 68 | Full-text PDF : | 31 |
|