{"id":53906,"date":"2019-12-13T00:00:00","date_gmt":"2019-12-12T21:00:00","guid":{"rendered":"https:\/\/prohoster.info\/blog\/blog_prohoster\/skorostnaya-otkazoustojchivaya-kompressiya-prodolzhenie"},"modified":"2020-02-18T14:01:51","modified_gmt":"2020-02-18T11:01:51","slug":"skorostnaya-otkazoustojchivaya-kompressiya-prodolzhenie","status":"publish","type":"post","link":"https:\/\/prohoster.info\/cs\/blog\/administrirovanie\/skorostnaya-otkazoustojchivaya-kompressiya-prodolzhenie","title":{"rendered":"Rychl\u00e1 a odoln\u00e1 komprese (pokra\u010dov\u00e1n\u00ed)","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"<p>Tento \u010dl\u00e1nek je druh\u00fd v s\u00e9rii o rychl\u00e9 kompresi dat. V prvn\u00edm \u010dl\u00e1nku byl pops\u00e1n kompresor pracuj\u00edc\u00ed rychlost\u00ed 10 GB\/s na jedno procesorov\u00e9 j\u00e1dro (minim\u00e1ln\u00ed komprese, RTT-Min). <\/p>\n<p>Tento kompresor byl ji\u017e implementov\u00e1n do za\u0159\u00edzen\u00ed kriminalistick\u00fdch duplik\u00e1tor\u016f pro rychlou kompresi dumping\u016f informa\u010dn\u00edch m\u00e9di\u00ed a pos\u00edlen\u00ed odolnosti kriptografie; m\u016f\u017ee b\u00fdt tak\u00e9 pou\u017eit pro kompresi obraz\u016f virtu\u00e1ln\u00edch stroj\u016f a swapov\u00fdch soubor\u016f opera\u010dn\u00ed pam\u011bti p\u0159i jejich ukl\u00e1d\u00e1n\u00ed na vysoce v\u00fdkonn\u00fdch SSD disc\u00edch.<\/p>\n<p>V prvn\u00edm \u010dl\u00e1nku byla tak\u00e9 ozn\u00e1mena v\u00fdvoj algoritmu komprese pro kompresi z\u00e1loh HDD a SSD disk\u016f (st\u0159edn\u00ed komprese, RTT-Mid) s podstatn\u011b vylep\u0161en\u00fdmi parametry komprese. V sou\u010dasnosti je tento kompresor pln\u011b p\u0159ipraven a tento \u010dl\u00e1nek se na n\u011bj zam\u011b\u0159uje. <br \/>\n<noindex><a rel=\"nofollow\" name=\"habracut\"><\/a><\/noindex><br \/>\nKompresor, kter\u00fd implementuje algoritmus RTT-Mid, zaji\u0161\u0165uje m\u00edru komprese srovnatelnou se standardn\u00edmi archiv\u00e1tory jako WinRar, 7-Zip, kter\u00e9 pracuj\u00ed v rychl\u00e9m re\u017eimu. P\u0159itom jeho rychlost pr\u00e1ce je minim\u00e1ln\u011b o po\u0159\u00e1dek vy\u0161\u0161\u00ed. <\/p>\n<p>Rychlost balen\u00ed\/rozbalov\u00e1n\u00ed dat je kritick\u00fdm parametrem ur\u010duj\u00edc\u00edm oblast pou\u017eit\u00ed technologi\u00ed komprese. Nev\u00edm, kdo by m\u011bl na mysli komprimovat terabajt dat rychlost\u00ed 10-15 megabajt\u016f za sekundu (pr\u00e1v\u011b tato rychlost archiva\u010dn\u00edch program\u016f v standardn\u00edm re\u017eimu komprese), nebo\u0165 to by trvalo t\u00e9m\u011b\u0159 dvacet hodin p\u0159i pln\u00e9m vyu\u017eit\u00ed procesoru\u2026<\/p>\n<p>Na druh\u00e9 stran\u011b m\u016f\u017ee b\u00fdt stejn\u00fd terabajt zkop\u00edrov\u00e1n rychlostmi okolo 2-3 gigabajt\u016f za sekundu za deset minut. <\/p>\n<p>Proto je komprese velk\u00e9ho objemu informac\u00ed relevantn\u00ed, pokud se prov\u00e1d\u00ed rychlost\u00ed, kter\u00e1 nen\u00ed ni\u017e\u0161\u00ed ne\u017e rychlost re\u00e1ln\u00e9ho vstupu\/v\u00fdstupu. Pro modern\u00ed syst\u00e9my to znamen\u00e1 alespo\u0148 100 megabajt\u016f za sekundu. <\/p>\n<p>Takov\u00e9 rychlosti mohou modern\u00ed kompresory dosahovat pouze v re\u017eimu \u201efast\u201c. V tomto aktu\u00e1ln\u00edm re\u017eimu budeme porovn\u00e1vat algoritmus RTT-Mid s tradi\u010dn\u00edmi kompresory.<\/p>\n<h4>Srovn\u00e1vac\u00ed testov\u00e1n\u00ed nov\u00e9ho algoritmu komprese<\/h4>\n<p>\n Kompresor RTT-Mid fungoval v r\u00e1mci testovac\u00edho programu. V re\u00e1ln\u00e9 \u201epracovn\u00ed\u201c aplikaci pracuje v\u00fdrazn\u011b rychleji, nebo\u0165 je zde zdatn\u011b vyu\u017e\u00edv\u00e1na v\u00edcevl\u00e1knov\u00e1 architektura a pou\u017e\u00edv\u00e1 se \u201enorm\u00e1ln\u00ed\u201c kompil\u00e1tor, nikoliv C#. <\/p>\n<p>Jeliko\u017e srovn\u00e1van\u00e9 kompresory funguj\u00ed na r\u016fzn\u00fdch principech a r\u016fzn\u00fdch typech dat se komprimuje r\u016fzn\u011b, pro objektivitu testu byla pou\u017eita metoda m\u011b\u0159en\u00ed \u201epr\u016fm\u011brn\u00e9 teploty po nemocnici\u201c\u2026<\/p>\n<p>Byl vytvo\u0159en soubor se sektorov\u00fdm dumpem logick\u00e9ho disku s opera\u010dn\u00edm syst\u00e9mem Windows 10, co\u017e je nejp\u0159irozen\u011bj\u0161\u00ed sm\u011bs r\u016fzn\u00fdch datov\u00fdch struktur, kter\u00e1 se vyskytuje na ka\u017ed\u00e9m po\u010d\u00edta\u010di. Komprese tohoto souboru umo\u017en\u00ed porovn\u00e1n\u00ed rychlosti a m\u00edry komprese nov\u00e9ho algoritmu s nejpokro\u010dilej\u0161\u00edmi kompresory pou\u017e\u00edvan\u00fdmi v modern\u00edch archiva\u010dn\u00edch n\u00e1stroj\u00edch.<\/p>\n<p>Toto je soubor dumpu:<\/p>\n<p><img decoding=\"async\" alt=\"Rychl\u00e1 a odoln\u00e1 komprese (pokra\u010dov\u00e1n\u00ed)\" src=\"\/wp-content\/uploads\/2019\/12\/39fc5bfe9812ac2417d6eb8ef1dde0a8.png\" style=\"display:block;margin: 0 auto;\" \/><br \/>\n<br \/>\nSoubor dumpu byl komprimov\u00e1n kompresory RTT-Mid, 7-zip a WinRar. Kompresor WinRar a 7-zip byly nastaveny na maxim\u00e1ln\u00ed pracovn\u00ed rychlost.<\/p>\n<p>Kompresor pracuje <b>7-zip<\/b>:<\/p>\n<p><img decoding=\"async\" alt=\"Rychl\u00e1 a odoln\u00e1 komprese (pokra\u010dov\u00e1n\u00ed)\" src=\"\/wp-content\/uploads\/2019\/12\/1b088a99fb7b04d5b6ccb500ff74c73e.png\" style=\"display:block;margin: 0 auto;\" \/><br \/>\n<br \/>\nZat\u011b\u017euje procesor na 100 %, p\u0159i\u010dem\u017e pr\u016fm\u011brn\u00e1 rychlost \u010dten\u00ed zdrojov\u00e9ho dumpu je p\u0159ibli\u017en\u011b 60 MegaBajt\u016f\/sec.<\/p>\n<p>Kompresor pracuje <b>WinRar<\/b>:<\/p>\n<p><img decoding=\"async\" alt=\"Rychl\u00e1 a odoln\u00e1 komprese (pokra\u010dov\u00e1n\u00ed)\" src=\"\/wp-content\/uploads\/2019\/12\/462024e8304a90a885ef3857fbd119e1.png\" style=\"display:block;margin: 0 auto;\" \/><br \/>\n<br \/>\nSituace je obdobn\u00e1, zat\u00ed\u017een\u00ed procesoru t\u00e9m\u011b\u0159 100 %, pr\u016fm\u011brn\u00e1 rychlost \u010dten\u00ed dumpu p\u0159ibli\u017en\u011b 125 MegaBajt\u016f\/sec.<\/p>\n<p>Stejn\u011b jako v p\u0159edchoz\u00edm p\u0159\u00edpad\u011b je rychlost pr\u00e1ce archiva\u010dn\u00edho n\u00e1stroje omezena mo\u017enostmi procesoru.<\/p>\n<p>Nyn\u00ed pracuje testovac\u00ed program kompresoru <b>RTT-Mid<\/b>:<\/p>\n<p><img decoding=\"async\" alt=\"Rychl\u00e1 a odoln\u00e1 komprese (pokra\u010dov\u00e1n\u00ed)\" src=\"\/wp-content\/uploads\/2019\/12\/f46fabcbb362dcf99a8b55877954c3a8.png\" style=\"display:block;margin: 0 auto;\" \/><br \/>\n<br \/>\nScreenshot ukazuje, \u017ee procesor je zat\u00ed\u017een na 50 % a zbytek \u010dasu je ne\u010dinn\u00fd, proto\u017ee nem\u00e1 kam uvolnit komprimovan\u00e1 data. Disk pro uvoln\u011bn\u00ed dat (Disk 0) je t\u00e9m\u011b\u0159 pln\u011b zat\u00ed\u017een. Rychlost \u010dten\u00ed dat (Disk 1) siln\u011b kol\u00eds\u00e1, ale v pr\u016fm\u011bru je p\u0159es 200 MegaBajt\u016f\/sec.<\/p>\n<p>Rychlost pr\u00e1ce kompresoru je v tomto p\u0159\u00edpad\u011b omezena mo\u017enost\u00ed z\u00e1pisu komprimovan\u00fdch dat na Disk 0.<\/p>\n<p>Nyn\u00ed m\u00edra komprese z\u00edskan\u00fdch archiv\u016f:<\/p>\n<p><img decoding=\"async\" alt=\"Rychl\u00e1 a odoln\u00e1 komprese (pokra\u010dov\u00e1n\u00ed)\" src=\"\/wp-content\/uploads\/2019\/12\/1e0740937909c6a5860ef35d15da9e7f.png\" style=\"display:block;margin: 0 auto;\" \/><br \/>\n<br \/>\n<img decoding=\"async\" alt=\"Rychl\u00e1 a odoln\u00e1 komprese (pokra\u010dov\u00e1n\u00ed)\" src=\"\/wp-content\/uploads\/2019\/12\/6e74c8ceab741943a59eca87f092e25b.png\" style=\"display:block;margin: 0 auto;\" \/><br \/>\n<br \/>\n<img decoding=\"async\" alt=\"Rychl\u00e1 a odoln\u00e1 komprese (pokra\u010dov\u00e1n\u00ed)\" src=\"\/wp-content\/uploads\/2019\/12\/3b2f8bed83ea72917f87a3a9813294fc.png\" style=\"display:block;margin: 0 auto;\" \/><br \/>\n<br \/>\nJe z\u0159ejm\u00e9, \u017ee kompresor RTT-Mid si vedl nejl\u00e9pe v kompresi, arch\u00edv, kter\u00fd vytvo\u0159il, je o 1,3 GigaBajtu men\u0161\u00ed ne\u017e arch\u00edv WinRar a o 2,1 GigaBajtu men\u0161\u00ed ne\u017e arch\u00edv 7z.<\/p>\n<p>\u010cas pot\u0159ebn\u00fd na vytvo\u0159en\u00ed archivu:<\/p>\n<ul>\n<li> 7-zip \u2013 26 minut 10 sekund;<\/li>\n<li> WinRar \u2013 17 minut 40 sekund;<\/li>\n<li> RTT-Mid \u2013 7 minut 30 sekund.<\/li>\n<\/ul>\n<p>\nTak\u017ee i testovac\u00ed, neoptimalizovan\u00fd program, pou\u017e\u00edvaj\u00edc\u00ed algoritmus RTT-Mid, dok\u00e1zal vytvo\u0159it arch\u00edv v\u00edce ne\u017e dvakr\u00e1t a p\u016flkr\u00e1t rychleji, p\u0159i\u010dem\u017e arch\u00edv byl v\u00fdrazn\u011b men\u0161\u00ed ne\u017e u konkurent\u016f\u2026<\/p>\n<p>Ti, kdo nev\u011b\u0159\u00ed screenshot\u016fm, si mohou ov\u011b\u0159it jejich pravost sami. Testovac\u00ed program je k dispozici na <noindex><a rel=\"nofollow\" href=\"https:\/\/yadi.sk\/d\/9CkY30b1lRcLYw\">odkazu<\/a><\/noindex>, st\u00e1hn\u011bte si jej a ov\u011b\u0159te.<\/p>\n<p>Ale pouze na procesorech s podporou AVX-2, bez podpory t\u011bchto instrukc\u00ed kompresor nefunguje a netestujte algoritmus na star\u0161\u00edch procesorech AMD, t\u011bch je pomal\u00e9 v \u010d\u00e1sti prov\u00e1d\u011bn\u00ed p\u0159\u00edkaz\u016f AVX\u2026<\/p>\n<h4>Pou\u017eit\u00e1 metoda komprese<\/h4>\n<p>\nV algoritmu se pou\u017e\u00edv\u00e1 metoda indexace opakuj\u00edc\u00edch se fragment\u016f textu v bajtov\u00e9 granulaci. Tento zp\u016fsob komprese je zn\u00e1m\u00fd ji\u017e dlouho, ale nebyl pou\u017e\u00edv\u00e1n, proto\u017ee operace vyhled\u00e1v\u00e1n\u00ed shod byla velmi n\u00e1kladn\u00e1 na pot\u0159ebn\u00e9 zdroje a vy\u017eadovala mnohem v\u00edce \u010dasu ne\u017e vytv\u00e1\u0159en\u00ed slovn\u00edku. Tak\u017ee algoritmus RTT-Mid je klasick\u00fdm p\u0159\u00edkladem pohybu \"zp\u00e1tky do budoucnosti\"\u2026<\/p>\n<p>V kompresoru RTT se pou\u017e\u00edv\u00e1 unik\u00e1tn\u00ed rychlostn\u00ed skener pro vyhled\u00e1v\u00e1n\u00ed shod, kter\u00fd umo\u017enil urychlit proces komprese. Skener vyroben\u00fd na zak\u00e1zku, to je \"moje vz\u00e1cnost\u2026\", \"cena je nemal\u00e1, proto\u017ee je zcela ru\u010dn\u00ed v\u00fdroba\" (napsan\u00fd v assembleru).<\/p>\n<p>Skener pro vyhled\u00e1v\u00e1n\u00ed shod funguje na z\u00e1klad\u011b dvoustup\u0148ov\u00e9ho pravd\u011bpodobnostn\u00edho sch\u00e9matu, nejprve se skenuje p\u0159\u00edtomnost \"znaku\" shody, a teprve po zji\u0161t\u011bn\u00ed \"znaku\" na tomto m\u00edst\u011b se spou\u0161t\u00ed procedura detekce skute\u010dn\u00e9 shody. <\/p>\n<p>Okno pro hled\u00e1n\u00ed shod m\u00e1 nep\u0159edv\u00eddatelnou velikost, kter\u00e1 z\u00e1vis\u00ed na m\u00ed\u0159e entropie v zpracov\u00e1van\u00e9m bloku dat. Pro zcela n\u00e1hodn\u00e1 (nekomprimovateln\u00e1) data m\u00e1 velikost megabajtu, pro data s opakov\u00e1n\u00edmi m\u00e1 v\u017edy velikost v\u011bt\u0161\u00ed ne\u017e megabajt.<\/p>\n<p>Ale mnoh\u00e9 modern\u00ed datov\u00e9 form\u00e1ty jsou nekomprimovateln\u00e9 a \"pou\u0161t\u011bt\" skrze n\u011b zdroje n\u00e1ro\u010dn\u00fd skener je zbyte\u010dn\u00e9 a pl\u00fdtv\u00e1n\u00ed, proto se ve skeneru pou\u017e\u00edvaj\u00ed dva re\u017eimy pr\u00e1ce. Nejprve se hledaj\u00ed \u010d\u00e1sti p\u016fvodn\u00edho textu s mo\u017en\u00fdmi opakov\u00e1n\u00edmi, tato operace se prov\u00e1d\u00ed tak\u00e9 pravd\u011bpodobnostn\u00edm zp\u016fsobem a prov\u00e1d\u00ed se velmi rychle (p\u0159i rychlosti 4-6 Gigabajt\u016f\/s). Pot\u00e9 se \u010d\u00e1sti s mo\u017en\u00fdmi shodami zpracov\u00e1vaj\u00ed hlavn\u00edm skenerem. <\/p>\n<p>Indexov\u00e9 komprese nen\u00ed p\u0159\u00edli\u0161 efektivn\u00ed, mus\u00edme nahrazovat opakuj\u00edc\u00ed se fragmenty indexy, a indexov\u00e1 matice v\u00fdrazn\u011b sni\u017euje koeficient komprese. <\/p>\n<p>Pro zv\u00fd\u0161en\u00ed stupn\u011b komprese se indexuj\u00ed nejen \u00fapln\u00e9 shody bajtov\u00fdch \u0159et\u011bzc\u016f, ale i \u010d\u00e1ste\u010dn\u00e9, kdy v \u0159et\u011bzci jsou jak shodn\u00e9, tak i neshodn\u00e9 bajty. Pro tento \u00fa\u010del je do form\u00e1tu indexu zahr\u00e1no pole masky shod, kter\u00e9 ukazuje na shodn\u00e9 bajty dvou blok\u016f. Pro je\u0161t\u011b v\u011bt\u0161\u00ed kompresi se pou\u017e\u00edv\u00e1 indexace s p\u0159ekr\u00fdv\u00e1n\u00edm n\u011bkolika \u010d\u00e1ste\u010dn\u011b shodn\u00fdch blok\u016f na aktu\u00e1ln\u00ed blok. <\/p>\n<p>To v\u0161e umo\u017enilo v kompresoru RTT-Mid dos\u00e1hnout stupn\u011b komprese srovnateln\u00e9ho s kompresory pracuj\u00edc\u00edmi na z\u00e1klad\u011b slovn\u00edkov\u00e9 metody, av\u0161ak funguj\u00edc\u00edho mnohem rychleji.<\/p>\n<h4>Rychlost nov\u00e9ho algoritmu komprese<\/h4>\n<p>\nPokud kompresor pracuje s monopoln\u00edm vyu\u017eit\u00edm pam\u011bti cache (na jeden proud je pot\u0159eba 4 MegaBajty), rychlost pr\u00e1ce se pohybuje v rozmez\u00ed 700-2000 MegaBajt\u016f\/s na jedno procesorov\u00e9 j\u00e1dro v z\u00e1vislosti na typu komprimovan\u00fdch dat a m\u00e1lo z\u00e1vis\u00ed na pracovn\u00edch frekvenc\u00edch procesoru. <\/p>\n<p>P\u0159i v\u00edcestup\u0148ov\u00e9 implementaci kompresoru se efektivn\u00ed \u0161k\u00e1lovatelnost ur\u010duje objemem mezipam\u011bti t\u0159et\u00ed \u00farovn\u011b. Nap\u0159\u00edklad p\u0159i 9 MegaBajtech mezipam\u011bti nem\u00e1 smysl spou\u0161t\u011bt v\u00edce ne\u017e dva proudy komprese, rychlost od toho vzr\u016fstat nebude. Av\u0161ak p\u0159i mezipam\u011bti o velikosti 20 MegaBajt\u016f lze ji\u017e spou\u0161t\u011bt p\u011bt proud\u016f komprese.<\/p>\n<p>Tak\u00e9 v\u00fdznamn\u00fdm parametrem ur\u010duj\u00edc\u00edm rychlost pr\u00e1ce kompresoru se st\u00e1v\u00e1 latence opera\u010dn\u00ed pam\u011bti. Algoritmus pou\u017e\u00edv\u00e1 n\u00e1hodn\u00e9 p\u0159\u00edstupy k opera\u010dn\u00ed pam\u011bti, \u010d\u00e1st z nich\u017e se nedost\u00e1v\u00e1 do mezipam\u011bti (asi 10%) a mus\u00ed \u010dekat na data z opera\u010dn\u00ed pam\u011bti, co\u017e sni\u017euje rychlost pr\u00e1ce. <\/p>\n<p>V\u00fdznamn\u011b ovliv\u0148uje rychlost kompresoru tak\u00e9 pr\u00e1ce syst\u00e9mu vstupu\/v\u00fdstupu dat. Po\u017eadavky na opera\u010dn\u00ed pam\u011b\u0165 ze vstupu\/v\u00fdstupu blokuj\u00ed p\u0159\u00edstupy k dat\u016fm ze strany CPU, co\u017e tak\u00e9 sni\u017euje rychlost komprese. Probl\u00e9m je v\u00fdznamn\u00fd pro notebooky a desktope. <a class=\"wpil_keyword_link\" href=\"https:\/\/prohoster.info\/cs\/server\/\"   title=\"servery\" data-wpil-keyword-link=\"linked\"  data-wpil-monitor-id=\"1458\">servery<\/a> Pro n\u011b je to m\u00e9n\u011b v\u00fdznamn\u00e9 d\u00edky pokro\u010dilej\u0161\u00edmu \u0159\u00eddic\u00edmu bloku p\u0159\u00edstupu k syst\u00e9mov\u00e9 sb\u011brnici a v\u00edc kan\u00e1lov\u00e9 opera\u010dn\u00ed pam\u011bti.<\/p>\n<p>V cel\u00e9m textu \u010dl\u00e1nku se hovo\u0159\u00ed o kompresi, dekomprese z\u016fst\u00e1v\u00e1 mimo r\u00e1mec tohoto \u010dl\u00e1nku, proto\u017ee tam \u201eje v\u0161echno v po\u0159\u00e1dku\u201c. Dekomprese prob\u00edh\u00e1 v\u00fdrazn\u011b rychleji a je omezena rychlost\u00ed vstupu\/v\u00fdstupu. Jedno fyzick\u00e9 j\u00e1dro v jednom vl\u00e1kn\u011b m\u016f\u017ee bez probl\u00e9m\u016f zajistit rychlosti rozbalov\u00e1n\u00ed na \u00farovni 3-4 gigabajt\u016f\/s.<\/p>\n<p>To souvis\u00ed s absenc\u00ed v procesu rozbalov\u00e1n\u00ed operace vyhled\u00e1v\u00e1n\u00ed shod, kter\u00e1 \u201espot\u0159ebov\u00e1v\u00e1\u201c hlavn\u00ed zdroje procesoru a cache pam\u011bti p\u0159i kompresi. <\/p>\n<h4>Spolehlivost uchov\u00e1v\u00e1n\u00ed komprimovan\u00fdch dat<\/h4>\n<p>\nJak vypl\u00fdv\u00e1 z n\u00e1zvu cel\u00e9 t\u0159\u00eddy softwarov\u00fdch prost\u0159edk\u016f vyu\u017e\u00edvaj\u00edc\u00edch kompresi dat (archiv\u00e1tory), jsou ur\u010deny pro dlouhodob\u00e9 uchov\u00e1v\u00e1n\u00ed informac\u00ed, ne na roky, ale na stolet\u00ed a tis\u00edcilet\u00ed\u2026<\/p>\n<p>B\u011bhem doby uchov\u00e1v\u00e1n\u00ed nosi\u010de informace ztr\u00e1cej\u00ed \u010d\u00e1st dat, tady je p\u0159\u00edklad:<\/p>\n<p><img decoding=\"async\" alt=\"Rychl\u00e1 a odoln\u00e1 komprese (pokra\u010dov\u00e1n\u00ed)\" src=\"\/wp-content\/uploads\/2019\/12\/b85564e175204e70ed7c3c3ed0fbf008.png\" style=\"display:block;margin: 0 auto;\" \/><br \/>\n<br \/>\nTomuto \u201eanalogov\u00e9mu\u201c nosi\u010di informace je tis\u00edc let, n\u011bkter\u00e9 fragmenty jsou ztraceny, ale celkov\u011b je informace \u201e\u010diteln\u00e1\u201c\u2026<\/p>\n<p>\u017d\u00e1dn\u00fd z odpov\u011bdn\u011b hospoda\u0159\u00edc\u00edch v\u00fdrobc\u016f modern\u00edch digit\u00e1ln\u00edch syst\u00e9m\u016f pro uchov\u00e1v\u00e1n\u00ed dat a digit\u00e1ln\u00edch nosi\u010d\u016f k nim neposkytuje z\u00e1ruky \u00fapln\u00e9ho zachov\u00e1n\u00ed dat d\u00e9le ne\u017e 75 let.<br \/>\nA to je probl\u00e9m, ale probl\u00e9m odlo\u017een\u00fd, \u0159e\u0161it ho budou na\u0161i potomci\u2026<\/p>\n<p>Syst\u00e9my uchov\u00e1v\u00e1n\u00ed digit\u00e1ln\u00edch dat mohou ztr\u00e1cet data nejen po 75 letech, chyby v datech se mohou objevit kdykoli, dokonce i b\u011bhem jejich z\u00e1pisu, tyto zkreslen\u00ed se sna\u017e\u00ed minimalizovat pomoc\u00ed redundantnosti a opravn\u00fdmi syst\u00e9my. Redundantnost a opravn\u00e9 syst\u00e9my mohou ztracen\u00e9 informace obnovit ne v\u017edy, a pokud je obnov\u00ed, nen\u00ed zaru\u010deno, \u017ee operace obnovy prob\u011bhla spr\u00e1vn\u011b.<\/p>\n<p>A to je tak\u00e9 velk\u00fd probl\u00e9m, ale ne odlo\u017een\u00fd, ale aktu\u00e1ln\u00ed.<\/p>\n<p>Modern\u00ed kompresory pou\u017e\u00edvan\u00e9 pro archivaci digit\u00e1ln\u00edch dat jsou postaveny na r\u016fzn\u00fdch modifikac\u00edch slovn\u00edkov\u00e9 metody a pro takov\u00e9 archivy ztr\u00e1ta fragmentu informace bude fat\u00e1ln\u00ed ud\u00e1lost\u00ed, existuje dokonce ust\u00e1len\u00fd term\u00edn pro takovou situaci \u2014 \u201epo\u0161kozen\u00fd\u201c archiv\u2026<\/p>\n<p>N\u00edzk\u00e1 spolehlivost ukl\u00e1d\u00e1n\u00ed informac\u00ed v archivech se slovn\u00edkov\u00fdm kompresn\u00edm algoritmem souvis\u00ed se strukturou komprimovan\u00fdch dat. Informace v takov\u00e9m archivu neobsahuj\u00ed p\u016fvodn\u00ed text, uchov\u00e1vaj\u00ed se tam \u010d\u00edsla z\u00e1znam\u016f ve slovn\u00edku, kter\u00fd se dynamicky modifikuje aktu\u00e1ln\u011b komprimovan\u00fdm textem. P\u0159i ztr\u00e1t\u011b nebo po\u0161kozen\u00ed fragmentu archivu nen\u00ed mo\u017en\u00e9 identifikovat \u017e\u00e1dn\u00e9 dal\u0161\u00ed z\u00e1znamy archivu ani podle obsahu, ani podle d\u00e9lky z\u00e1znamu ve slovn\u00edku, proto\u017ee nen\u00ed jasn\u00e9, co odpov\u00edd\u00e1 \u010d\u00edslu z\u00e1znamu ve slovn\u00edku.<\/p>\n<p>Obnovit informace z takov\u00e9ho \u201epo\u0161kozen\u00e9ho\u201c archivu nen\u00ed mo\u017en\u00e9.<\/p>\n<p>Algoritmus RTT je postaven na z\u00e1klad\u011b spolehliv\u011bj\u0161\u00ed metody ukl\u00e1d\u00e1n\u00ed komprimovan\u00fdch dat. Pou\u017e\u00edv\u00e1 indexovou metodu pro sledov\u00e1n\u00ed opakuj\u00edc\u00edch se fragment\u016f. Tento p\u0159\u00edstup k kompresi minimalizuje d\u016fsledky po\u0161kozen\u00ed informac\u00ed na m\u00e9diu a v mnoha p\u0159\u00edpadech automaticky opravuje po\u0161kozen\u00ed vznikl\u00e1 b\u011bhem ukl\u00e1d\u00e1n\u00ed informac\u00ed.<br \/>\nTo je d\u00e1no t\u00edm, \u017ee archivn\u00ed soubor v p\u0159\u00edpad\u011b indexov\u00e9 komprese obsahuje dv\u011b pole:<\/p>\n<ul>\n<li>pole p\u016fvodn\u00edho textu s odstran\u011bn\u00fdmi \u010d\u00e1stmi opakov\u00e1n\u00ed;<\/li>\n<li>pole index\u016f. <\/li>\n<\/ul>\n<p>\nKriticky d\u016fle\u017eit\u00e9 pro obnovu informac\u00ed, pole index\u016f, nen\u00ed velk\u00e9 co do velikosti a lze je duplikovat pro zv\u00fd\u0161en\u00ed spolehlivosti ukl\u00e1d\u00e1n\u00ed dat. Proto, i kdy\u017e dojde ke ztr\u00e1t\u011b fragmentu p\u016fvodn\u00edho textu nebo indexov\u00e9ho pole, v\u0161echny ostatn\u00ed informace budou obnoviteln\u00e9 bez probl\u00e9m\u016f, jako na obr\u00e1zku s \u201eanalogov\u00fdm\u201c nosi\u010dem informac\u00ed.<\/p>\n<h4>Nev\u00fdhody algoritmu<\/h4>\n<p>\n\u017d\u00e1dn\u00e9 v\u00fdhody nejsou bez nev\u00fdhod. Indexov\u00e1 metoda komprese nekomprimuje opakuj\u00edc\u00ed se sekvence mal\u00e9 d\u00e9lky. To souvis\u00ed s omezen\u00edmi indexov\u00e9 metody. Indexy maj\u00ed velikost nejm\u00e9n\u011b 3 bajty a mohou m\u00edt velikost a\u017e 12 bajt\u016f. Pokud se objev\u00ed opakov\u00e1n\u00ed s men\u0161\u00ed velikost\u00ed, ne\u017e jakou popisuje jeho index, nebude zohledn\u011bno, bez ohledu na to, jak \u010dasto se takov\u00e1 opakov\u00e1n\u00ed v komprimovan\u00e9m souboru vyskytuj\u00ed.<\/p>\n<p>Tradi\u010dn\u00ed, slovn\u00ed metoda komprese \u00fa\u010dinn\u011b zmen\u0161uje opakov\u00e1n\u00ed kr\u00e1tk\u00fdch sekvenc\u00ed a dosahuje tak vy\u0161\u0161\u00edho stupn\u011b komprese ne\u017e indexov\u00e1 komprese. Toho je v\u0161ak dosa\u017eeno za cenu vysok\u00e9ho zat\u00ed\u017een\u00ed centr\u00e1ln\u00edho procesoru; aby slovn\u00ed metoda za\u010dala efektivn\u011bji komprimovat data ne\u017e indexov\u00e1 metoda, mus\u00ed zpomalit zpracov\u00e1n\u00ed dat na 10-20 megabajt\u016f za sekundu na re\u00e1ln\u00fdch v\u00fdpo\u010detn\u00edch instalac\u00edch p\u0159i pln\u00e9m zat\u00ed\u017een\u00ed CPU.<\/p>\n<p>Takto n\u00edzk\u00e9 rychlosti jsou nep\u0159ijateln\u00e9 pro modern\u00ed syst\u00e9my ukl\u00e1d\u00e1n\u00ed dat a p\u0159edstavuj\u00ed sp\u00ed\u0161e \"akademick\u00fd\" z\u00e1jem ne\u017e praktick\u00fd.<\/p>\n<p>Stupe\u0148 komprese informac\u00ed bude v n\u00e1sleduj\u00edc\u00ed modifikaci algoritmu RTT (RTT-Max) podstatn\u011b zv\u00fd\u0161en, je ji\u017e ve f\u00e1zi v\u00fdvoje.<\/p>\n<p>Tak\u017ee, jak je v\u017edy zvykem, pokra\u010dov\u00e1n\u00ed n\u00e1sleduje\u2026<br \/>\n<br \/>Zdroj: <a content=\"nofollow\" rel=\"nofollow\" href=\"https:\/\/habr.com\/ru\/post\/479888\/\">habr.com<\/a><\/p>","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"excerpt":{"rendered":"<p>\u0414\u0430\u043d\u043d\u0430\u044f \u0441\u0442\u0430\u0442\u044c\u044f \u0443\u0436\u0435 \u0432\u0442\u043e\u0440\u0430\u044f \u0432 \u0442\u0435\u043c\u0435 \u043e \u0441\u043a\u043e\u0440\u043e\u0441\u0442\u043d\u043e\u0439 \u043a\u043e\u043c\u043f\u0440\u0435\u0441\u0441\u0438\u0438 \u0434\u0430\u043d\u043d\u044b\u0445. \u0412 \u043f\u0435\u0440\u0432\u043e\u0439 \u0441\u0442\u0430\u0442\u044c\u0435 \u0431\u044b\u043b \u043e\u043f\u0438\u0441\u0430\u043d \u043a\u043e\u043c\u043f\u0440\u0435\u0441\u0441\u043e\u0440 \u0440\u0430\u0431\u043e\u0442\u0430\u044e\u0449\u0438\u0439 \u0441\u043e \u0441\u043a\u043e\u0440\u043e\u0441\u0442\u044c\u044e 10\u0413\u0431\u0430\u0439\u0442\/\u0441\u0435\u043a. \u043d\u0430 \u043e\u0434\u043d\u043e \u043f\u0440\u043e\u0446\u0435\u0441\u0441\u043e\u0440\u043d\u043e\u0435 \u044f\u0434\u0440\u043e (\u043c\u0438\u043d\u0438\u043c\u0430\u043b\u044c\u043d\u043e\u0435 \u0441\u0436\u0430\u0442\u0438\u0435, RTT-Min). \u042d\u0442\u043e\u0442 \u043a\u043e\u043c\u043f\u0440\u0435\u0441\u0441\u043e\u0440, \u0443\u0436\u0435 \u0432\u043d\u0435\u0434\u0440\u0435\u043d \u0432 \u043e\u0431\u043e\u0440\u0443\u0434\u043e\u0432\u0430\u043d\u0438\u0435 \u043a\u0440\u0438\u043c\u0438\u043d\u0430\u043b\u0438\u0441\u0442\u0438\u0447\u0435\u0441\u043a\u0438\u0445 \u0434\u0443\u0431\u043b\u0438\u043a\u0430\u0442\u043e\u0440\u043e\u0432 \u0434\u043b\u044f \u0441\u043a\u043e\u0440\u043e\u0441\u0442\u043d\u043e\u0433\u043e \u0441\u0436\u0430\u0442\u0438\u044f \u0434\u0430\u043c\u043f\u043e\u0432 \u043d\u043e\u0441\u0438\u0442\u0435\u043b\u0435\u0439 \u0438\u043d\u0444\u043e\u0440\u043c\u0430\u0446\u0438\u0438 \u0438 \u0443\u0441\u0438\u043b\u0435\u043d\u0438\u044f \u0441\u0442\u043e\u0439\u043a\u043e\u0441\u0442\u0438 \u043a\u0440\u0438\u043f\u0442\u043e\u0433\u0440\u0430\u0444\u0438\u0438, \u0442\u0430\u043a\u0436\u0435 \u043e\u043d \u043c\u043e\u0436\u0435\u0442 \u043f\u0440\u0438\u043c\u0435\u043d\u044f\u0442\u044c\u0441\u044f \u0434\u043b\u044f \u0441\u0436\u0430\u0442\u0438\u044f \u043e\u0431\u0440\u0430\u0437\u043e\u0432 \u0432\u0438\u0440\u0442\u0443\u0430\u043b\u044c\u043d\u044b\u0445 \u043c\u0430\u0448\u0438\u043d \u0438 [&hellip;]<\/p>\n","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[688],"tags":[],"class_list":["post-53906","post","type-post","status-publish","format-standard","hentry","category-administrirovanie"],"aioseo_notices":[],"aioseo_head":"\n\t\t<!-- All in One SEO 5.0.3 - aioseo.com -->\n\t<meta name=\"description\" content=\"\u0414\u0430\u043d\u043d\u0430\u044f \u0441\u0442\u0430\u0442\u044c\u044f \u0443\u0436\u0435 \u0432\u0442\u043e\u0440\u0430\u044f \u0432 \u0442\u0435\u043c\u0435 \u043e \u0441\u043a\u043e\u0440\u043e\u0441\u0442\u043d\u043e\u0439 \u043a\u043e\u043c\u043f\u0440\u0435\u0441\u0441\u0438\u0438 \u0434\u0430\u043d\u043d\u044b\u0445. \u0412 \u043f\u0435\u0440\u0432\u043e\u0439 \u0441\u0442\u0430\u0442\u044c\u0435 \u0431\u044b\u043b \u043e\u043f\u0438\u0441\u0430\u043d \u043a\u043e\u043c\u043f\u0440\u0435\u0441\u0441\u043e\u0440 \u0440\u0430\u0431\u043e\u0442\u0430\u044e\u0449\u0438\u0439 \u0441\u043e \u0441\u043a\u043e\u0440\u043e\u0441\u0442\u044c\u044e 10\u0413\u0431\u0430\u0439\u0442\/\u0441\u0435\u043a. \u043d\u0430 \u043e\u0434\u043d\u043e \u043f\u0440\u043e\u0446\u0435\u0441\u0441\u043e\u0440\u043d\u043e\u0435 \u044f\u0434\u0440\u043e (\u043c\u0438\u043d\u0438\u043c\u0430\u043b\u044c\u043d\u043e\u0435 \u0441\u0436\u0430\u0442\u0438\u0435, RTT-Min).\" \/>\n\t<meta name=\"robots\" content=\"max-image-preview:large\" \/>\n\t<meta name=\"author\" content=\"Yuri Gagarin\"\/>\n\t<link rel=\"canonical\" href=\"https:\/\/prohoster.info\/cs\/blog\/administrirovanie\/skorostnaya-otkazoustojchivaya-kompressiya-prodolzhenie\" \/>\n\t\t<meta name=\"generator\" content=\"All in One SEO (AIOSEO) 5.0.3\" \/>\n\t\t<meta property=\"og:locale\" content=\"cs_CZ\" \/>\n\t\t<meta property=\"og:site_name\" content=\"ProHoster | \u041a\u0443\u043f\u0438\u0442\u044c \u043d\u0430\u0434\u0435\u0436\u043d\u044b\u0439 \u0445\u043e\u0441\u0442\u0438\u043d\u0433 \u0434\u043b\u044f \u0441\u0430\u0439\u0442\u043e\u0432 \u0441 \u0437\u0430\u0449\u0438\u0442\u043e\u0439 \u043e\u0442 DDoS, VPS VDS \u0441\u0435\u0440\u0432\u0435\u0440\u044b\" \/>\n\t\t<meta property=\"og:type\" content=\"article\" \/>\n\t\t<meta property=\"og:title\" content=\"\ud83e\udd47\u0421\u043a\u043e\u0440\u043e\u0441\u0442\u043d\u0430\u044f \u043e\u0442\u043a\u0430\u0437\u043e\u0443\u0441\u0442\u043e\u0439\u0447\u0438\u0432\u0430\u044f \u043a\u043e\u043c\u043f\u0440\u0435\u0441\u0441\u0438\u044f (\u041f\u0440\u043e\u0434\u043e\u043b\u0436\u0435\u043d\u0438\u0435) | ProHoster\" \/>\n\t\t<meta property=\"og:description\" content=\"\u0414\u0430\u043d\u043d\u0430\u044f \u0441\u0442\u0430\u0442\u044c\u044f \u0443\u0436\u0435 \u0432\u0442\u043e\u0440\u0430\u044f \u0432 \u0442\u0435\u043c\u0435 \u043e \u0441\u043a\u043e\u0440\u043e\u0441\u0442\u043d\u043e\u0439 \u043a\u043e\u043c\u043f\u0440\u0435\u0441\u0441\u0438\u0438 \u0434\u0430\u043d\u043d\u044b\u0445. \u0412 \u043f\u0435\u0440\u0432\u043e\u0439 \u0441\u0442\u0430\u0442\u044c\u0435 \u0431\u044b\u043b \u043e\u043f\u0438\u0441\u0430\u043d \u043a\u043e\u043c\u043f\u0440\u0435\u0441\u0441\u043e\u0440 \u0440\u0430\u0431\u043e\u0442\u0430\u044e\u0449\u0438\u0439 \u0441\u043e \u0441\u043a\u043e\u0440\u043e\u0441\u0442\u044c\u044e 10\u0413\u0431\u0430\u0439\u0442\/\u0441\u0435\u043a. \u043d\u0430 \u043e\u0434\u043d\u043e \u043f\u0440\u043e\u0446\u0435\u0441\u0441\u043e\u0440\u043d\u043e\u0435 \u044f\u0434\u0440\u043e (\u043c\u0438\u043d\u0438\u043c\u0430\u043b\u044c\u043d\u043e\u0435 \u0441\u0436\u0430\u0442\u0438\u0435, RTT-Min).\" \/>\n\t\t<meta property=\"og:url\" content=\"https:\/\/prohoster.info\/cs\/blog\/administrirovanie\/skorostnaya-otkazoustojchivaya-kompressiya-prodolzhenie\" \/>\n\t\t<meta property=\"og:image\" content=\"https:\/\/prohoster.info\/wp-content\/uploads\/2021\/11\/logo-350.jpg\" \/>\n\t\t<meta property=\"og:image:secure_url\" content=\"https:\/\/prohoster.info\/wp-content\/uploads\/2021\/11\/logo-350.jpg\" \/>\n\t\t<meta property=\"og:image:width\" content=\"350\" \/>\n\t\t<meta property=\"og:image:height\" content=\"350\" \/>\n\t\t<meta property=\"article:published_time\" content=\"2019-12-12T21:00:00+00:00\" \/>\n\t\t<meta property=\"article:modified_time\" content=\"2020-02-18T11:01:51+00:00\" \/>\n\t\t<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/prohoster\" \/>\n\t\t<meta property=\"article:author\" content=\"https:\/\/www.facebook.com\/prohoster\" \/>\n\t\t<!-- All in One SEO -->\n\n","aioseo_head_json":{"title":"\ud83e\udd47Rychl\u00e1 a odoln\u00e1 komprese (Pokra\u010dov\u00e1n\u00ed) | ProHoster","description":"Tento \u010dl\u00e1nek je druh\u00fd v s\u00e9rii o rychl\u00e9 kompresi dat. V prvn\u00edm \u010dl\u00e1nku byl pops\u00e1n kompresor pracuj\u00edc\u00ed rychlost\u00ed 10 GB\/s na jedno procesorov\u00e9 j\u00e1dro (minim\u00e1ln\u00ed komprese, RTT-Min).","canonical_url":"https:\/\/prohoster.info\/cs\/blog\/administrirovanie\/skorostnaya-otkazoustojchivaya-kompressiya-prodolzhenie","robots":"max-image-preview:large","keywords":"","webmasterTools":{"miscellaneous":""},"schema":null,"og:locale":"cs_CZ","og:site_name":"ProHoster | \u041a\u0443\u043f\u0438\u0442\u044c \u043d\u0430\u0434\u0435\u0436\u043d\u044b\u0439 \u0445\u043e\u0441\u0442\u0438\u043d\u0433 \u0434\u043b\u044f \u0441\u0430\u0439\u0442\u043e\u0432 \u0441 \u0437\u0430\u0449\u0438\u0442\u043e\u0439 \u043e\u0442 DDoS, VPS VDS \u0441\u0435\u0440\u0432\u0435\u0440\u044b","og:type":"article","og:title":"\ud83e\udd47\u0421\u043a\u043e\u0440\u043e\u0441\u0442\u043d\u0430\u044f \u043e\u0442\u043a\u0430\u0437\u043e\u0443\u0441\u0442\u043e\u0439\u0447\u0438\u0432\u0430\u044f \u043a\u043e\u043c\u043f\u0440\u0435\u0441\u0441\u0438\u044f (\u041f\u0440\u043e\u0434\u043e\u043b\u0436\u0435\u043d\u0438\u0435) | ProHoster","og:description":"\u0414\u0430\u043d\u043d\u0430\u044f \u0441\u0442\u0430\u0442\u044c\u044f \u0443\u0436\u0435 \u0432\u0442\u043e\u0440\u0430\u044f \u0432 \u0442\u0435\u043c\u0435 \u043e \u0441\u043a\u043e\u0440\u043e\u0441\u0442\u043d\u043e\u0439 \u043a\u043e\u043c\u043f\u0440\u0435\u0441\u0441\u0438\u0438 \u0434\u0430\u043d\u043d\u044b\u0445. \u0412 \u043f\u0435\u0440\u0432\u043e\u0439 \u0441\u0442\u0430\u0442\u044c\u0435 \u0431\u044b\u043b \u043e\u043f\u0438\u0441\u0430\u043d \u043a\u043e\u043c\u043f\u0440\u0435\u0441\u0441\u043e\u0440 \u0440\u0430\u0431\u043e\u0442\u0430\u044e\u0449\u0438\u0439 \u0441\u043e \u0441\u043a\u043e\u0440\u043e\u0441\u0442\u044c\u044e 10\u0413\u0431\u0430\u0439\u0442\/\u0441\u0435\u043a. \u043d\u0430 \u043e\u0434\u043d\u043e \u043f\u0440\u043e\u0446\u0435\u0441\u0441\u043e\u0440\u043d\u043e\u0435 \u044f\u0434\u0440\u043e (\u043c\u0438\u043d\u0438\u043c\u0430\u043b\u044c\u043d\u043e\u0435 \u0441\u0436\u0430\u0442\u0438\u0435, RTT-Min).","og:url":"https:\/\/prohoster.info\/cs\/blog\/administrirovanie\/skorostnaya-otkazoustojchivaya-kompressiya-prodolzhenie","og:image":"https:\/\/prohoster.info\/wp-content\/uploads\/2021\/11\/logo-350.jpg","og:image:secure_url":"https:\/\/prohoster.info\/wp-content\/uploads\/2021\/11\/logo-350.jpg","og:image:width":350,"og:image:height":350,"article:published_time":"2019-12-12T21:00:00+00:00","article:modified_time":"2020-02-18T11:01:51+00:00","article:publisher":"https:\/\/www.facebook.com\/prohoster","article:author":"https:\/\/www.facebook.com\/prohoster"},"aioseo_meta_data":{"post_id":"53906","title":null,"description":null,"keywords":null,"keyphrases":null,"primary_term":null,"canonical_url":null,"og_title":null,"og_description":null,"og_object_type":"default","og_image_type":"default","og_image_url":null,"og_image_width":null,"og_image_height":null,"og_image_custom_url":null,"og_image_custom_fields":null,"og_video":null,"og_custom_url":null,"og_article_section":null,"og_article_tags":null,"twitter_use_og":false,"twitter_card":"default","twitter_image_type":"default","twitter_image_url":null,"twitter_image_custom_url":null,"twitter_image_custom_fields":null,"twitter_title":null,"twitter_description":null,"schema":{"blockGraphs":[],"customGraphs":[],"default":{"data":{"Article":[],"Course":[],"Dataset":[],"FAQPage":[],"Movie":[],"Person":[],"Product":[],"ProductReview":[],"Car":[],"Recipe":[],"Service":[],"SoftwareApplication":[],"WebPage":[]},"graphName":"","isEnabled":true},"graphs":[]},"schema_type":null,"schema_type_options":null,"pillar_content":false,"robots_default":true,"robots_noindex":false,"robots_noarchive":false,"robots_nosnippet":false,"robots_nofollow":false,"robots_noimageindex":false,"robots_noodp":false,"robots_notranslate":false,"robots_max_snippet":null,"robots_max_videopreview":null,"robots_max_imagepreview":"large","priority":null,"frequency":null,"local_seo":null,"seo_analyzer_scan_date":"2026-02-09 18:05:19","breadcrumb_settings":null,"limit_modified_date":false,"reviewed_by":null,"ai":null,"created":"2021-02-28 20:15:55","updated":"2026-02-09 18:05:19","focus_keyword":null,"additional_keywords":null,"truseo_locale":null},"gt_translate_keys":[{"key":"link","format":"url"}],"_links":{"self":[{"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/posts\/53906","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/comments?post=53906"}],"version-history":[{"count":1,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/posts\/53906\/revisions"}],"predecessor-version":[{"id":158702,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/posts\/53906\/revisions\/158702"}],"wp:attachment":[{"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/media?parent=53906"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/categories?post=53906"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/tags?post=53906"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}