|
Fundamentalnaya i Prikladnaya Matematika, 2016, Volume 21, Issue 4, Pages 125–132
(Mi fpm1750)
|
|
|
|
Data compression in big graph warehouse
I. V. Polyakov, A. A. Chepovskiy, A. M. Chepovskiy National Research University “The Higher School of Economics,” Moscow, Russia
Abstract:
In this paper, we propose an approach for compact storage of big graphs. We propose preprocessing algorithms for graphs of a certain type, which can significantly increase the data density on the disk and increase performance for basic operations with graphs.
Citation:
I. V. Polyakov, A. A. Chepovskiy, A. M. Chepovskiy, “Data compression in big graph warehouse”, Fundam. Prikl. Mat., 21:4 (2016), 125–132; J. Math. Sci., 245:2 (2020), 197–201
Linking options:
https://www.mathnet.ru/eng/fpm1750 https://www.mathnet.ru/eng/fpm/v21/i4/p125
|
Statistics & downloads: |
Abstract page: | 277 | Full-text PDF : | 139 | References: | 50 |
|