{"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\/hr\/blog\/administrirovanie\/globaly-mechi-kladentsy-dlya-hraneniya-dannyh-razrezhennye-massivy-chast-3","title":{"rendered":"Globale - ma\u010devi-blagodati za pohranu podataka. Raspodijeljeni nizovi. Dio 3","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"

\"GlobaleU prethodnim delovima (1<\/a><\/noindex>, 2<\/a><\/noindex>) govorili smo o globalima kao o stablima, u ovom delu \u0107emo razmotriti globale kao retke nizove.<\/p>\n

Retki niz<\/a><\/noindex> je vrsta niza u kojem ve\u0107ina vrednosti ima istu vrednost.<\/p>\n

U praksi, \u010desto se susre\u0107u tako ogromni retki nizovi da nema smisla tro\u0161iti memoriju na iste elemente. Stoga ima smisla implementirati retke nizove tako da memorija ne bude tro\u0161ena na \u010duvanje istih vrednosti.
\nU nekim programskim jezicima retki nizovi su deo jezika, na primer u J<\/a><\/noindex>, MATLAB<\/a><\/noindex>. U drugim programskim jezicima postoje posebne biblioteke koje omogu\u0107avaju njihovu implementaciju. Za C++ \u2014 Eigen<\/a><\/noindex> i dr. <\/p>\n

Globali su dobri kandidati za implementaciju retkih nizova jer:
\n<\/a><\/noindex><\/p>\n

    \n
  1. \u010cuvaju vrednosti samo odre\u0111enih \u010dvorova i ne \u010duvaju vrednosti neodre\u0111enih;<\/li>\n
  2. Interfejs za pristup vrednosti \u010dvora je izuzetno sli\u010dan na\u010dinu kako je u mnogim programskim jezicima implementiran pristup elementima vi\u0161edimenzionalnog niza.\n
    Set ^a(1, 2, 3)=5\nWrite ^a(1, 2, 3)<\/code><\/pre>\n
    \n<\/li>\n
  3. Global je dovoljno niskonivo struktura za skladi\u0161tenje podataka, stoga ima odli\u010dne karakteristike brzine (od stotina hiljada do desetina miliona transakcija u sekundi, u zavisnosti od hardvera, vidi. 1<\/a><\/noindex>)<\/li>\n<\/ol>\n
    <\/p>\n
    Budu\u0107i da je global perzistentna struktura, ima smisla praviti retke nizove na njima kada je unapred poznato da \u0107e kapacitet RAM-a biti nedovoljan.<\/p><\/blockquote>\n
    \nJedna od osobina implementacija retkih nizova je vra\u0107anje nekog podrazumevanog vrednosti, ako se pristupa neodre\u0111enoj \u0107eliji.<\/p>\n
    To se mo\u017ee implementirati kori\u0161\u0107enjem funkcije $GET<\/a><\/noindex> u COS. U ovom primeru razmatramo trodimenzionalni niz.<\/p>\n
    SET a = $GET(^a(x,y,z), defValue)<\/code><\/pre>\n
    \nU kojim zadacima su potrebni retki nizovi i kako globali mogu pomo\u0107i?<\/p>\n
    Matrica susedstva (povezanosti)<\/h2>\n
    \nTakve matrice<\/a><\/noindex> se koriste za predstavljanje grafova:<\/p>\n
    \"Globale
    \n
    \nO\u010digledno je da \u0161to je graf ve\u0107i, to \u0107e vi\u0161e nula biti u matrici. Na primer, ako uzmemo graf dru\u0161tvene mre\u017ee i predstavimo ga u obliku sli\u010dne matrice, on \u0107e gotovo u potpunosti biti sa\u010dinjen od nula, tj. bi\u0107e re\u0111i niz.<\/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
    \nU ovom primeru \u010duvamo u globalu ^m<\/strong> matrica povezanosti, kao i broj bridova za svaki \u010dvor (tko se s kim dru\u017ei i broj prijatelja).<\/p>\n
    Ako broj elemenata u grafu ne prelazi 29 milijuna (taj se broj uzima kao umno\u017eak 8 * maksimalna veli\u010dina niza<\/a><\/noindex>), postoji jo\u0161 ekonomi\u010dniji na\u010din pohrane takvih matrica \u2014 bitni nizovi, jer se u njihovoj implementaciji posebno optimiziraju veliki prazni prostori.<\/p>\n
    Manipulacije s bitnim nizovima izvode se funkcijom $BIT<\/a><\/noindex>. <\/p>\n
    ; postavljanje bita\nSET $BIT(rowID, positionID) = 1\n; dobivanje bita\nWrite $BIT(rowID, positionID)\n<\/code><\/pre>\n
    <\/p>\n
    Tablica prijelaza kona\u010dnog automata<\/h2>\n
    \nBudu\u0107i da je graf prijelaza kona\u010dnog automata obi\u010dan graf, tako je i tablica prijelaza kona\u010dnog automata ista ona matrica susjednosti o kojoj je ranije bilo rije\u010di.<\/p>\n
    \u0106elijski automati<\/h2>\n
    \n\"Globale
    \n
    \nNajpoznatiji \u0107elijski automat je     igra '\u017divot'<\/a><\/noindex>, koja zbog svojih pravila (kada \u0107elija ima mnogo susjeda \u2014 umire) predstavlja rijetki niz.<\/p>\n
    Stephen Wolfram smatra da su \u0107elijski automati nova grana znanosti<\/a><\/noindex>. Godine 2002. objavljuje knjigu od 1280 stranica 'A New Kind of Science', gdje \u0161iroko argumentira da dostignu\u0107a u podru\u010dju \u0107elijskih automata nisu izolirana, ve\u0107 su vrlo stabilna i imaju veliku va\u017enost za sve grane znanosti.<\/p>\n
    Dokazano je da se svaki algoritam koji se mo\u017ee izvr\u0161iti na ra\u010dunalu mo\u017ee realizirati pomo\u0107u \u0107elijskog automata. \u0106elijski automati se koriste za modeliranje dinami\u010dkih okru\u017eenja i sustava, za rje\u0161avanje algoritamskih zadataka i druge svrhe.<\/p>\n
    Ako imamo ogroman teren i trebamo zapisati sve me\u0111ustanja \u0107elijskog automata, sasvim je razborito koristiti globalne varijable.<\/p>\n
    Kartografija<\/h2>\n
    \nPrvo \u0161to mi pada na pamet kada se govori o upotrebi rijetkih nizova su kartografski zadaci.<\/p>\n
    Op\u0107enito, na kartama ima jako puno praznog prostora. Ako bismo kartu predstavljali velikim pikselima, 71% piksel\u00e2 Zemlje bi bilo zauzeto oceanom. Rijetki niz. A ako prikazujemo samo djela ljudskih ruku, tada \u0107e praznog prostora biti vi\u0161e od 95%.<\/p>\n
    Naravno, nitko ne pohranjuje karte u obliku rasternih nizova, ve\u0107 se koristi vektorsko predstavljanje.
    \nAli \u0161to predstavljaju vektorske karte? To je neka okvir i polilinije i poligoni koji se sastoje od to\u010daka.
    \nZapravo, baza podataka to\u010daka i veza izme\u0111u njih.<\/p>\n
    \u041e\u0434\u043d\u0430 \u0438\u0437 \u0441\u0430\u043c\u044b\u0445 \u0430\u043c\u0431\u0438\u0446\u0438\u043e\u0437\u043d\u044b\u0445 \u0437\u0430\u0434\u0430\u0447 \u043a\u0430\u0440\u0442\u0438\u0440\u043e\u0432\u0430\u043d\u0438\u044f \u2014 \u044d\u0442\u043e \u043c\u0438\u0441\u0441\u0438\u044f \u043a\u0430\u0440\u0442\u0438\u0440\u043e\u0432\u0430\u043d\u0438\u044f \u043d\u0430\u0448\u0435\u0439 \u0433\u0430\u043b\u0430\u043a\u0442\u0438\u043a\u0438 \u0442\u0435\u043b\u0435\u0441\u043a\u043e\u043f\u043e\u043c \u0413\u0430\u0439\u044f. \u041e\u0431\u0440\u0430\u0437\u043d\u043e \u0433\u043e\u0432\u043e\u0440\u044f, \u043d\u0430\u0448\u0430 \u0433\u0430\u043b\u0430\u043a\u0442\u0438\u043a\u0430, \u043a\u0430\u043a \u0438 \u0432\u0441\u044f \u0432\u0441\u0435\u043b\u0435\u043d\u043d\u0430\u044f \u0435\u0441\u0442\u044c \u0441\u043f\u043b\u043e\u0448\u043d\u043e\u0439 \u0440\u0430\u0437\u0440\u0435\u0436\u0435\u043d\u043d\u044b\u0439 \u043c\u0430\u0441\u0441\u0438\u0432: \u043e\u0433\u0440\u043e\u043c\u043d\u044b\u0435 \u043f\u0440\u043e\u0441\u0442\u0440\u0430\u043d\u0441\u0442\u0432\u0430 \u043f\u0443\u0441\u0442\u043e\u0442\u044b, \u0432 \u043a\u043e\u0442\u043e\u0440\u044b\u0445 \u0435\u0441\u0442\u044c \u0440\u0435\u0434\u043a\u0438\u0435 \u043c\u0430\u043b\u0435\u043d\u044c\u043a\u0438\u0435 \u0442\u043e\u0447\u043a\u0438 \u2014 \u0437\u0432\u0451\u0437\u0434\u044b. \u041f\u0443\u0441\u0442\u043e\u0433\u043e \u043c\u0435\u0441\u0442\u0430 99,999999…….%. \u0414\u043b\u044f \u0445\u0440\u0430\u043d\u0435\u043d\u0438\u044f \u043a\u0430\u0440\u0442\u044b \u043d\u0430\u0448\u0435\u0439 \u0433\u0430\u043b\u0430\u043a\u0442\u0438\u043a\u0438 \u0431\u044b\u043b\u0430 \u0432\u044b\u0431\u0440\u0430\u043d\u0430 \u0431\u0430\u0437\u0430 \u0434\u0430\u043d\u043d\u044b\u0445 \u043d\u0430 \u0433\u043b\u043e\u0431\u0430\u043b\u0430\u0445 \u2014 Cach\u00e9.<\/p>\n
    Ne znam to\u010dnu strukturu global\u00e2 u ovom projektu, mogu pretpostaviti da je to ne\u0161to sli\u010dno:<\/p>\n
    Set ^galaxy(b, l, d) = 1; \u041d\u043e\u043c\u0435\u0440 \u0437\u0432\u0435\u0437\u0434\u044b \u043f\u043e \u043a\u0430\u0442\u0430\u043b\u043e\u0433\u0443, \u0435\u0441\u043b\u0438 \u0435\u0441\u0442\u044c\nSet ^galaxy(b, l, d, "name") = "Sun"\nSet ^galaxy(b, l, d, "type") = "normal" ; \u0432\u0430\u0440\u0438\u0430\u043d\u0442\u044b blackhole, quazar, red_dwarf \u0438 \u0442.\u0434.\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
    \nGdje b, l, d \u2014 to su galakti\u010dke koordinate \u0161irina, du\u017eina<\/a><\/noindex> i udaljenost do Sunca.<\/i><\/p>\n
    Fleksibilna struktura global\u00e2 omogu\u0107ava pohranu svih potrebnih karakteristika zvijezda i planeta, budu\u0107i da baze na globalima nemaju shemu (scheme-less).<\/p>\n
    Za pohranu karte na\u0161eg svemira Cach\u00e9 je odabrana ne samo zbog fleksibilnosti, ve\u0107 i zbog sposobnosti vrlo brzo pohranjivati tok podataka, pri \u010demu se istovremeno stvaraju indeksni globali za brzu pretragu.<\/p>\n
    Vratimo li se zemlji, na globalima su stvoreni kartografski projekti OpenStreetMap XAPI<\/a><\/noindex> i fork OpenStreetMap \u2014 FOSM<\/a><\/noindex>.<\/p>\n
    Nedavno su na Cach\u00e9 hackathonu<\/a><\/noindex> proveli su se geoprostoreindeksi Geospatial<\/a><\/noindex>. O\u010dekujemo od autora \u010dlanka detalje implementacije.<\/p>\n
    Implementacija prostornog indeksa na globalu u OpenStreetMap XAPI<\/h3>\n
    \nSlike su preuzete iz ove prezentacije<\/a><\/noindex>.<\/p>\n
    Cijela zemaljska kugla dijeli se na kvadrate, zatim podkvadrate, a podkvadrati na pod-podkvadrate i tako dalje. Uglavnom, dobivamo hijerarhijsku strukturu za pohranu kojoj su stvoreni globali.<\/p>\n
    \"Globale
    \n
    \nU bilo kojem trenutku mo\u017eemo prakti\u010dki odmah zatra\u017eiti potrebni kvadrat ili ga o\u010distiti, pri \u010demu \u0107e svi podkvadrati tako\u0111er biti vra\u0107eni ili o\u010di\u0161\u0107eni.<\/p>\n
    Sli\u010dnu shemu na globalima mogu\u0107e je realizirati na nekoliko na\u010dina.<\/p>\n
    Opcija 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) = idPrveTo\u010dke\nSet ^m(a, b, a, c, d, a, b,c, d, a, b, a, c, d, a, b,c, d, a, 2) = idDrugeTo\u010dke\n...<\/code><\/pre>\n
    \nOpcija 2:<\/p>\n
    Set ^m('abacdabcdabacdabcda', 1) = idPrveTo\u010dke\nSet ^m('abacdabcdabacdabcda', 2) = idDrugeTo\u010dke\n...<\/code><\/pre>\n
    \nU oba slu\u010daja nije te\u0161ko zatra\u017eiti to\u010dke unutar kvadrata bilo kojeg nivoa na COS\/M. Bit \u0107e ne\u0161to lak\u0161e o\u010distiti kvadratne dijelove prostora bilo kojeg nivoa u prvom slu\u010daju, no to je rijetko potrebno.<\/p>\n
    Primjer jednog od kvadrati\u0107a donjeg nivoa:<\/p>\n
    \"Globale
    \n
    \nEvo nekoliko globalnih varijabli iz projekta XAPI: prikaz indeksa na globalima:<\/p>\n
    \"Globale
    \n
    \nGlobalna varijabla ^way<\/strong> koristi se za pohranu to\u010daka     polilinija<\/a><\/noindex> (puteva, malih rijeka i sl.) i poligona (zatvorene povr\u0161ine: zgrade, \u0161ume itd.).<\/p>\n
    Gruba klasifikacija kori\u0161tenja rijetkih nizova na globalima.<\/h2>\n
    <\/p>\n
      \n
    1. Pohranjujemo koordinate odre\u0111enih objekata i njihova stanja (mapiranje, stani\u010dni automati)<\/li>\n
    2. Pohranjujemo rijetke matrice.<\/li>\n<\/ol>\n
      \nZa slu\u010daj 2) pri zahtjevu za odre\u0111enom koordinatom, gdje elementu nije dodijeljena vrijednost, trebamo dobiti zadanu vrijednost elementa rijetkog niza.<\/p>\n
      Bodovi koje dobijamo prilikom pohrane vi\u0161edimenzionalnih matrica u globalima<\/h2>\n
      \nBrzo brisanje i\/ili uzimanje dijelova prostora, vi\u0161ekratnih po redovima, ravninama, kockama itd.<\/b> Za slu\u010dajeve kada se koriste cijeli brojevi kao indeksi, mo\u017ee biti korisna mogu\u0107nost brzog brisanja i\/ili uzimanja dijelova prostora, vi\u0161ekratnih po redovima, ravninama, kockama itd.<\/p>\n
      Naredbom Kill<\/a><\/noindex> mo\u017eemo ukloniti kao pojedina\u010dni element, tako i redak, pa \u010dak i cijelu ravninu. Zahvaljuju\u0107i svojstvima globalnih varijabli, to se doga\u0111a vrlo brzo \u2014 tisu\u0107ama puta br\u017ee nego element po element.<\/p>\n
      Na slici je prikazana trodimenzionalna matrica u globalnoj varijabli ^a<\/strong> i razli\u010diti tipovi brisanja.<\/p>\n
      \"Globale
      \n
      \nZa uzimanje dijelova prostora prema poznatim indeksima mo\u017ee se koristiti komanda       Merge<\/a><\/noindex>.<\/p>\n
      Uzimanje stupca matrice u varijablu Column:<\/p>\n
      ; Definirajmo trodimenzionalni rijetki niz 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; Ispi\u0161imo varijablu Column\nZwrite Column\n<\/code><\/pre>\n
      \nIzvje\u0161taj:<\/p>\n
      Column(0)=1\nColumn(2)=1\n<\/code><\/pre>\n
      \n\u0160to je zanimljivo, u varijabli Column tako\u0111er imamo rijetki niz, na koji se treba obratiti tako\u0111er kroz $GET<\/a><\/noindex>, jer se u njemu ne pohranjuju zadane vrijednosti.<\/p>\n
      Uzimanje dijelova prostora tako\u0111er se mo\u017ee raditi kroz malu aplikaciju kori\u0161tenjem funkcije $Order<\/a><\/noindex>. Ovo je posebno zgodno u prostorima \u010diji su indeksi nekvantizirani (karta).<\/p>\n
      Zaklju\u010dak<\/h2>\n
      \nSada\u0161nje vrijeme postavlja nove ambiciozne zadatke. Grafovi mogu imati milijarde \u010dvorova, karte milijarde to\u010daka, a netko \u010dak mo\u017ee po\u017eeljeti pokrenuti vlastiti svemir na stani\u010dnim automatima (1<\/a><\/noindex>, 2<\/a><\/noindex>).<\/p>\n
      Kada volumen podataka rijetkih nizova vi\u0161e ne mo\u017ee stati u radnu memoriju, a potrebno je raditi s njima, valja razmotriti mogu\u0107nost implementacije sli\u010dnih projekata na globalima i COS.<\/p>\n
      Hvala na pa\u017enji! O\u010dekujemo va\u0161a pitanja i sugestije u komentarima.<\/p>\n
      Odricanje<\/b>: Ovaj \u010dlanak i moji komentari su moje mi\u0161ljenje i nemaju veze s slu\u017ebenim stavom korporacije InterSystems.<\/i>
      \n
      Izvor:       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\udd47Globali \u2014 \u010darobne ma\u010deve za pohranu podataka. Rijetki nizovi. Dio 3 | ProHoster","description":"","canonical_url":"https:\/\/prohoster.info\/hr\/blog\/administrirovanie\/globaly-mechi-kladentsy-dlya-hraneniya-dannyh-razrezhennye-massivy-chast-3","robots":"max-image-preview:large","keywords":"","webmasterTools":{"miscellaneous":""},"schema":null,"og:locale":"hr_HR","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\/hr\/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\/hr\/wp-json\/wp\/v2\/posts\/36632","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/prohoster.info\/hr\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/prohoster.info\/hr\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/prohoster.info\/hr\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/prohoster.info\/hr\/wp-json\/wp\/v2\/comments?post=36632"}],"version-history":[{"count":0,"href":"https:\/\/prohoster.info\/hr\/wp-json\/wp\/v2\/posts\/36632\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/prohoster.info\/hr\/wp-json\/wp\/v2\/media\/27432"}],"wp:attachment":[{"href":"https:\/\/prohoster.info\/hr\/wp-json\/wp\/v2\/media?parent=36632"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/prohoster.info\/hr\/wp-json\/wp\/v2\/categories?post=36632"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/prohoster.info\/hr\/wp-json\/wp\/v2\/tags?post=36632"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}