Lowest possible degree of branching
information graph of radius visibility one
that supports arbitrary query stream to a
dynamic database
А. А. Pletnev
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, Parallel Data Processing.
254