RUS  ENG
Full version
JOURNALS // Fundamentalnaya i Prikladnaya Matematika // Archive

Fundam. Prikl. Mat., 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.

UDC: 004.421.2:519.178


 English version:
Journal of Mathematical Sciences (New York), 2020, 245:2, 197–201

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024