(сетевой с №3-2015)
(сетевой с №2-2015)
|Articles and journals | Tariffs | Payments | Your profile|
The algorithm development for the accelerated information suppression in large data storages.
Abstract.This article concerns the issue of improving performance when processing large amounts of information in data warehouses (storages). The main purpose is to increase the speed of the process of wiping out information in the cache of data warehouses, and, consequently to improve the processing speed of the cached data. The subject of research involves the algorithms of data extortion LRU1 and LRU2, as well as and structural organization of the control table. The article proposes the implementation of algorithms for wiping out information in the data warehouse cache on the basis of an associative data array. The results of a comparative analysis of the basic algorithms of information displacement used in the operational memory of computer systems (LRU, LFU, FIFO, Random) are presented in this article. The results of the development of algorithms for accelerated information extrusion in the cache of data warehouses are also presented. The author construes the systems of canonical equations for these algorithms are. The mathematical model, which is used by the author, is an executable formalized specification allowing for a direct transition from the DCS (the system of canonical equations) to the further hardware or software implementation of the proposed algorithms.
Keywords: systems of canonical equations, storages, caching, data wiping algorithms, LRU algorithm, MRU algorithm, ARC algorithm, data processing, automatic models, data storage
Article was received:11-08-2017
This article written in Russian. You can find full text of article in Russian here .