Russian Federation
Izucheno odno iz aktual'nyh napravleniy v oblasti bol'shih dannyh – obrabotka mnogomernoy informacii. Rassmotrena odna iz vozmozhnyh struktur dannyh – mnogomernaya piramida, kotoraya pozvolyaet vypolnyat' mnogie operacii nad dannymi so slozhnost'yu O(1) libo O(logn). Privedeny opisanie, analiz i ocenka effektivnosti mnogomernoy piramidy.
mnogomernaya piramida, bazovye operacii, raznovidnosti k-d piramid, uluchshenie k-d piramid, bol'shaya razmernost' dannyh
1. Gulakov, V.K. Mnogomernye struktury dannyh: monografiya / V.K. Gulakov, A.O. Trubakov. - Bryansk: BGTU, 2010. - 387 s.
2. Gulakov, V.K. Sokraschenie razmernosti dannyh metodom singulyarnogo razlozheniya / V.K. Gulakov, V.N. Matyushin // Informacionnye tehnologii. Radioelektronika. Telekommunikacii (ITRT-2012): sb. st. II mezhdunar. zaoch. nauch.-tehn. konf. / Povolzh. gos. un-t servisa. - Tol'yatti: Izd-vo PVGUS, 2012. - Ch. 1. - S. 415-422.
3. Kormen, T.X. Algoritmy: postroenie i analiz: [per. s angl.] / T.X. Kormen, Ch.I. Leyzerson, R. Rivest, K. Shtayn. - 2-e izd. - M.: Vil'yamc, 2005. - 1296 s.
4. Atkinson, M. Min-Max Heaps and Generalized Priority Queues / M. Atkinson, J. Sack, N. Santoro, T. Strothotte // ACM. - 1986. - Vol. 29. - S. 996-1000.
5. Ding, Y. The Relaxed Min-Max Heap: A Mergeable Double-Ended Priority Queue / Y. Ding, M.A. Weiss //Acta Informatica. - 1993. - Vol. 30.
6. Ding, Y. Efficient Implementations of Multi-dimensional Priority Queues / Y. Ding, M.A. Weiss // School of Computer Science. - Florida International University, 1993.
7. Ding, Y. The K-D heap: an efficient multi-dimensional priority queue / Y. Ding, M.A. Weiss // Proc. 3rd Workshop on Algorithms and Data Structures. Lecture Notes in Computer Science. - 1993. - Vol. 709. - C. 302-313.
