A method of presenting sets of sequences.
Dorokhina G.V. Pavlysh V.N.
The data in many data-processing systems can be represented as a series. We propose the way of presentation of sets of similar elements of the sequences by their designation. It allows the management of strings as string variables. The traditional method for representation of a dictionary of strings as an ordered set (the representation of the dictionary of strings for storing) and the method of representation of the dictionary of strings as a digital search tree (representation of the dictionary of strings for searching). On this basis, we developed a method of presenting a dictionary of strings for storing and searching. It enables to analyze the common initial parts of strings of dictionary once. It also performs the operation "activation" of strings of dictionary. In addition, the developed method is an alternative to the simultaneous using of two formally described representations, that allows to reduce memory costs. The application of the developed method of presentation of a dictionary of a strings for storing and searching in computer programs. Keywords: data representation, storing of data, high-speed search, advanced digital search tree, sequences, time series.
