{"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\/cs\/blog\/administrirovanie\/globaly-mechi-kladentsy-dlya-hraneniya-dannyh-razrezhennye-massivy-chast-3","title":{"rendered":"Glob\u00e1ly \u2013 me\u010de-kladence pro ukl\u00e1d\u00e1n\u00ed dat. \u0158\u00eddk\u00e9 pole. \u010c\u00e1st 3","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"

\"Glob\u00e1lyV p\u0159edchoz\u00edch \u010d\u00e1stech (1<\/a><\/noindex>, 2<\/a><\/noindex>) jsme hovo\u0159ili o glob\u00e1lech jako o stromech, v t\u00e9to \u010d\u00e1sti se zam\u011b\u0159\u00edme na glob\u00e1ly jako na \u0159\u00eddk\u00e9 pole.<\/p>\n

\u0158\u00eddce pole<\/a><\/noindex> je specializovan\u00fd typ pole, ve kter\u00e9m v\u011bt\u0161ina hodnot nab\u00fdv\u00e1 stejn\u00e9 hodnoty.<\/p>\n

V praxi se \u010dasto setk\u00e1v\u00e1me s tak obrovsk\u00fdmi \u0159\u00eddk\u00fdmi poli, \u017ee nem\u00e1 smysl zbyte\u010dn\u011b zab\u00edrat pam\u011b\u0165 stejn\u00fdmi prvky. Proto m\u00e1 smysl implementovat \u0159\u00eddk\u00e1 pole tak, aby pam\u011b\u0165 nebyla vyu\u017e\u00edv\u00e1na na uchov\u00e1v\u00e1n\u00ed stejn\u00fdch hodnot.
\nV n\u011bkter\u00fdch programovac\u00edch jazyc\u00edch jsou \u0159\u00eddk\u00e1 pole sou\u010d\u00e1st\u00ed jazyka, nap\u0159\u00edklad v J<\/a><\/noindex>, MATLAB<\/a><\/noindex>. V jin\u00fdch programovac\u00edch jazyc\u00edch existuj\u00ed speci\u00e1ln\u00ed knihovny, kter\u00e9 umo\u017e\u0148uj\u00ed jejich implementaci. Pro C++ \u2014 Eigen<\/a><\/noindex> atd. <\/p>\n

Glob\u00e1ly jsou dobr\u00fdmi kandid\u00e1ty pro implementaci \u0159\u00eddk\u00fdch pol\u00ed, proto\u017ee:
\n<\/a><\/noindex><\/p>\n

    \n
  1. Ukl\u00e1daj\u00ed hodnoty pouze ur\u010dit\u00fdch uzl\u016f a neukl\u00e1daj\u00ed hodnoty nezn\u00e1m\u00fdch;<\/li>\n
  2. Rozhran\u00ed pro p\u0159\u00edstup k hodnot\u011b uzlu je velmi podobn\u00e9 zp\u016fsobu, jak\u00fdm je v mnoha programovac\u00edch jazyc\u00edch implementov\u00e1n p\u0159\u00edstup k prvku v\u00edcerozm\u011brn\u00e9ho pole.\n
    Set ^a(1, 2, 3)=5\nWrite ^a(1, 2, 3)<\/code><\/pre>\n
    \n<\/li>\n
  3. Glob\u00e1l je dostate\u010dn\u011b n\u00edzko\u00farov\u0148ov\u00e1 struktura pro ukl\u00e1d\u00e1n\u00ed dat, proto m\u00e1 vynikaj\u00edc\u00ed rychlostn\u00ed charakteristiky (od stovek tis\u00edc po des\u00edtky milion\u016f transakc\u00ed za sekundu v z\u00e1vislosti na hardwaru, viz. 1<\/a><\/noindex>)<\/li>\n<\/ol>\n
    <\/p>\n
    Jeliko\u017e je glob\u00e1l perzistentn\u00ed struktura, d\u00e1v\u00e1 smysl vytv\u00e1\u0159et \u0159\u00eddk\u00e1 pole na nich, kdy\u017e je p\u0159edem zn\u00e1mo, \u017ee objem opera\u010dn\u00ed pam\u011bti bude nedostate\u010dn\u00fd.<\/p><\/blockquote>\n
    \nJedn\u00edm z vlastnost\u00ed implementac\u00ed \u0159\u00eddk\u00fdch pol\u00ed je vracen\u00ed ur\u010dit\u00e9 v\u00fdchoz\u00ed hodnoty, pokud se p\u0159istupuje k nezn\u00e1m\u00e9 bu\u0148ce.<\/p>\n
    To lze implementovat pomoc\u00ed funkce $GET<\/a><\/noindex> v COS. V tomto p\u0159\u00edkladu je uvedeno 3D pole.<\/p>\n
    SET a = $GET(^a(x,y,z), defValue)<\/code><\/pre>\n
    \nV jak\u00fdch \u00faloh\u00e1ch jsou tedy \u0159\u00eddk\u00e1 pole pot\u0159ebn\u00e1 a jak mohou glob\u00e1ly pomoct?<\/p>\n
    Matice sousednosti (spojenosti)<\/h2>\n
    \nTakov\u00e9 matice<\/a><\/noindex> se pou\u017e\u00edvaj\u00ed k reprezentaci graf\u016f:<\/p>\n
    \"Glob\u00e1ly
    \n
    \nJe z\u0159ejm\u00e9, \u017ee \u010d\u00edm v\u011bt\u0161\u00ed je graf, t\u00edm v\u00edce nul bude v matici. Pokud nap\u0159\u00edklad vezmeme graf soci\u00e1ln\u00ed s\u00edt\u011b a p\u0159edstav\u00edme si jej ve form\u011b podobn\u00e9 matice, bude t\u00e9m\u011b\u0159 cel\u00fd tvo\u0159en nulami, tj. bude \u0159\u00eddk\u00fdm polem.<\/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 p\u0159\u00edkladu uchov\u00e1v\u00e1me v glob\u00e1lu ^m<\/strong> matice spojen\u00ed a tak\u00e9 po\u010det hran u ka\u017ed\u00e9ho uzlu (kdo s k\u00fdm p\u0159\u00e1tel\u00ed a po\u010det p\u0159\u00e1tel).<\/p>\n
    Pokud je v\u0161ak po\u010det prvk\u016f v grafu maxim\u00e1ln\u011b 29 milion\u016f (toto \u010d\u00edslo je br\u00e1no jako sou\u010din 8 * maxim\u00e1ln\u00ed velikost \u0159et\u011bzce<\/a><\/noindex>), existuje je\u0161t\u011b \u00fasporn\u011bj\u0161\u00ed zp\u016fsob ukl\u00e1d\u00e1n\u00ed takov\u00fdch matic \u2014 bitov\u00e9 \u0159et\u011bzce, proto\u017ee se jejich realizac\u00ed speci\u00e1ln\u011b optimalizuj\u00ed velk\u00e9 mezery.<\/p>\n
    Manipulace s bitov\u00fdmi \u0159et\u011bzci se prov\u00e1d\u00ed funkc\u00ed $BIT<\/a><\/noindex>. <\/p>\n
    ; nastaven\u00ed bitu\nSET $BIT(rowID, positionID) = 1\n; z\u00edsk\u00e1n\u00ed bitu\nWrite $BIT(rowID, positionID)\n<\/code><\/pre>\n
    <\/p>\n
    Tabulka p\u0159echod\u016f kone\u010dn\u00e9ho automatu<\/h2>\n
    \nProto\u017ee graf p\u0159echod\u016f kone\u010dn\u00e9ho automatu je oby\u010dejn\u00fd graf, tabulka p\u0159echod\u016f kone\u010dn\u00e9ho automatu je tak\u00e9 stejn\u00e1 matice sousednosti, o kter\u00e9 se hovo\u0159ilo v\u00fd\u0161e.<\/p>\n
    Hern\u00ed automaty<\/h2>\n
    \n\"Glob\u00e1ly
    \n
    \nNejzn\u00e1m\u011bj\u0161\u00ed hern\u00ed automat \u2014     hra \u201e\u017divot\u201c<\/a><\/noindex>, kter\u00e1 d\u00edky sv\u00fdm pravidl\u016fm (kdy\u017e m\u00e1 bu\u0148ka mnoho soused\u016f \u2014 um\u00edr\u00e1) p\u0159edstavuje \u0159\u00eddk\u00e9 pole.<\/p>\n
    Stephen Wolfram tvrd\u00ed, \u017ee hern\u00ed automaty jsou novou oblast\u00ed v\u011bdy<\/a><\/noindex>. V roce 2002 vyd\u00e1v\u00e1 1280str\u00e1nkovou knihu \u201eA New Kind of Science\u201c, kde \u0161iroce argumentuje, \u017ee \u00fasp\u011bchy v oblasti hern\u00edch automat\u016f nejsou izolovan\u00e9, ale jsou velmi stabiln\u00ed a maj\u00ed velk\u00fd v\u00fdznam pro v\u0161echny oblasti v\u011bdy.<\/p>\n
    Bylo prok\u00e1z\u00e1no, \u017ee jak\u00fdkoli algoritmus provediteln\u00fd na po\u010d\u00edta\u010di lze realizovat prost\u0159ednictv\u00edm hern\u00edho automatu. Hern\u00ed automaty se pou\u017e\u00edvaj\u00ed k modelov\u00e1n\u00ed dynamick\u00fdch prost\u0159ed\u00ed a syst\u00e9m\u016f, k \u0159e\u0161en\u00ed algoritmick\u00fdch \u00faloh a k dal\u0161\u00edm \u00fa\u010del\u016fm.<\/p>\n
    Pokud m\u00e1me obrovsk\u00e9 pole a pot\u0159ebujeme zaznamen\u00e1vat v\u0161echny mezistavy hern\u00edho automatu, je rozumn\u00e9 pou\u017e\u00edt glob\u00e1ln\u00ed prom\u011bnn\u00e9.<\/p>\n
    Kartografie<\/h2>\n
    \nPrvn\u00ed, co m\u011b napadne, kdy\u017e se hovo\u0159\u00ed o vyu\u017eit\u00ed \u0159\u00eddk\u00fdch pol\u00ed, jsou kartografick\u00e9 \u00fakoly.<\/p>\n
    Jak je zn\u00e1mo, na map\u00e1ch je hodn\u011b pr\u00e1zdn\u00e9ho prostoru. Pokud bychom mapu zobrazovali ve velk\u00fdch pixelech, 71% pixel\u016f Zem\u011b by bylo obsazeno oce\u00e1nem. \u0158\u00eddk\u00e9 pole. A pokud bychom zakreslovali pouze d\u00edla lidsk\u00fdch rukou, pr\u00e1zdn\u00e9ho prostoru by bylo v\u00edce ne\u017e 95%.<\/p>\n
    Samoz\u0159ejm\u011b, \u017ee nikdo neukl\u00e1d\u00e1 mapy jako rastrov\u00e1 pole, pou\u017e\u00edv\u00e1 se vektorov\u00e9 zn\u00e1zorn\u011bn\u00ed.
    \nAle co vlastn\u011b vektorov\u00e9 mapy p\u0159edstavuj\u00ed? To je jak\u00e1si kostra a z bod\u016f slo\u017een\u00e9 polylinie a mnoho\u00faheln\u00edky.
    \nFakticky je to datab\u00e1ze bod\u016f a vazeb mezi nimi.<\/p>\n
    Jedn\u00edm z nejambici\u00f3zn\u011bj\u0161\u00edch \u00fakol\u016f mapov\u00e1n\u00ed je mise mapov\u00e1n\u00ed na\u0161\u00ed galaxie teleskopem Gaia. Metaforicky \u0159e\u010deno, na\u0161e galaxie, stejn\u011b jako cel\u00fd vesm\u00edr, je rozpt\u00fdlen\u00e1: obrovsk\u00e9 prostory pr\u00e1zdnoty, ve kter\u00fdch jsou vz\u00e1cn\u00e9 mal\u00e9 body \u2014 hv\u011bzdy. Pr\u00e1zdn\u00e9ho m\u00edsta je 99,999999…….%. Pro uchov\u00e1n\u00ed mapy na\u0161\u00ed galaxie byla vybr\u00e1na datab\u00e1ze na glob\u00e1ln\u00edch \u2014 Cach\u00e9.<\/p>\n
    Nev\u00edm p\u0159esnou strukturu glob\u00e1l\u016f v tomto projektu, mohu se domn\u00edvat, \u017ee je to n\u011bco podobn\u00e9ho:<\/p>\n
    Set ^galaxy(b, l, d) = 1; \u010c\u00edslo hv\u011bzdy podle katalogu, pokud je k dispozici\nSet ^galaxy(b, l, d, \"name\") = \"Slunce\"\nSet ^galaxy(b, l, d, \"type\") = \"norm\u00e1ln\u00ed\"; varianty blackhole, quazar, red_dwarf atd.\nSet ^galaxy(b, l, d, \"weight\") = 14E50\nSet ^galaxy(b, l, d, \"planetes\") = 7\nSet ^galaxy(b, l, d, \"planetes\", 1) = \"Merkur\"\nSet ^galaxy(b, l, d, \"planetes\", 1, weight) = 1E20\n...\n<\/code><\/pre>\n
    \nKde b, l, d \u2014 to jsou galaktick\u00e9 sou\u0159adnice \u0161\u00ed\u0159ka, d\u00e9lka<\/a><\/noindex> a vzd\u00e1lenost od Slunce.<\/i><\/p>\n
    Flexibiln\u00ed struktura glob\u00e1l\u016f umo\u017e\u0148uje udr\u017eovat jak\u00e9koli pot\u0159ebn\u00e9 charakteristiky hv\u011bzd a planet, proto\u017ee datab\u00e1ze na glob\u00e1lech jsou bezsch\u00e9mov\u00e9 (scheme-less).<\/p>\n
    Pro ukl\u00e1d\u00e1n\u00ed mapy na\u0161\u00ed vesm\u00edru byla Cach\u00e9 vybr\u00e1na nejen kv\u016fli flexibilit\u011b, ale i schopnosti velmi rychle ukl\u00e1dat tok dat, p\u0159i\u010dem\u017e z\u00e1rove\u0148 vytv\u00e1\u0159ela indexov\u00e9 glob\u00e1ly pro rychl\u00e9 vyhled\u00e1v\u00e1n\u00ed.<\/p>\n
    Pokud se vr\u00e1t\u00edme na Zemi, byly na glob\u00e1lech vytvo\u0159eny kartografick\u00e9 projekty OpenStreetMap XAPI<\/a><\/noindex> a fork OpenStreetMap \u2014 FOSM<\/a><\/noindex>.<\/p>\n
    Ned\u00e1vno na hackathonu Cach\u00e9<\/a><\/noindex> byly realizov\u00e1ny geospati\u00e1ln\u00ed indexy Geospatial<\/a><\/noindex>. \u010cek\u00e1me od autor\u016f \u010dl\u00e1nku podrobnosti o realizaci.<\/p>\n
    Realizace prostorov\u00fdch index\u016f na glob\u00e1lu v OpenStreetMap XAPI<\/h3>\n
    \nObr\u00e1zky jsou p\u0159evzaty z t\u00e9to prezentace<\/a><\/noindex>.<\/p>\n
    Cel\u00e1 zem\u011bkoule je rozd\u011blena na \u010dtverce, pak na pod\u010dtverce a pod\u010dtverce na pod-pod\u010dtverce a tak d\u00e1le. Obecn\u011b dost\u00e1v\u00e1me hierarchickou strukturu, pro jej\u00ed\u017e uchov\u00e1v\u00e1n\u00ed byly vytvo\u0159eny glob\u00e1ly.<\/p>\n
    \"Glob\u00e1ly
    \n
    \nV jak\u00e9mkoli okam\u017eiku m\u016f\u017eeme prakticky okam\u017eit\u011b po\u017eadovat pot\u0159ebn\u00fd \u010dtverec, nebo ho vy\u010distit, p\u0159i\u010dem\u017e v\u0161echny pod\u010dtverce budou tak\u00e9 vr\u00e1ceny nebo vy\u010di\u0161t\u011bny.<\/p>\n
    Podobnou sch\u00e9ma na glob\u00e1lech lze realizovat n\u011bkolika zp\u016fsoby.<\/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) = idPrvn\u00edBod\nSet ^m(a, b, a, c, d, a, b, c, d, a, b, a, c, d, a, b, c, d, a, 2) = idDruh\u00fdBod\n...<\/code><\/pre>\n
    \nVarianta 2:<\/p>\n
    Set ^m('abacdabcdabacdabcda', 1) = idPrvn\u00edBod\nSet ^m('abacdabcdabacdabcda', 2) = idDruh\u00fdBod\n...<\/code><\/pre>\n
    \nV obou p\u0159\u00edpadech nen\u00ed probl\u00e9m \u017e\u00e1dat o body um\u00edst\u011bn\u00e9 v \u010dtverci jak\u00e9koli \u00farovn\u011b na COS\/M. O n\u011bco snaz\u0161\u00ed bude \u010distit \u010dtvercov\u00e9 \u00faseky prostoru jak\u00e9koli \u00farovn\u011b v prvn\u00edm variant\u011b, ale to je z\u0159\u00eddka pot\u0159eba.<\/p>\n
    P\u0159\u00edklad jednoho z \u010dtverc\u016f nejni\u017e\u0161\u00ed \u00farovn\u011b:<\/p>\n
    \"Glob\u00e1ly
    \n
    \nA zde je n\u011bkolik glob\u00e1l\u016f z projektu XAPI: zobrazen\u00ed indexu na glob\u00e1lech:<\/p>\n
    \"Glob\u00e1ly
    \n
    \nGlob\u00e1l ^way<\/strong> se pou\u017e\u00edv\u00e1 k ukl\u00e1d\u00e1n\u00ed bod\u016f     polylini\u00ed<\/a><\/noindex> (silnice, drobn\u00e9 \u0159eky atd.) a polygon\u016f (uzav\u0159en\u00e9 oblasti: budovy, lesy atd.).<\/p>\n
    Hrub\u00e1 klasifikace vyu\u017eit\u00ed \u0159\u00eddk\u00fdch pol\u00ed na glob\u00e1lech.<\/h2>\n
    <\/p>\n
      \n
    1. Ukl\u00e1d\u00e1me sou\u0159adnice ur\u010dit\u00fdch objekt\u016f a jejich stavy (mapov\u00e1n\u00ed, bun\u011b\u010dn\u00e9 automaty)<\/li>\n
    2. Ukl\u00e1d\u00e1me \u0159\u00eddk\u00e9 matice.<\/li>\n<\/ol>\n
      \nV p\u0159\u00edpad\u011b 2) p\u0159i dotazu na konkr\u00e9tn\u00ed sou\u0159adnici, kde prvku nen\u00ed p\u0159i\u0159azena hodnota, bychom m\u011bli obdr\u017eet v\u00fdchoz\u00ed hodnotu prvku \u0159\u00eddk\u00e9ho pole.<\/p>\n
      Bonusy, kter\u00e9 z\u00edsk\u00e1v\u00e1me p\u0159i ukl\u00e1d\u00e1n\u00ed v\u00edcerozm\u011brn\u00fdch matic na glob\u00e1lech<\/h2>\n
      \nRychl\u00e9 odstran\u011bn\u00ed a\/nebo v\u00fdb\u011br \u00fasek\u016f prostoru n\u00e1sobk\u016f \u0159\u00e1dk\u016f, rovin, kostek atd.<\/b> Pro p\u0159\u00edpady, kdy se pou\u017e\u00edvaj\u00ed celo\u010d\u00edseln\u00e9 indexy, se m\u016f\u017ee uk\u00e1zat jako u\u017eite\u010dn\u00e1 mo\u017enost rychl\u00e9ho odstran\u011bn\u00ed a\/nebo v\u00fdb\u011bru \u00fasek\u016f prostoru n\u00e1sobk\u016f \u0159\u00e1dk\u016f, rovin, kostek atd.<\/p>\n
      P\u0159\u00edkazem Kill<\/a><\/noindex> m\u016f\u017eeme odstranit jak jednotliv\u00fd prvek, tak i \u0159\u00e1dek a dokonce celou rovinu. D\u00edky vlastnostem glob\u00e1l\u016f to prob\u00edh\u00e1 velmi rychle \u2014 tis\u00edckr\u00e1t rychleji ne\u017e poelementov\u00e9 odstran\u011bn\u00ed.<\/p>\n
      Na obr\u00e1zku je zn\u00e1zorn\u011bna trojrozm\u011brn\u00e1 matice v glob\u00e1lu ^a<\/strong> a r\u016fzn\u00e9 druhy odstran\u011bn\u00ed.<\/p>\n
      \"Glob\u00e1ly
      \n
      \nPro v\u00fdb\u011br \u00fasek\u016f prostoru podle zn\u00e1m\u00fdch index\u016f lze pou\u017e\u00edt p\u0159\u00edkaz       Merge<\/a><\/noindex>.<\/p>\n
      V\u00fdb\u011br sloupce matice do prom\u011bnn\u00e9 Column:<\/p>\n
      ; Definujeme trojrozm\u011brn\u00e9 \u0159\u00eddk\u00e9 pole 3x3x3\nSet ^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\nMerge Column = ^a(2,2)\n; Zobraz\u00edme prom\u011bnnou Column\nZwrite Column\n<\/code><\/pre>\n
      \nV\u00fdstup:<\/p>\n
      Column(0)=1\nColumn(2)=1\n<\/code><\/pre>\n
      \nCo je zaj\u00edmav\u00e9, \u017ee v prom\u011bnn\u00e9 Column m\u00e1me tak\u00e9 \u0159\u00eddkou matici, k n\u00ed\u017e je t\u0159eba p\u0159istupovat tak\u00e9 p\u0159es $GET<\/a><\/noindex>, proto\u017ee v n\u00ed nejsou ulo\u017eeny v\u00fdchoz\u00ed hodnoty.<\/p>\n
      V\u00fdb\u011br \u00fasek\u016f prostoru m\u016f\u017ee b\u00fdt tak\u00e9 prov\u00e1d\u011bn prost\u0159ednictv\u00edm mal\u00e9 aplikace s vyu\u017eit\u00edm funkce $Order<\/a><\/noindex>. To je obzvl\u00e1\u0161t\u011b pohodln\u00e9 v prostorech, jejich\u017e indexy nejsou kvantizov\u00e1ny (mapov\u00e1n\u00ed).<\/p>\n
      Z\u00e1v\u011br<\/h2>\n
      \nSou\u010dasn\u00e1 doba klade nov\u00e9 ambici\u00f3zn\u00ed \u00fakoly. Grafy mohou m\u00edt miliardy vrchol\u016f, mapy miliardy bod\u016f a n\u011bkdo si dokonce m\u016f\u017ee p\u0159\u00e1t spustit sv\u016fj vlastn\u00ed vesm\u00edr na bun\u011b\u010dn\u00fdch automatech (1<\/a><\/noindex>, 2<\/a><\/noindex>).<\/p>\n
      Kdy\u017e objem dat \u0159\u00eddk\u00fdch pol\u00ed ji\u017e nem\u016f\u017ee b\u00fdt um\u00edst\u011bn do opera\u010dn\u00ed pam\u011bti a je t\u0159eba s nimi pracovat, stoj\u00ed za zv\u00e1\u017een\u00ed realizace takov\u00fdch projekt\u016f na glob\u00e1ln\u00edch a COS.<\/p>\n
      D\u011bkujeme za pozornost! T\u011b\u0161\u00edme se na va\u0161e ot\u00e1zky a p\u0159\u00e1n\u00ed v koment\u00e1\u0159\u00edch.<\/p>\n
      Pozn\u00e1mka<\/b>: Tento \u010dl\u00e1nek a m\u00e9 koment\u00e1\u0159e k n\u011bmu p\u0159edstavuj\u00ed m\u016fj n\u00e1zor a nemaj\u00ed nic spole\u010dn\u00e9ho s ofici\u00e1ln\u00edm postojem spole\u010dnosti 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\u00e1ln\u00ed \u2014 me\u010de-kladen\u00e9 pro ukl\u00e1d\u00e1n\u00ed dat. \u0158\u00eddk\u00e9 pole. \u010c\u00e1st 3 | ProHoster","description":"","canonical_url":"https:\/\/prohoster.info\/cs\/blog\/administrirovanie\/globaly-mechi-kladentsy-dlya-hraneniya-dannyh-razrezhennye-massivy-chast-3","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\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\/cs\/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\/cs\/wp-json\/wp\/v2\/posts\/36632","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=36632"}],"version-history":[{"count":0,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/posts\/36632\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/media\/27432"}],"wp:attachment":[{"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/media?parent=36632"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/categories?post=36632"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/prohoster.info\/cs\/wp-json\/wp\/v2\/tags?post=36632"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}