{"id":36632,"date":"2019-10-31T22:12:47","date_gmt":"2019-10-31T19:12:47","guid":{"rendered":"https:\/\/prohoster.info\/blog\/globaly-mechi-kladentsy-dlya-hraneniya-dannyh-razrezhennye-massivy-chast-3\/"},"modified":"2019-10-31T22:12:47","modified_gmt":"2019-10-31T19:12:47","slug":"globaly-mechi-kladentsy-dlya-hraneniya-dannyh-razrezhennye-massivy-chast-3","status":"publish","type":"post","link":"https:\/\/prohoster.info\/sk\/blog\/administrirovanie\/globaly-mechi-kladentsy-dlya-hraneniya-dannyh-razrezhennye-massivy-chast-3","title":{"rendered":"Glob\u00e1ly \u2013 me\u010de-kladenice pre \u00falo\u017eisko d\u00e1t. Riedke pole. \u010cas\u0165 3","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"

\"Glob\u00e1lyV predch\u00e1dzaj\u00facich \u010dastiach (1<\/a><\/noindex>, 2<\/a><\/noindex>) sme hovorili o glob\u00e1loch ako o stromoch, v tejto sa pozrieme na glob\u00e1ly ako na riedke polia.<\/p>\n

Riedke pole<\/a><\/noindex> je \u0161peci\u00e1lny typ po\u013ea, v ktorom v\u00e4\u010d\u0161ina hodn\u00f4t m\u00e1 rovnak\u00fa hodnotu.<\/p>\n

V praxi sa \u010dasto stret\u00e1vame s tak obrovsk\u00fdmi riedkymi poliami, \u017ee nem\u00e1 zmysel zaberanie pam\u00e4te rovnak\u00fdmi prvkami. Preto m\u00e1 zmysel implementova\u0165 riedke polia tak, aby sa \u0161et\u0159ila pam\u00e4\u0165 na uchov\u00e1vanie rovnak\u00fdch hodn\u00f4t.
\nV niektor\u00fdch programovac\u00edch jazykoch s\u00fa riedke polia s\u00fa\u010das\u0165ou samotn\u00e9ho jazyka, napr\u00edklad v J<\/a><\/noindex>, MATLAB.<\/a><\/noindex>V in\u00fdch programovac\u00edch jazykoch existuj\u00fa \u0161peci\u00e1lne kni\u017enice, ktor\u00e9 umo\u017e\u0148uj\u00fa ich implement\u00e1ciu. Pre C++ \u2014 Eigen<\/a><\/noindex> a \u010fal\u0161ie. <\/p>\n

Glob\u00e1ly s\u00fa dobr\u00fdmi kandid\u00e1tmi na implement\u00e1ciu riedkych pol\u00ed, preto\u017ee:
\n<\/a><\/noindex><\/p>\n

    \n
  1. Ukladaj\u00fa hodnoty iba ur\u010dit\u00fdch uzlov a neukladaj\u00fa hodnoty neur\u010den\u00fdch;<\/li>\n
  2. Pr\u00edstupov\u00e9 rozhranie k hodnote uzla je extr\u00e9mne podobn\u00e9 tomu, ako je v mnoh\u00fdch programovac\u00edch jazykoch implementovan\u00fd pr\u00edstup k prvku viacdimenzi\u00e1lnych pol\u00ed.\n
    Set ^a(1, 2, 3)=5\nWrite ^a(1, 2, 3)<\/code><\/pre>\n
    \n<\/li>\n
  3. Global je dostato\u010dne n\u00edzko\u00farov\u0148ov\u00e1 \u0161trukt\u00fara na uchov\u00e1vanie d\u00e1t, preto m\u00e1 vynikaj\u00face r\u00fdchlostn\u00e9 charakteristiky (stovky tis\u00edc a\u017e desiatky mili\u00f3nov transakci\u00ed za sekundu v z\u00e1vislosti od hardv\u00e9ru, pozri. 1<\/a><\/noindex>)<\/li>\n<\/ol>\n
    <\/p>\n
    Ke\u010f\u017ee global je perzistentn\u00e1 \u0161trukt\u00fara, m\u00e1 zmysel vytv\u00e1ra\u0165 riedke polia, ke\u010f je vopred zn\u00e1me, \u017ee objem opera\u010dnej pam\u00e4te bude nedostato\u010dn\u00fd.<\/p><\/blockquote>\n
    \nJednou z vlastnost\u00ed implement\u00e1ci\u00ed riedkych pol\u00ed je n\u00e1vrat ur\u010ditej predvolenej hodnoty, ak je pr\u00edstup k neur\u010denej bunke.<\/p>\n
    To je mo\u017en\u00e9 realizova\u0165 pou\u017eit\u00edm funkcie $GET<\/a><\/noindex> v COS. V tomto pr\u00edklade je zobrazen\u00e9 3-dimenzion\u00e1lne pole.<\/p>\n
    SET a = $GET(^a(x,y,z), defValue)<\/code><\/pre>\n
    \nNa ak\u00e9 \u00falohy s\u00fa potrebn\u00e9 riedke polia a ako m\u00f4\u017eu glob\u00e1ly pom\u00f4c\u0165?<\/p>\n
    Matica susednosti (prepojenosti)<\/h2>\n
    \nTak\u00e9to matice<\/a><\/noindex> sa pou\u017e\u00edvaj\u00fa na reprezent\u00e1ciu grafov:<\/p>\n
    \"Glob\u00e1ly
    \n
    \nJe zrejm\u00e9, \u017ee \u010d\u00edm v\u00e4\u010d\u0161\u00ed je graf, t\u00fdm viac n\u00fal bude v matici. Ak by sme napr\u00edklad zobrali graf soci\u00e1lnej siete a predstavili ho v podobe takejto matice, tak by sa takmer cel\u00fd skladal z n\u00fal, t.j. by bol riedkym po\u013eom.<\/p>\n
    Set ^m(id1, id2) = 1 \nSet ^m(id1, id3) = 1 \nSet ^m(id1, id4) = 1 \nSet ^m(id1) = 3 \nSet ^m(id2, id4) = 1 \nSet ^m(id2, id5) = 1 \nSet ^m(id2) = 2\n....\n<\/code><\/pre>\n
    \nV tomto pr\u00edklade uchov\u00e1vame v glob\u00e1le ^m<\/strong> maticu s\u00favislosti, ako aj po\u010det hr\u00e1n pre ka\u017ed\u00fd uzol (kto s k\u00fdm je priate\u013e a po\u010det priate\u013eov).<\/p>\n
    Ak je v\u0161ak po\u010det prvkov v grafe maxim\u00e1lne 29 mili\u00f3nov (toto \u010d\u00edslo sa berie ako s\u00fa\u010din 8 * maxim\u00e1lna ve\u013ekos\u0165 re\u0165azca<\/a><\/noindex>), existuje e\u0161te ekonomickej\u0161\u00ed sp\u00f4sob uchov\u00e1vania tak\u00fdchto mat\u00edc \u2014 bitov\u00e9 re\u0165azce, preto\u017ee v ich realiz\u00e1cii s\u00fa \u0161peci\u00e1lnym sp\u00f4sobom optimalizovan\u00e9 ve\u013ek\u00e9 pr\u00e1zdne miesta.<\/p>\n
    Manipul\u00e1cie s bitov\u00fdmi re\u0165azcami sa vykon\u00e1vaj\u00fa funkciou $BIT<\/a><\/noindex>. <\/p>\n
    ; nastavenie bitu\nSET $BIT(rowID, positionID) = 1\n; z\u00edskanie bitu\nWrite $BIT(rowID, positionID)\n<\/code><\/pre>\n
    <\/p>\n
    Tabu\u013eka prechodov kone\u010dn\u00e9ho automatu<\/h2>\n
    \nKe\u010f\u017ee graf prechodov kone\u010dn\u00e9ho automatu je oby\u010dajn\u00fd graf, tabu\u013eka prechodov kone\u010dn\u00e9ho automatu je vlastne t\u00e1 ist\u00e1 matica susednosti, o ktorej sme hovorili vy\u0161\u0161ie.<\/p>\n
    Kry\u0161t\u00e1lov\u00e9 automaty<\/h2>\n
    \n\"Glob\u00e1ly
    \n
    \nNajzn\u00e1mej\u0161\u00ed kry\u0161t\u00e1lov\u00fd automat \u2014     hra '\u017divot'<\/a><\/noindex>, ktor\u00e1 kv\u00f4li svojim pravidl\u00e1m (ke\u010f m\u00e1 bunka ve\u013ea susedov \u2014 umiera) predstavuje riedky pole.<\/p>\n
    Stephen Wolfram pova\u017euje kry\u0161t\u00e1lov\u00e9 automaty za nov\u00fa oblas\u0165 vedy<\/a><\/noindex>. V roku 2002 vyd\u00e1va 1280-stranov\u00fa knihu 'A New Kind of Science', kde \u0161iroko argumentuje, \u017ee dosiahnutia v oblasti kry\u0161t\u00e1lov\u00fdch automatov nie s\u00fa izolovan\u00e9, ale s\u00fa ve\u013emi stabiln\u00e9 a maj\u00fa ve\u013ek\u00fd v\u00fdznam pre v\u0161etky oblasti vedy.<\/p>\n
    Dok\u00e1zalo sa, \u017ee ka\u017ed\u00fd algoritmus vykonate\u013en\u00fd na po\u010d\u00edta\u010di m\u00f4\u017ee by\u0165 realizovan\u00fd prostredn\u00edctvom kry\u0161t\u00e1lov\u00e9ho automatu. Kry\u0161t\u00e1lov\u00e9 automaty sa pou\u017e\u00edvaj\u00fa na modelovanie dynamick\u00fdch prostred\u00ed a syst\u00e9mov, na rie\u0161enie algoritmick\u00fdch \u00faloh a in\u00e9 \u00fa\u010dely.<\/p>\n
    Ak m\u00e1me obrovsk\u00e9 pole a potrebujeme zapisova\u0165 v\u0161etky medzi\u013eahl\u00e9 stavy kry\u0161t\u00e1lov\u00e9ho automatu, je celkom rozumn\u00e9 pou\u017e\u00edva\u0165 glob\u00e1le.<\/p>\n
    Kartografia<\/h2>\n
    \nPrv\u00e1 vec, ktor\u00e1 mi napadne, ke\u010f sa hovor\u00ed o pou\u017e\u00edvan\u00ed riedkych pol\u00ed \u2014 s\u00fa to kartografick\u00e9 \u00falohy.<\/p>\n
    Na map\u00e1ch je spravidla ve\u013emi ve\u013ea pr\u00e1zdneho priestoru. Ak by sme mapu zobrazovali ako ve\u013ek\u00e9 pixely, 71 % pixelov Zeme by bolo obsaden\u00fdch oce\u00e1nom. Riedke pole. A ak by sme zn\u00e1zornili iba dielo \u013eudsk\u00fdch r\u00fak, pr\u00e1zdneho priestoru by bolo viac ako 95 %.<\/p>\n
    Samozrejme, nikto neuchov\u00e1va mapy vo forme rastrov\u00fdch pol\u00ed, pou\u017e\u00edva sa vektorov\u00e9 zobrazenie.
    \n\u010co s\u00fa vektorov\u00e9 mapy? To je r\u00e1mec pozost\u00e1vaj\u00faci z bodov, polyl\u00ednie a polyg\u00f3nov.
    \nFakticky je to datab\u00e1za bodov a vz\u0165ahov medzi nimi.<\/p>\n
    Jednou z najambici\u00f3znej\u0161\u00edch \u00faloh mapovania je misia mapovania na\u0161ej galaxie teleskopom Gaia. Obrazne povedan\u00e9, na\u0161a galaxia, podobne ako cel\u00fd vesm\u00edr, je jednolit\u00e9 rozpt\u00fdlen\u00e9 pole: obrovsk\u00e9 pr\u00e1zdne priestory, v ktor\u00fdch s\u00fa zriedkav\u00e9 mal\u00e9 body \u2014 hviezdy. Pr\u00e1zdneho miesta je 99,999999…….%. Na ulo\u017eenie mapy na\u0161ej galaxie bola zvolen\u00e1 datab\u00e1za na glob\u00e1loch \u2014 Cach\u00e9.<\/p>\n
    Neviem presn\u00fa \u0161trukt\u00faru glob\u00e1lov v tomto projekte, m\u00f4\u017eem predpoklada\u0165, \u017ee je to nie\u010do ako:<\/p>\n
    Set ^galaxy(b, l, d) = 1; \u010c\u00edslo hviezdy pod\u013ea katal\u00f3gu, ak existuje\nSet ^galaxy(b, l, d, \"name\") = \"Sun\"\nSet ^galaxy(b, l, d, \"type\") = \"normal\"; mo\u017enosti blackhole, quazar, red_dwarf a pod.\nSet ^galaxy(b, l, d, \"weight\") = 14E50\nSet ^galaxy(b, l, d, \"planetes\") = 7\nSet ^galaxy(b, l, d, \"planetes\", 1) = \"Mercury\"\nSet ^galaxy(b, l, d, \"planetes\", 1, weight) = 1E20\n...\n<\/code><\/pre>\n
    \nKde b, l, d \u2014 to s\u00fa galaktick\u00e9 s\u00faradnice \u0161\u00edrka, d\u013a\u017eka<\/a><\/noindex> a vzdialenos\u0165 od Slnka.<\/i><\/p>\n
    Flexibiln\u00e1 \u0161trukt\u00fara glob\u00e1lov umo\u017e\u0148uje uklada\u0165 ak\u00e9ko\u013evek potrebn\u00e9 charakteristiky hviezd a plan\u00e9t, preto\u017ee datab\u00e1zy na glob\u00e1loch s\u00fa bez sch\u00e9my (scheme-less).<\/p>\n
    Pre ulo\u017eenie mapy n\u00e1\u0161ho vesm\u00edru bol Cach\u00e9 vybran\u00fd nielen kv\u00f4li flexibilite, ale aj schopnosti ve\u013emi r\u00fdchlo uklada\u0165 pr\u00fad d\u00e1t a s\u00fa\u010dasne vytv\u00e1ra\u0165 indexov\u00e9 glob\u00e1ly pre r\u00fdchle vyh\u013ead\u00e1vanie.<\/p>\n
    Ak sa v\u0161ak vr\u00e1time na Zem, na glob\u00e1loch boli vytvoren\u00e9 kartografick\u00e9 projekty OpenStreetMap XAPI<\/a><\/noindex> a fork OpenStreetMap \u2014 FOSM<\/a><\/noindex>.<\/p>\n
    Ned\u00e1vno na hackathone Cach\u00e9<\/a><\/noindex> boli implementovan\u00e9 geografick\u00e9 indexy Geospatial<\/a><\/noindex>. \u010cak\u00e1me od autorov \u010dl\u00e1nku detaily implement\u00e1cie.<\/p>\n
    Implement\u00e1cia priestorov\u00fdch indexov na glob\u00e1li v OpenStreetMap XAPI<\/h3>\n
    \nObr\u00e1zky s\u00fa prevzat\u00e9 z tejto prezent\u00e1cie<\/a><\/noindex>.<\/p>\n
    Cel\u00e1 zemsk\u00e1 gu\u013ea je rozdelen\u00e1 na kocky, potom na podkocky a podkocky zase na men\u0161ie podkocky a tak \u010falej. V podstate dost\u00e1vame hierarchick\u00fa \u0161trukt\u00faru, na ktor\u00fa boli glob\u00e1ly vytvoren\u00e9.<\/p>\n
    \"Glob\u00e1ly
    \n
    \nV akomko\u013evek momente m\u00f4\u017eeme prakticky okam\u017eite po\u017eiada\u0165 o potrebn\u00fa kocku alebo ju vy\u010disti\u0165, pri\u010dom v\u0161etky podkocky tie\u017e bud\u00fa vr\u00e1ten\u00e9 alebo vy\u010disten\u00e9.<\/p>\n
    Podobn\u00fa sch\u00e9mu na glob\u00e1loch je mo\u017en\u00e9 uskuto\u010dni\u0165 nieko\u013ek\u00fdmi sp\u00f4sobmi.<\/p>\n
    Varianta 1:<\/p>\n
    Set ^m(a, b, a, c, d, a, b,c, d, a, b, a, c, d, a, b,c, d, a, 1) = idPrvejBod\nSet ^m(a, b, a, c, d, a, b,c, d, a, b, a, c, d, a, b,c, d, a, 2) = idDruhejBod\n...<\/code><\/pre>\n
    \nVarianta 2:<\/p>\n
    Nastavte ^m('abacdabcdabacdabcda', 1) = idPrvejBodky\nNastavte ^m('abacdabcdabacdabcda', 2) = idDruhejBodky\n...<\/code><\/pre>\n
    \nV oboch pr\u00edpadoch nie je \u0165a\u017ek\u00e9 na COS\/M po\u017eadova\u0165 body nach\u00e1dzaj\u00face sa v \u0161tvorci akejko\u013evek \u00farovne. O nie\u010do jednoduch\u0161ie bude \u010disti\u0165 \u0161tvorcov\u00e9 \u00faseky priestoru akejko\u013evek \u00farovne v prvom variante, ale to sa zriedka vy\u017eaduje.<\/p>\n
    Pr\u00edklad jedn\u00e9ho z \u0161tvor\u010dekov dolnej \u00farovne:<\/p>\n
    \"Glob\u00e1ly
    \n
    \nA tu je nieko\u013eko glob\u00e1lov z projektu XAPI: reprezent\u00e1cia indexu na glob\u00e1loch:<\/p>\n
    \"Glob\u00e1ly
    \n
    \nGlob\u00e1l ^way<\/strong> pou\u017e\u00edva sa na uchov\u00e1vanie bodov     polilini\u00ed<\/a><\/noindex> (ciest, mal\u00fdch riek a pod.) a polyg\u00f3nov (uzavret\u00e9 oblasti: budovy, lesy a pod.).<\/p>\n
    Hrub\u00e1 klasifik\u00e1cia vyu\u017eitia riedkych mat\u00edc na glob\u00e1loch.<\/h2>\n
    <\/p>\n
      \n
    1. Uklad\u00e1me s\u00faradnice ur\u010dit\u00fdch objektov a ich stavy (mapovanie, bunkov\u00e9 automaty)<\/li>\n
    2. Uklad\u00e1me riedke matice.<\/li>\n<\/ol>\n
      \nPre pr\u00edpad 2) pri dopyte ur\u010ditej s\u00faradnice, kde prvku nebolo pridelen\u00e9 hodnotu, by sme mali z\u00edska\u0165 hodnotu prvku riedkeho po\u013ea predvolene.<\/p>\n
      Bonifik\u00e1cie, ktor\u00e9 z\u00edskavame pri ukladan\u00ed viacrozmern\u00fdch mat\u00edc na glob\u00e1loch<\/h2>\n
      \nR\u00fdchle odstra\u0148ovanie a\/alebo v\u00fdber \u00fasekov priestoru, n\u00e1sobn\u00fdch riadkom, rovin\u00e1m, kock\u00e1m a pod.<\/b> Pre pr\u00edpady, ke\u010f s\u00fa pou\u017eit\u00e9 celistv\u00e9 indexy, m\u00f4\u017ee by\u0165 u\u017eito\u010dn\u00e1 mo\u017enos\u0165 r\u00fdchleho odstra\u0148ovania a\/alebo v\u00fdberu \u00fasekov priestoru, n\u00e1sobn\u00fdch riadkom, rovin\u00e1m, kock\u00e1m a pod.<\/p>\n
      Pr\u00edkazom Kill<\/a><\/noindex> m\u00f4\u017eeme odstr\u00e1ni\u0165 ako jednotliv\u00fd prvok, tak aj riadok, a dokonca cel\u00fa rovinu. V\u010faka vlastnostiam glob\u00e1lov sa to deje ve\u013emi r\u00fdchlo \u2014 tis\u00edckr\u00e1t r\u00fdchlej\u0161ie, ne\u017e poelementov\u00e9 odstra\u0148ovanie.<\/p>\n
      Na obr\u00e1zku je zn\u00e1zornen\u00e1 trojrozmern\u00e1 matica v glob\u00e1le ^a<\/strong> a r\u00f4zne druhy odstra\u0148ovania.<\/p>\n
      \"Glob\u00e1ly
      \n
      \nNa v\u00fdber \u00fasekov priestoru pod\u013ea zn\u00e1mych indexov mo\u017eno pou\u017ei\u0165 pr\u00edkaz       Merge<\/a><\/noindex>.<\/p>\n
      V\u00fdber st\u013apca matice do premennej Column:<\/p>\n
      ; Nastav\u00edme trojrozmern\u00fa riedku maticu 3x3x3\nNastavte ^a(0,0,0)=1,^a(2,2,0)=1,^a(2,0,1)=1,^a(0,2,1)=1,^a(2,2,2)=1,^a(2,1,2)=1\nZl\u00fa\u010di\u0165 St\u013apec = ^a(2,2)\n; Vytla\u010d\u00edme premenn\u00fa St\u013apec\nZwrite St\u013apec\n<\/code><\/pre>\n
      \nV\u00fdstup:<\/p>\n
      St\u013apec(0)=1\nSt\u013apec(2)=1\n<\/code><\/pre>\n
      \nZauj\u00edmav\u00e9 je, \u017ee v premennej St\u013apec sa n\u00e1m tie\u017e vytvoril riedky po\u013e, ku ktor\u00e9mu je potrebn\u00e9 pristupova\u0165 tie\u017e cez $GET<\/a><\/noindex>, preto\u017ee predvolen\u00e9 hodnoty v \u0148om nie s\u00fa ulo\u017een\u00e9.<\/p>\n
      V\u00fdber \u00fasekov priestoru sa m\u00f4\u017ee tie\u017e robi\u0165 prostredn\u00edctvom mal\u00e9ho programu s vyu\u017eit\u00edm funkcie $Order<\/a><\/noindex>. To je osobitne pohodln\u00e9 na priestoroch, ktor\u00fdch indexy nie s\u00fa kvantovan\u00e9 (kartografia).<\/p>\n
      Z\u00e1ver<\/h2>\n
      \nS\u00fa\u010dasn\u00e9 \u010dasy klad\u00fa nov\u00e9 ambici\u00f3zne \u00falohy. Grafy m\u00f4\u017eu obsahova\u0165 miliardy vrcholov, mapy miliardy bodov a niekto m\u00f4\u017ee dokonca chcie\u0165 spusti\u0165 svoju vlastn\u00fa univerzum na z\u00e1kladn\u00fdch automatoch (1<\/a><\/noindex>, 2<\/a><\/noindex>).<\/p>\n
      Ke\u010f objem d\u00e1t rozpt\u00fdlen\u00fdch pol\u00ed u\u017e nem\u00f4\u017ee by\u0165 umiestnen\u00fd v opera\u010dnej pam\u00e4ti a je potrebn\u00e9 s nimi pracova\u0165, mali by ste zv\u00e1\u017ei\u0165 realiz\u00e1ciu tak\u00fdchto projektov na glob\u00e1loch a COS.<\/p>\n
      \u010eakujeme za pozornos\u0165! Te\u0161\u00edme sa na va\u0161e ot\u00e1zky a priania v koment\u00e1roch.<\/p>\n
      Upozornenie<\/b>: tento \u010dl\u00e1nok a moje koment\u00e1re k nemu s\u00fa m\u00f4j n\u00e1zor a nemaj\u00fa ni\u010d spolo\u010dn\u00e9 s ofici\u00e1lnym stanoviskom korpor\u00e1cie InterSystems.<\/i>
      \n
      Zdroj:       habr.com<\/a><\/p>","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"excerpt":{"rendered":"
      \u0412 \u043f\u0440\u043e\u0448\u043b\u044b\u0445 \u0447\u0430\u0441\u0442\u044f\u0445 (1, 2) \u043c\u044b \u0433\u043e\u0432\u043e\u0440\u0438\u043b\u0438 \u043e \u0433\u043b\u043e\u0431\u0430\u043b\u0430\u0445 \u043a\u0430\u043a \u043e \u0434\u0435\u0440\u0435\u0432\u044c\u044f\u0445, \u0432 \u044d\u0442\u043e\u0439 \u043c\u044b \u0440\u0430\u0441\u0441\u043c\u043e\u0442\u0440\u0438\u043c \u0433\u043b\u043e\u0431\u0430\u043b\u044b \u043a\u0430\u043a \u0440\u0430\u0437\u0440\u0435\u0436\u0435\u043d\u043d\u044b\u0435 \u043c\u0430\u0441\u0441\u0438\u0432\u044b. \u0420\u0430\u0437\u0440\u0435\u0436\u0435\u043d\u043d\u044b\u0439 \u043c\u0430\u0441\u0441\u0438\u0432 \u2014 \u044d\u0442\u043e \u0440\u0430\u0437\u043d\u043e\u0432\u0438\u0434\u043d\u043e\u0441\u0442\u044c \u043c\u0430\u0441\u0441\u0438\u0432\u0430, \u0432 \u043a\u043e\u0442\u043e\u0440\u043e\u043c \u0431\u043e\u043b\u044c\u0448\u0438\u043d\u0441\u0442\u0432\u043e \u0437\u043d\u0430\u0447\u0435\u043d\u0438\u0439 \u043f\u0440\u0438\u043d\u0438\u043c\u0430\u0435\u0442 \u043e\u0434\u0438\u043d\u0430\u043a\u043e\u0432\u043e\u0435 \u0437\u043d\u0430\u0447\u0435\u043d\u0438\u0435. \u041d\u0430 \u043f\u0440\u0430\u043a\u0442\u0438\u043a\u0435 \u0447\u0430\u0441\u0442\u043e \u0432\u0441\u0442\u0440\u0435\u0447\u0430\u044e\u0442\u0441\u044f \u043d\u0430\u0441\u0442\u043e\u043b\u044c\u043a\u043e \u043e\u0433\u0440\u043e\u043c\u043d\u044b\u0435 \u0440\u0430\u0437\u0440\u0435\u0436\u0435\u043d\u043d\u044b\u0435 \u043c\u0430\u0441\u0441\u0438\u0432\u044b, \u0447\u0442\u043e \u043d\u0435\u0442 \u043d\u0438\u043a\u0430\u043a\u043e\u0433\u043e \u0441\u043c\u044b\u0441\u043b\u0430 \u0437\u0430\u043d\u0438\u043c\u0430\u0442\u044c \u043f\u0430\u043c\u044f\u0442\u044c \u043e\u0434\u0438\u043d\u0430\u043a\u043e\u0432\u044b\u043c\u0438 \u044d\u043b\u0435\u043c\u0435\u043d\u0442\u0430\u043c\u0438. \u041f\u043e\u044d\u0442\u043e\u043c\u0443 \u0435\u0441\u0442\u044c \u0441\u043c\u044b\u0441\u043b \u0440\u0430\u0437\u0440\u0435\u0436\u0435\u043d\u043d\u044b\u0435 \u043c\u0430\u0441\u0441\u0438\u0432\u044b \u0440\u0435\u0430\u043b\u0438\u0437\u043e\u0432\u044b\u0432\u0430\u0442\u044c […]<\/p>\n","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"author":1,"featured_media":27432,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[688],"tags":[],"class_list":["post-36632","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-administrirovanie"],"aioseo_notices":[],"aioseo_head":"\n\t\t\n\t\n\t\n\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\n","aioseo_head_json":{"title":"\ud83e\udd47Glob\u00e1ly \u2014 me\u010de-klenoty na ukladanie d\u00e1t. Rozpt\u00fdlen\u00e9 polia. \u010cas\u0165 3 | ProHoster","description":"","canonical_url":"https:\/\/prohoster.info\/sk\/blog\/administrirovanie\/globaly-mechi-kladentsy-dlya-hraneniya-dannyh-razrezhennye-massivy-chast-3","robots":"max-image-preview:large","keywords":"","webmasterTools":{"miscellaneous":""},"schema":null,"og:locale":"sk_SK","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\u0413\u043b\u043e\u0431\u0430\u043b\u044b \u2014 \u043c\u0435\u0447\u0438-\u043a\u043b\u0430\u0434\u0435\u043d\u0446\u044b \u0434\u043b\u044f \u0445\u0440\u0430\u043d\u0435\u043d\u0438\u044f \u0434\u0430\u043d\u043d\u044b\u0445. \u0420\u0430\u0437\u0440\u0435\u0436\u0435\u043d\u043d\u044b\u0435 \u043c\u0430\u0441\u0441\u0438\u0432\u044b. \u0427\u0430\u0441\u0442\u044c 3 | ProHoster","og:url":"https:\/\/prohoster.info\/sk\/blog\/administrirovanie\/globaly-mechi-kladentsy-dlya-hraneniya-dannyh-razrezhennye-massivy-chast-3","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-10-31T19:12:47+00:00","article:modified_time":"2019-10-31T19:12:47+00:00","article:publisher":"https:\/\/www.facebook.com\/prohoster","article:author":"https:\/\/www.facebook.com\/prohoster"},"aioseo_meta_data":{"post_id":"36632","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-01-22 04:12:19","breadcrumb_settings":null,"limit_modified_date":false,"reviewed_by":null,"ai":null,"created":"2021-03-01 01:41:52","updated":"2026-01-22 04:12:19","focus_keyword":null,"additional_keywords":null,"truseo_locale":null},"gt_translate_keys":[{"key":"link","format":"url"}],"_links":{"self":[{"href":"https:\/\/prohoster.info\/sk\/wp-json\/wp\/v2\/posts\/36632","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/prohoster.info\/sk\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/prohoster.info\/sk\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/prohoster.info\/sk\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/prohoster.info\/sk\/wp-json\/wp\/v2\/comments?post=36632"}],"version-history":[{"count":0,"href":"https:\/\/prohoster.info\/sk\/wp-json\/wp\/v2\/posts\/36632\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/prohoster.info\/sk\/wp-json\/wp\/v2\/media\/27432"}],"wp:attachment":[{"href":"https:\/\/prohoster.info\/sk\/wp-json\/wp\/v2\/media?parent=36632"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/prohoster.info\/sk\/wp-json\/wp\/v2\/categories?post=36632"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/prohoster.info\/sk\/wp-json\/wp\/v2\/tags?post=36632"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}