{"id":30900,"date":"2019-10-31T21:38:02","date_gmt":"2019-10-31T18:38:02","guid":{"rendered":"https:\/\/prohoster.info\/blog\/parallelnye-zaprosy-v-postgresql\/"},"modified":"2019-10-31T21:38:02","modified_gmt":"2019-10-31T18:38:02","slug":"parallelnye-zaprosy-v-postgresql","status":"publish","type":"post","link":"https:\/\/prohoster.info\/bs\/blog\/administrirovanie\/parallelnye-zaprosy-v-postgresql","title":{"rendered":"Paralelni zahtevi u PostgreSQL","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"<p><img decoding=\"async\" alt=\"Paralelni zahtevi u PostgreSQL\" src=\"\/wp-content\/uploads\/2019\/04\/bbb4b4d3f8714bbdb9b26ada2f2253b5.jpg\" style=\"display:block;margin: 0 auto;\" \/><br \/>\nU modernim CPU ima mnogo jezgara. Godinama su aplikacije slale zahteve u baze podataka paralelno. Ako je to izve\u0161tajni zahtev za vi\u0161e redova u tabeli, izvr\u0161ava se br\u017ee kada se koriste vi\u0161e CPU-a, a u PostgreSQL-u to je mogu\u0107e od verzije 9.6.<\/p>\n<p><\/p>\n<p>Treba tri godine da se implementira funkcija paralelnih zahteva \u2014 bilo je potrebno prepisivati kod u razli\u010ditim fazama izvr\u0161avanja zahteva. U PostgreSQL 9.6 uvedena je infrastruktura za daljnje pobolj\u0161anje koda. U narednim verzijama i druge vrste zahteva se izvr\u0161avaju paralelno.<\/p>\n<p><noindex><a rel=\"nofollow\" name=\"habracut\"><\/a><\/noindex><\/p>\n<h3 id=\"ogranicheniya\">Ograni\u010denja<\/h3>\n<p><\/p>\n<ul>\n<li>Ne uklju\u010dujte paralelno izvr\u0161avanje ako su sva jezgra ve\u0107 zauzeta, ina\u010de \u0107e drugi zahtevi usporiti.<\/li>\n<li>Najva\u017enije je to da paralelna obrada sa visokim vrednostima WORK_MEM zahteva mnogo memorije \u2014 svaka ha\u0161na veza ili sortiranje zauzima memoriju u volumenu work_mem.<\/li>\n<li>OLTP zahtevi sa niskom latencijom se ne mogu ubrzati paralelnim izvr\u0161avanjem. A ako zahtev vra\u0107a jedan red, paralelna obrada ga samo usporava.<\/li>\n<li>Programeri vole da koriste TPC-H benchmark. Mo\u017eda imate sli\u010dne zahteve za savr\u0161eno paralelno izvr\u0161avanje.<\/li>\n<li>Samo SELECT zahtevi bez predikatske blokade se izvr\u0161avaju paralelno.<\/li>\n<li>Ponekad je pravilna indeksacija bolja od sekvencijalnog skeniranja tabele u paralelnom re\u017eimu.<\/li>\n<li>Pauziranje zahteva i kursora nije podr\u017eano.<\/li>\n<li>Prozorske funkcije i agregatne funkcije ure\u0111enih skupova nisu paralelne.<\/li>\n<li>Ne dobijate ni\u0161ta u radnom optere\u0107enju ulaza-izlaza.<\/li>\n<li>Ne postoje paralelni algoritmi sortiranja. Me\u0111utim, zahtevi sa sortiranjem se mogu izvr\u0161avati paralelno u nekim aspektima.<\/li>\n<li>Zamenite CTE (WITH \u2026) sa ugnije\u017edenim SELECT-om kako biste omogu\u0107ili paralelnu obradu.<\/li>\n<li>Omotnici spolja\u0161njih podataka trenutno ne podr\u017eavaju paralelnu obradu (mada bi mogli!)<\/li>\n<li>FULL OUTER JOIN nije podr\u017ean.<\/li>\n<li>max_rows onemogu\u0107ava paralelnu obradu.<\/li>\n<li>Ako zahtevu postoji funkcija koja nije ozna\u010dena kao PARALLEL SAFE, bi\u0107e jednopotni.<\/li>\n<li>Nivo izolacije transakcije SERIALIZABLE onemogu\u0107ava paralelnu obradu.<\/li>\n<\/ul>\n<p><\/p>\n<h3 id=\"testovaya-sreda\">Testna okru\u017eenja<\/h3>\n<p><\/p>\n<p>Programeri PostgreSQL su poku\u0161ali smanjiti vreme odziva zahteva benchmarka TPC-H. Preuzmite benchmark i <noindex><a rel=\"nofollow\" href=\"https:\/\/github.com\/tvondra\/pg_tpch\">prilagodite ga PostgreSQL-u<\/a><\/noindex>. Ovo je neautorizovana upotreba benchmarka TPC-H \u2014 nije za upore\u0111ivanje baza podataka ili opreme.<\/p>\n<p><\/p>\n<ol>\n<li>Preuzmite TPC-H_Tools_v2.17.3.zip (ili noviju verziju) <noindex><a rel=\"nofollow\" href=\"http:\/\/www.tpc.org\/tpc_documents_current_versions\/current_specifications.asp\">sa TPC zvani\u010dne stranice<\/a><\/noindex>.<\/li>\n<li>Preimenujte makefile.suite u Makefile i izmenite, kako je ovde opisano: <noindex><a rel=\"nofollow\" href=\"https:\/\/github.com\/tvondra\/pg_tpch\">https:\/\/github.com\/tvondra\/pg_tpch <\/a><\/noindex>. Kompajlirajte kod komandom make.<\/li>\n<li>Generi\u0161ite podatke: <code>.\/dbgen -s 10<\/code> stvara bazu podataka od 23 GB. To je dovoljno da se vidi razlika u performansama paralelnih i neparalelnih upita.<\/li>\n<li>Konvertujte datoteke <code>tbl<\/code> u <code>csv sa for<\/code> i <code>sed<\/code>.<\/li>\n<li>Klonirajte repozitorij <code>pg_tpch<\/code> i kopirajte datoteke <code>csv<\/code> u <code>pg_tpch\/dss\/data<\/code>.<\/li>\n<li>Kreirajte upite komandom <code>qgen<\/code>.<\/li>\n<li>U\u010ditajte podatke u bazu komandom <code>.\/tpch.sh<\/code>.<\/li>\n<\/ol>\n<p><\/p>\n<h3 id=\"parallelnoe-posledovatelnoe-skanirovanie\">Paralelno sekvencijalno skeniranje<\/h3>\n<p><\/p>\n<p>Mo\u017ee biti br\u017ee ne zbog paralelnog \u010ditanja, ve\u0107 zbog toga \u0161to su podaci raspore\u0111eni po vi\u0161e CPU jezgara. U savremenim operativnim sistemima, datoteke podataka PostgreSQL se dobro ke\u0161iraju. Sa anticipativnim \u010ditanjem mo\u017eete dobiti vi\u0161e blokova iz skladi\u0161ta nego \u0161to PG demon zahteva. Stoga performanse upita nisu ograni\u010dene ulazno-izlaznim vremenom diska. Tro\u0161i CPU cikluse da:<\/p>\n<p><\/p>\n<ul>\n<li>\u010dita redove jedan po jedan sa stranica tabele;<\/li>\n<li>upore\u0111uje vrednosti redova i uslove <code>GDJE<\/code>.<\/li>\n<\/ul>\n<p><\/p>\n<p>Izvr\u0161imo jednostavan upit <code>select<\/code>:<\/p>\n<p><\/p>\n<pre><code class=\"plaintext\">tpch=# explain analyze select l_quantity as sum_qty from lineitem where l_shipdate &lt;= date &#039;1998-12-01&#039; - interval &#039;105&#039; day;\nQUERY PLAN\n--------------------------------------------------------------------------------------------------------------------------\nSeq Scan on lineitem (cost=0.00..1964772.00 rows=58856235 width=5) (actual time=0.014..16951.669 rows=58839715 loops=1)\nFilter: (l_shipdate &lt;= &#039;1998-08-18 00:00:00&#039;::timestamp without time zone)\nRows Removed by Filter: 1146337\nPlanning Time: 0.203 ms\nExecution Time: 19035.100 ms<\/code><\/pre>\n<p><\/p>\n<p>Sekvencijalno skeniranje daje previ\u0161e redova bez agregacije, pa se upit izvr\u0161ava jednim CPU jezgrom.<\/p>\n<p><\/p>\n<p>Ako dodamo <code>SUM()<\/code>, mo\u017ee se primetiti da \u0107e dva radna procesa pomo\u0107i u ubrzavanju upita:<\/p>\n<p><\/p>\n<pre><code class=\"plaintext\">explain analyze select sum(l_quantity) as sum_qty from lineitem where l_shipdate  Gather (cost=1589701.91..1589702.12 rows=2 width=32) (actual time=8553.241..8555.067 rows=3 loops=1)\nWorkers Planned: 2\nWorkers Launched: 2\n-&gt; Partial Aggregate (cost=1588701.91..1588701.92 rows=1 width=32) (actual time=8547.546..8547.546 rows=1 loops=3)\n-&gt; Parallel Seq Scan on lineitem (cost=0.00..1527393.33 rows=24523431 width=5) (actual time=0.038..5998.417 rows=19613238 loops=3)\nFilter: (l_shipdate &lt;= &#039;1998-08-18 00:00:00&#039;::timestamp without time zone)\nRows Removed by Filter: 382112\nPlanning Time: 0.241 ms\nExecution Time: 8555.131 ms<\/code><\/pre>\n<p><\/p>\n<h3 id=\"parallelnaya-agregaciya\">Paralelna agregacija<\/h3>\n<p><\/p>\n<p>\u010cvor \u201eParallel Seq Scan\u201c generira redove za parcijalnu agregaciju. \u010cvor \u201ePartial Aggregate\u201c skra\u0107uje te redove pomo\u0107u <code>SUM()<\/code>. Na kraju, broja\u010d SUM iz svake radne jedinice okuplja \u010dvor \u201eGather\u201c.<\/p>\n<p><\/p>\n<p>Kona\u010dni rezultat izra\u010dunava \u010dvor \u201eFinalize Aggregate\u201c. Ako imate svoje funkcije agregacije, ne zaboravite ih ozna\u010diti kao \u201eparallel safe\u201c.<\/p>\n<p><\/p>\n<h3 id=\"kolichestvo-rabochih-processov\">Broj radnih procesa<\/h3>\n<p><\/p>\n<p>Broj radnih procesa mo\u017ee se pove\u0107ati bez ponovnog pokretanja servera:<\/p>\n<p><\/p>\n<pre><code class=\"plaintext\">explain analyze select sum(l_quantity) as sum_qty from lineitem where l_shipdate  Gather (cost=1589701.91..1589702.12 rows=2 width=32) (actual time=8553.241..8555.067 rows=3 loops=1)\nWorkers Planned: 2\nWorkers Launched: 2\n-&gt; Partial Aggregate (cost=1588701.91..1588701.92 rows=1 width=32) (actual time=8547.546..8547.546 rows=1 loops=3)\n-&gt; Parallel Seq Scan on lineitem (cost=0.00..1527393.33 rows=24523431 width=5) (actual time=0.038..5998.417 rows=19613238 loops=3)\nFilter: (l_shipdate &lt;= &#039;1998-08-18 00:00:00&#039;::timestamp without time zone)\nRows Removed by Filter: 382112\nPlanning Time: 0.241 ms\nExecution Time: 8555.131 ms<\/code><\/pre>\n<p><\/p>\n<p>\u0160ta se ovde de\u0161ava? Broj radnih procesa je udvostru\u010den, a zahtev je postao 1,6599 puta br\u017ei. Izgleda zanimljivo. Imali smo 2 radna procesa i 1 lidera. Nakon promene sada imamo 4+1.<\/p>\n<p><\/p>\n<p>Na\u0161a maksimalna brzina paralelnog obrade: 5\/3 = 1,66(6) puta.<\/p>\n<p><\/p>\n<h2 id=\"kak-eto-rabotaet\">Kako to radi?<\/h2>\n<p><\/p>\n<h3 id=\"processy\">Procesi<\/h3>\n<p><\/p>\n<p>Izvr\u0161enje zahteva uvek po\u010dinje od vode\u0107eg procesa. Lider obavlja sve neprilagodljive i deo paralelne obrade. Ostali procesi koji obra\u0111uju iste zahteve nazivaju se radnim procesima. Paralelna obrada koristi infrastrukturu <noindex><a rel=\"nofollow\" href=\"https:\/\/www.postgresql.org\/docs\/11\/bgworker.html\">dinami\u010dkih pozadinskih radnih procesa<\/a><\/noindex> (od verzije 9.4). Kako druge komponente PostgreSQL koriste procese, a ne niti, zahtev sa 3 radna procesa mogao bi biti 4 puta br\u017ei od tradicionalne obrade.<\/p>\n<p><\/p>\n<h3 id=\"vzaimodeystvie\">Interakcija<\/h3>\n<p><\/p>\n<p>Radni procesi komuniciraju s liderom putem reda poruka (na bazi zajedni\u010dke memorije). Svaki proces ima 2 reda: za gre\u0161ke i za tuple.<\/p>\n<p><\/p>\n<h3 id=\"skolko-nuzhno-rabochih-processov\">Koliko radnih procesa je potrebno?<\/h3>\n<p><\/p>\n<p>Minimalno ograni\u010denje postavlja parametar <noindex><a rel=\"nofollow\" href=\"https:\/\/www.postgresql.org\/docs\/11\/runtime-config-resource.html#GUC-MAX-PARALLEL-WORKERS-PER-GATHER\"><code>max_parallel_workers_per_gather<\/code><\/a><\/noindex>. Zatim izvr\u0161itelj zahteva uzima radne procese iz bazena, ograni\u010denog parametrom <noindex><a rel=\"nofollow\" href=\"https:\/\/www.postgresql.org\/docs\/11\/runtime-config-resource.html#GUC-MAX-WORKER-PROCESSES\"><code>max_parallel_workers size<\/code><\/a><\/noindex>. Poslednje ograni\u010denje je <noindex><a rel=\"nofollow\" href=\"https:\/\/www.postgresql.org\/docs\/11\/runtime-config-resource.html#GUC-MAX-WORKER-PROCESSES\"><code>max_worker_processes<\/code><\/a><\/noindex>, tj. ukupan broj pozadinskih procesa.<\/p>\n<p><\/p>\n<p>Ako ne uspe da dodeli radni proces, obrada \u0107e biti jednoprosesna.<\/p>\n<p><\/p>\n<p>Planer zahteva mo\u017ee smanjiti radne procese u zavisnosti od veli\u010dine tabele ili indeksa. Postoje parametri <noindex><a rel=\"nofollow\" href=\"https:\/\/www.postgresql.org\/docs\/current\/runtime-config-query.html#GUC-MIN-PARALLEL-TABLE-SCAN-SIZE\"><code>min_parallel_table_scan_size<\/code><\/a><\/noindex> i <noindex><a rel=\"nofollow\" href=\"https:\/\/www.postgresql.org\/docs\/current\/runtime-config-query.html#GUC-MIN-PARALLEL-INDEX-SCAN-SIZE\"><code>min_parallel_index_scan_size<\/code><\/a><\/noindex>.<\/p>\n<p><\/p>\n<pre><code class=\"plaintext\">postavi min_parallel_table_scan_size='8MB'\n8MB tabela =&gt; 1 radnik\n24MB tabela =&gt; 2 radnika\n72MB tabela =&gt; 3 radnika\nx =&gt; log(x \/ min_parallel_table_scan_size) \/ log(3) + 1 radnik<\/code><\/pre>\n<p><\/p>\n<p>Svaki put kada je tabela 3 puta ve\u0107a od <code>min_parallel_(index|table)_scan_size<\/code>, Postgres dodaje radni proces. Broj radnih procesa nije zasnovan na tro\u0161kovima. Cikli\u010dna zavisnost ote\u017eava slo\u017eene implementacije. Umesto toga, planer koristi jednostavna pravila.<\/p>\n<p><\/p>\n<p>U praksi ova pravila nisu uvek primenljiva za produkciju, pa se mo\u017ee promeniti broj radnih procesa za odre\u0111enu tabelu: ALTER TABLE \u2026 SET (<code>parallel_workers = N<\/code>).<\/p>\n<p><\/p>\n<h3 id=\"pochemu-parallelnaya-obrabotka-ne-ispolzuetsya\">Za\u0161to se paralelna obrada ne koristi?<\/h3>\n<p><\/p>\n<p>Osim dugog popisa ograni\u010denja, postoje jo\u0161 i tro\u0161kovi provjere:<\/p>\n<p><\/p>\n<p><noindex><a rel=\"nofollow\" href=\"https:\/\/www.postgresql.org\/docs\/current\/runtime-config-query.html#GUC-PARALLEL-SETUP-COST\"><code>parallel_setup_cost<\/code><\/a><\/noindex> \u2014 kako bi se izbjeglo paralelno obra\u0111ivanje kratkih upita. Ova stavka procjenjuje vrijeme za pripremu memorije, pokretanje procesa i po\u010detnu razmjenu podataka.<\/p>\n<p><\/p>\n<p><noindex><a rel=\"nofollow\" href=\"https:\/\/www.postgresql.org\/docs\/current\/runtime-config-query.html#GUC-PARALLEL-TUPLE-COST\"><code>parallel_tuple_cost<\/code><\/a><\/noindex>: komunikacija vo\u0111e sa radnicima mo\u017ee trajati proporcionalno broju kuta iz radnih procesa. Ova stavka izra\u010dunava tro\u0161kove razmjene podataka.<\/p>\n<p><\/p>\n<h3 id=\"soedineniya-vlozhennyh-ciklov--nested-loop-join\">Spojevi ugnije\u017edenih petlji \u2014 Nested Loop Join<\/h3>\n<p><\/p>\n<pre><code class=\"plaintext\">PostgreSQL 9.6+ mo\u017ee izvoditi ugnije\u017edene petlje paralelno \u2014 to je jednostavna operacija.\n\nexplain (costs off) select c_custkey, count(o_orderkey)\n from customer left outer join orders on\n c_custkey = o_custkey and o_comment not like '%specialposits%'\n group by c_custkey;\n QUERY PLAN\n--------------------------------------------------------------------------------------\n Finalize GroupAggregate\n Group Key: customer.c_custkey\n -&gt; Gather Merge\n Workers Planned: 4\n -&gt; Partial GroupAggregate\n Group Key: customer.c_custkey\n -&gt; Nested Loop Left Join\n -&gt; Parallel Index Only Scan using customer_pkey on customer\n -&gt; Index Scan using idx_orders_custkey on orders\n Index Cond: (customer.c_custkey = o_custkey)\n Filter: ((o_comment)::text !~~ '%specialposits%'::text)<\/code><\/pre>\n<p><\/p>\n<p>Sakupljanje se odvija u posljednjoj fazi, tako da je Nested Loop Left Join \u2014 paralelna operacija. Parallel Index Only Scan je uveden tek u verziji 10. Radi na sli\u010dan na\u010din kao paralelno sekvencijalno skeniranje. Uslov <code>c_custkey = o_custkey<\/code> u\u010ditava jednu narud\u017ebu za svaki red klijenta. Stoga nije paralelno.<\/p>\n<p><\/p>\n<h3 id=\"hesh-soedinenie--hash-join\">Hash Join \u2014 Hash Join<\/h3>\n<p><\/p>\n<p>Svaki radni proces stvara svoju hash-tablicu do PostgreSQL 11. I ako tih procesa ima vi\u0161e od \u010detiri, performanse se ne\u0107e pobolj\u0161ati. U novoj verziji, hash-tablica je zajedni\u010dka. Svaki radni proces mo\u017ee koristiti WORK_MEM za stvaranje hash-tablice.<\/p>\n<p><\/p>\n<pre><code class=\"plaintext\">izaberi\n        l_shipmode,\n        zbir(case\n                kada je o_orderpriority = '1-URGENT'\n                        ili o_orderpriority = '2-HIGH'\n                        onda 1\n                ina\u010de 0\n        kraj) kao high_line_count,\n        zbir(case\n                kada je o_orderpriority  '1-URGENT'\n                        i o_orderpriority  '2-HIGH'\n                        onda 1\n                ina\u010de 0\n        kraj) kao low_line_count\niz\n        narud\u017ebe,\n        stavka\ngdje\n        o_orderkey = l_orderkey\n        i l_shipmode u ('MAIL', 'AIR')\n        i l_commitdate &lt; l_receiptdate\n        i l_shipdate = datum '1996-01-01'\n        i l_receiptdate   Finalizuj Grupnu Agregaciju  (tro\u0161ak=1964755.66..1966196.11 redovi=7 \u0161irina=27) (aktuelno vreme=7579.590..7579.591 redovi=1 petlje=1)\n         Klju\u010d Grupe: lineitem.l_shipmode\n         -&gt;  Prikupi Spojeno  (tro\u0161ak=1964755.66..1966195.83 redovi=28 \u0161irina=27) (aktuelno vreme=7559.593..7922.319 redovi=6 petlje=1)\n               Planirani Radnici: 4\n               Pokrenuti Radnici: 4\n               -&gt;  Djelimi\u010dna Grupna Agregacija  (tro\u0161ak=1963755.61..1965192.44 redovi=7 \u0161irina=27) (aktuelno vreme=7548.103..7564.592 redovi=2 petlje=5)\n                     Klju\u010d Grupe: lineitem.l_shipmode\n                     -&gt;  Sortiranje  (tro\u0161ak=1963755.61..1963935.20 redovi=71838 \u0161irina=27) (aktuelno vreme=7530.280..7539.688 redovi=62519 petlje=5)\n                           Klju\u010d Sortiranja: lineitem.l_shipmode\n                           Metoda Sortiranja: spoljnje spajanje  Disk: 2304kB\n                           Radnik 0:  Metoda Sortiranja: spoljnje spajanje  Disk: 2064kB\n                           Radnik 1:  Metoda Sortiranja: spoljnje spajanje  Disk: 2384kB\n                           Radnik 2:  Metoda Sortiranja: spoljnje spajanje  Disk: 2264kB\n                           Radnik 3:  Metoda Sortiranja: spoljnje spajanje  Disk: 2336kB\n                           -&gt;  Paralelno Hash Spajanje  (tro\u0161ak=382571.01..1957960.99 redovi=71838 \u0161irina=27) (aktuelno vreme=7036.917..7499.692 redovi=62519 petlje=5)\n                                 Hash Uslov: (lineitem.l_orderkey = orders.o_orderkey)\n                                 -&gt;  Paralelno Sekvencijalno Skenerisanje na lineitem  (tro\u0161ak=0.00..1552386.40 redovi=71838 \u0161irina=19) (aktuelno vreme=0.583..4901.063 redovi=62519 petlje=5)\n                                       Filter: ((l_shipmode = BILO ('{MAIL,AIR}'::bpchar[])) I (l_commitdate &lt; l_receiptdate) I (l_shipdate = '1996-01-01'::datum) I (l_receiptdate   Paralelno Hash  (tro\u0161ak=313722.45..313722.45 redovi=3750045 \u0161irina=20) (aktuelno vreme=2011.518..2011.518 redovi=3000000 petlje=5)\n                                       Kante: 65536  Serije: 256  Kori\u0161\u0107enje Memorije: 3840kB\n                                       -&gt;  Paralelno Sekvencijalno Skenerisanje na naredbama  (tro\u0161ak=0.00..313722.45 redovi=3750045 \u0161irina=20) (aktuelno vreme=0.029..995.948 redovi=3000000 petlje=5)\n Vreme Planiranja: 0.977 ms\n Vreme Izvr\u0161enja: 7923.770 ms<\/code><\/pre>\n<p><\/p>\n<p>Upit 12 iz TPC-H jasno prikazuje paralelno hash spajanje. Svaki radni proces u\u010destvuje u kreiranju zajedni\u010dke hash tabele.<\/p>\n<p><\/p>\n<h3 id=\"soedinenie-sliyaniem--merge-join\">Spoj kroz spajanje \u2014 Merge Join<\/h3>\n<p><\/p>\n<p>Spoj kroz spajanje je inherentno nep paralelan. Ne brinite se ako je ovo poslednja faza upita \u2014 ona se i dalje mo\u017ee izvr\u0161avati paralelno.<\/p>\n<p><\/p>\n<pre><code class=\"plaintext\">-- Upit 2 iz TPC-H\nobjasni (tro&scaron;kovi isklju\u010deni) odaberi s_acctbal, s_name, n_name, p_partkey, p_mfgr, s_address, s_phone, s_comment\niz    part, supplier, partsupp, nation, region\ngdje\n        p_partkey = ps_partkey\n        i s_suppkey = ps_suppkey\n        i p_size = 36\n        i p_type poput &#039;%BRASS&#039;\n        i s_nationkey = n_nationkey\n        i n_regionkey = r_regionkey\n        i r_name = &#039;AMERIKA&#039;\n        i ps_supplycost = (\n                odaberi\n                        min(ps_supplycost)\n                iz    partsupp, supplier, nation, region\n                gdje\n                        p_partkey = ps_partkey\n                        i s_suppkey = ps_suppkey\n                        i s_nationkey = n_nationkey\n                        i n_regionkey = r_regionkey\n                        i r_name = &#039;AMERIKA&#039;\n        )\nredosljed s_acctbal opadaju\u0107e, n_name, s_name, p_partkey\nLIMIT 100;\n                                                PLAN UPITA\n----------------------------------------------------------------------------------------------------------\n Limit\n   -&amp;gt;  Sortiranje\n         Klju\u010d sortiranja: supplier.s_acctbal DESC, nation.n_name, supplier.s_name, part.p_partkey\n         -&amp;gt;  Merge Join\n               Merge Uslov: (part.p_partkey = partsupp.ps_partkey)\n               Uslov spajanja: (partsupp.ps_supplycost = (Podplan 1))\n               -&amp;gt;  Prikupljanje spajanja\n                     Planirani radnici: 4\n                     -&amp;gt;  Paralelno skeniranje indeksa preko &lt;strong&gt;part_pkey&lt;\/strong&gt; na part\n                           Filter: (((p_type)::text ~~ &#039;%BRASS&#039;::text) I (p_size = 36))\n               -&amp;gt;  Materijalizacija\n                     -&amp;gt;  Sortiranje\n                           Klju\u010d sortiranja: partsupp.ps_partkey\n                           -&amp;gt;  Ugnije\u017edena petlja\n                                 -&amp;gt;  Ugnije\u017edena petlja\n                                       Uslov spajanja: (nation.n_regionkey = region.r_regionkey)\n                                       -&amp;gt;  Zapo\u010dni skeniranje na region\n                                             Filter: (r_name = &#039;AMERIKA&#039;::bpchar)\n                                       -&amp;gt;  Hash Join\n                                             Hash Uslov: (supplier.s_nationkey = nation.n_nationkey)\n                                             -&amp;gt;  Zapo\u010dni skeniranje na supplier\n                                             -&amp;gt;  Hash\n                                                   -&amp;gt;  Zapo\u010dni skeniranje na nation\n                                 -&amp;gt;  Skeniranje indeksa koriste\u0107i idx_partsupp_suppkey na partsupp\n                                       Uslov indeksa: (ps_suppkey = supplier.s_suppkey)\n               Podplan 1\n                 -&amp;gt;  Agregat\n                       -&amp;gt;  Ugnije\u017edena petlja\n                             Uslov spajanja: (nation_1.n_regionkey = region_1.r_regionkey)\n                             -&amp;gt;  Zapo\u010dni skeniranje na region region_1\n                                   Filter: (r_name = &#039;AMERIKA&#039;::bpchar)\n                             -&amp;gt;  Ugnije\u017edena petlja\n                                   -&amp;gt;  Ugnije\u017edena petlja\n                                         -&amp;gt;  Skeniranje indeksa koriste\u0107i idx_partsupp_partkey na partsupp partsupp_1\n                                               Uslov indeksa: (part.p_partkey = ps_partkey)\n                                         -&amp;gt;  Skeniranje indeksa koriste\u0107i supplier_pkey na supplier supplier_1\n                                               Uslov indeksa: (s_suppkey = partsupp_1.ps_suppkey)\n                                   -&amp;gt;  Skeniranje indeksa koriste\u0107i nation_pkey na nation nation_1\n                                         Uslov indeksa: (n_nationkey = supplier_1.s_nationkey)<\/code><\/pre>\n<p><\/p>\n<p>\u010cvor \u201eMerge Join\u201c se nalazi iznad \u201eGather Merge\u201c. Tako da spajanje ne koristi paralelnu obradu. No \u010dvor \u201eParallel Index Scan\u201c i dalje poma\u017ee s segmentom. <code>part_pkey<\/code>.<\/p>\n<p><\/p>\n<h3 id=\"soedinenie-po-sekciyam\">Spoj po sekcijama<\/h3>\n<p><\/p>\n<p>U PostgreSQL 11 <noindex><a rel=\"nofollow\" href=\"http:\/\/ashutoshpg.blogspot.com\/2017\/12\/partition-wise-joins-divide-and-conquer.html\">spoj po sekcijama<\/a><\/noindex> je prema defaultu isklju\u010den: ima vrlo visok tro\u0161ak planiranja. Tabele sa sli\u010dnim sekcioniranjem mogu se spajati sekcija po sekciju. Tako \u0107e Postgres koristiti manje he\u0161-tabele. Svako spajanje sekcija mo\u017ee biti paralelno.<\/p>\n<p><\/p>\n<pre><code class=\"plaintext\">tpch=# set enable_partitionwise_join=t;\ntpch=# explain (costs off) select * from prt1 t1, prt2 t2\nwhere t1.a = t2.b and t1.b = 0 and t2.b between 0 and 10000;\n                    PLAN UPITA\n---------------------------------------------------\n Append\n   -&gt;  He\u0161 Spoj\n         He\u0161 Uslov: (t2.b = t1.a)\n         -&gt;  Sekvencijalno skeniranje na prt2_p1 t2\n               Filter: ((b &gt;= 0) AND (b &lt;= 10000))\n         -&gt;  He\u0161\n               -&gt;  Sekvencijalno skeniranje na prt1_p1 t1\n                     Filter: (b = 0)\n   -&gt;  He\u0161 Spoj\n         He\u0161 Uslov: (t2_1.b = t1_1.a)\n         -&gt;  Sekvencijalno skeniranje na prt2_p2 t2_1\n               Filter: ((b &gt;= 0) AND (b &lt;= 10000))\n         -&gt;  He\u0161\n               -&gt;  Sekvencijalno skeniranje na prt1_p2 t1_1\n                     Filter: (b = 0)\ntpch=# set parallel_setup_cost = 1;\ntpch=# set parallel_tuple_cost = 0.01;\ntpch=# explain (costs off) select * from prt1 t1, prt2 t2\nwhere t1.a = t2.b and t1.b = 0 and t2.b between 0 and 10000;\n                        PLAN UPITA\n-----------------------------------------------------------\n Gather\n   Planirani radnici: 4\n   -&gt;  Paralelno Append\n         -&gt;  Paralelni He\u0161 Spoj\n               He\u0161 Uslov: (t2_1.b = t1_1.a)\n               -&gt;  Paralelno Sekvencijalno skeniranje na prt2_p2 t2_1\n                     Filter: ((b &gt;= 0) AND (b &lt;= 10000))\n               -&gt;  Paralelni He\u0161\n                     -&gt;  Paralelno Sekvencijalno skeniranje na prt1_p2 t1_1\n                           Filter: (b = 0)\n         -&gt;  Paralelni He\u0161 Spoj\n               He\u0161 Uslov: (t2.b = t1.a)\n               -&gt;  Paralelno Sekvencijalno skeniranje na prt2_p1 t2\n                     Filter: ((b &gt;= 0) AND (b &lt;= 10000))\n               -&gt;  Paralelni He\u0161\n                     -&gt;  Paralelno Sekvencijalno skeniranje na prt1_p1 t1\n                           Filter: (b = 0)<\/code><\/pre>\n<p><\/p>\n<p>Glavna stvar je da spoj po sekcijama mo\u017ee biti paralelan samo ako su te sekcije dovoljno velike.<\/p>\n<p><\/p>\n<h3 id=\"parallelnoe-dopolnenie--parallel-append\">Paralelno dodavanje \u2014 Parallel Append<\/h3>\n<p><\/p>\n<p><noindex><a rel=\"nofollow\" href=\"https:\/\/www.postgresql.org\/docs\/11\/parallel-plans.html#PARALLEL-APPEND\">Parallel Append<\/a><\/noindex> mo\u017ee se koristiti umesto razli\u010ditih blokova u razli\u010ditim radnim procesima. Obi\u010dno se javlja kod upita UNION ALL. Nedostatak je manji paralelizam, jer svaki radni proces obra\u0111uje samo 1 upit.<\/p>\n<p><\/p>\n<p>Ovde su pokrenuta 2 radna procesa, iako su uklju\u010dena 4.<\/p>\n<p><\/p>\n<pre><code class=\"plaintext\">tpch=# explain (costs off) select sum(l_quantity) as sum_qty from lineitem where l_shipdate &lt;= date &#039;1998-12-01&#039; - interval &#039;105&#039; day union all select sum(l_quantity) as sum_qty from lineitem where l_shipdate   Parallel Append\n         -&gt;  Aggregate\n               -&gt;  Seq Scan on lineitem\n                     Filter: (l_shipdate   Aggregate\n               -&gt;  Seq Scan on lineitem lineitem_1\n                     Filter: (l_shipdate &lt;= &#039;1998-08-18 00:00:00&#039;::timestamp without time zone)<\/code><\/pre>\n<p><\/p>\n<h3 id=\"samye-vazhnye-peremennye\">Najva\u017enije varijable<\/h3>\n<p><\/p>\n<ul>\n<li>WORK_MEM ograni\u010dava koli\u010dinu memorije za svaki proces, ne samo za upite: work_mem <em> procese <\/em> veza = jako puno memorije.<\/li>\n<li><noindex><a rel=\"nofollow\" href=\"https:\/\/www.postgresql.org\/docs\/11\/runtime-config-resource.html#GUC-MAX-PARALLEL-WORKERS-PER-GATHER\"><code>max_parallel_workers_per_gather<\/code><\/a><\/noindex> \u2014 koliko radnih procesa programas \u0107e koristiti za paralelnu obradu iz plana.<\/li>\n<li><noindex><a rel=\"nofollow\" href=\"https:\/\/www.postgresql.org\/docs\/11\/runtime-config-resource.html#GUC-MAX-WORKER-PROCESSES\"><code>max_worker_processes<\/code><\/a><\/noindex> \u2014 prilago\u0111ava ukupni broj radnih procesa prema broju CPU jezgara na serveru.<\/li>\n<li><noindex><a rel=\"nofollow\" href=\"https:\/\/www.postgresql.org\/docs\/11\/runtime-config-resource.html#GUC-MAX-WORKER-PROCESSES\"><code>max_parallel_workers<\/code><\/a><\/noindex> \u2014 isto, ali za paralelne radne procese.<\/li>\n<\/ul>\n<p><\/p>\n<h3 id=\"itogi\">Zaklju\u010dci<\/h3>\n<p><\/p>\n<p>Po\u010dev\u0161i od verzije 9.6, paralelna obrada mo\u017ee znatno pobolj\u0161ati performanse slo\u017eenih upita koji skeniraju puno redova ili indeksa. U PostgreSQL 10, paralelna obrada se podrazumeva. Ne zaboravite da je isklju\u010dite na serverima sa velikim OLTP optere\u0107enjem. Sekvencijalni skenovi ili skenovi indeksa tro\u0161e jako puno resursa. Ako ne izvr\u0161avate izve\u0161taj nad celim skupom podataka, upite mo\u017eete u\u010diniti efikasnijim jednostavno dodavanjem nedostaju\u0107ih indeksa ili kori\u0161\u0107enjem pravog particionisanja.<\/p>\n<p><\/p>\n<h3 id=\"ssylki\">Linkovi<\/h3>\n<p><\/p>\n<ul>\n<li><noindex><a rel=\"nofollow\" href=\"https:\/\/www.postgresql.org\/docs\/11\/how-parallel-query-works.html\">https:\/\/www.postgresql.org\/docs\/11\/how-parallel-query-works.html<\/a><\/noindex><\/li>\n<li><noindex><a rel=\"nofollow\" href=\"https:\/\/www.postgresql.org\/docs\/11\/parallel-plans.html\">https:\/\/www.postgresql.org\/docs\/11\/parallel-plans.html<\/a><\/noindex><\/li>\n<li><noindex><a rel=\"nofollow\" href=\"http:\/\/ashutoshpg.blogspot.com\/2017\/12\/partition-wise-joins-divide-and-conquer.html\">http:\/\/ashutoshpg.blogspot.com\/2017\/12\/partition-wise-joins-divide-and-conquer.html<\/a><\/noindex><\/li>\n<li><noindex><a rel=\"nofollow\" href=\"http:\/\/rhaas.blogspot.com\/2016\/04\/postgresql-96-with-parallel-query-vs.html\">http:\/\/rhaas.blogspot.com\/2016\/04\/postgresql-96-with-parallel-query-vs.html<\/a><\/noindex><\/li>\n<li><noindex><a rel=\"nofollow\" href=\"http:\/\/amitkapila16.blogspot.com\/2015\/11\/parallel-sequential-scans-in-play.html\">http:\/\/amitkapila16.blogspot.com\/2015\/11\/parallel-sequential-scans-in-play.html<\/a><\/noindex><\/li>\n<li><noindex><a rel=\"nofollow\" href=\"https:\/\/write-skew.blogspot.com\/2018\/01\/parallel-hash-for-postgresql.html\">https:\/\/write-skew.blogspot.com\/2018\/01\/parallel-hash-for-postgresql.html<\/a><\/noindex><\/li>\n<li><noindex><a rel=\"nofollow\" href=\"http:\/\/rhaas.blogspot.com\/2017\/03\/parallel-query-v2.html\">http:\/\/rhaas.blogspot.com\/2017\/03\/parallel-query-v2.html<\/a><\/noindex><\/li>\n<li><noindex><a rel=\"nofollow\" href=\"https:\/\/blog.2ndquadrant.com\/parallel-monster-benchmark\/\">https:\/\/blog.2ndquadrant.com\/parallel-monster-benchmark\/<\/a><\/noindex><\/li>\n<li><noindex><a rel=\"nofollow\" href=\"https:\/\/blog.2ndquadrant.com\/parallel-aggregate\/\">https:\/\/blog.2ndquadrant.com\/parallel-aggregate\/<\/a><\/noindex><\/li>\n<li><noindex><a rel=\"nofollow\" href=\"https:\/\/www.depesz.com\/2018\/02\/12\/waiting-for-postgresql-11-support-parallel-btree-index-builds\/\">https:\/\/www.depesz.com\/2018\/02\/12\/waiting-for-postgresql-11-support-parallel-btree-index-builds\/<\/a><\/noindex><\/li>\n<li><noindex><a rel=\"nofollow\" href=\"https:\/\/youtu.be\/jWIOZzezbb8\">Paralelizam u PostgreSQL 11<\/a><\/noindex><\/li>\n<\/ul>\n<p>Izvor: <a content=\"nofollow\" rel=\"nofollow\" href=\"https:\/\/habr.com\/ru\/company\/southbridge\/blog\/446706\/\">habr.com<\/a><\/p>","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"excerpt":{"rendered":"<p>\u0412 \u0441\u043e\u0432\u0440\u0435\u043c\u0435\u043d\u043d\u044b\u0445 \u0426\u041f \u043e\u0447\u0435\u043d\u044c \u043c\u043d\u043e\u0433\u043e \u044f\u0434\u0435\u0440. \u0413\u043e\u0434\u0430\u043c\u0438 \u043f\u0440\u0438\u043b\u043e\u0436\u0435\u043d\u0438\u044f \u043f\u043e\u0441\u044b\u043b\u0430\u043b\u0438 \u0437\u0430\u043f\u0440\u043e\u0441\u044b \u0432 \u0431\u0430\u0437\u044b \u0434\u0430\u043d\u043d\u044b\u0445 \u043f\u0430\u0440\u0430\u043b\u043b\u0435\u043b\u044c\u043d\u043e. \u0415\u0441\u043b\u0438 \u044d\u0442\u043e \u043e\u0442\u0447\u0435\u0442\u043d\u044b\u0439 \u0437\u0430\u043f\u0440\u043e\u0441 \u043a\u043e \u043c\u043d\u043e\u0436\u0435\u0441\u0442\u0432\u0443 \u0441\u0442\u0440\u043e\u043a \u0432 \u0442\u0430\u0431\u043b\u0438\u0446\u0435, \u043e\u043d \u0432\u044b\u043f\u043e\u043b\u043d\u044f\u0435\u0442\u0441\u044f \u0431\u044b\u0441\u0442\u0440\u0435\u0435, \u043a\u043e\u0433\u0434\u0430 \u0437\u0430\u0434\u0435\u0439\u0441\u0442\u0432\u0443\u0435\u0442 \u043d\u0435\u0441\u043a\u043e\u043b\u044c\u043a\u043e \u0426\u041f, \u0438 \u0432 PostgreSQL \u044d\u0442\u043e \u0432\u043e\u0437\u043c\u043e\u0436\u043d\u043e, \u043d\u0430\u0447\u0438\u043d\u0430\u044f \u0441 \u0432\u0435\u0440\u0441\u0438\u0438 9.6. \u041f\u043e\u043d\u0430\u0434\u043e\u0431\u0438\u043b\u043e\u0441\u044c 3 \u0433\u043e\u0434\u0430, \u0447\u0442\u043e\u0431\u044b \u0440\u0435\u0430\u043b\u0438\u0437\u043e\u0432\u0430\u0442\u044c \u0444\u0443\u043d\u043a\u0446\u0438\u044e \u043f\u0430\u0440\u0430\u043b\u043b\u0435\u043b\u044c\u043d\u044b\u0445 \u0437\u0430\u043f\u0440\u043e\u0441\u043e\u0432 \u2014 \u043f\u0440\u0438\u0448\u043b\u043e\u0441\u044c \u043f\u0435\u0440\u0435\u043f\u0438\u0441\u0430\u0442\u044c \u043a\u043e\u0434 \u043d\u0430 \u0440\u0430\u0437\u043d\u044b\u0445 \u044d\u0442\u0430\u043f\u0430\u0445 \u0432\u044b\u043f\u043e\u043b\u043d\u0435\u043d\u0438\u044f [&hellip;]<\/p>\n","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"author":1,"featured_media":22879,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[688],"tags":[],"class_list":["post-30900","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-administrirovanie"],"aioseo_notices":[],"aioseo_head":"\n\t\t<!-- All in One SEO 5.0.5.1 - aioseo.com -->\n\t<meta name=\"description\" content=\"\u0412 \u0441\u043e\u0432\u0440\u0435\u043c\u0435\u043d\u043d\u044b\u0445 \u0426\u041f \u043e\u0447\u0435\u043d\u044c \u043c\u043d\u043e\u0433\u043e \u044f\u0434\u0435\u0440.\" \/>\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\/bs\/blog\/administrirovanie\/parallelnye-zaprosy-v-postgresql\" \/>\n\t\t<meta name=\"generator\" content=\"All in One SEO (AIOSEO) 5.0.5.1\" \/>\n\t\t<meta property=\"og:locale\" content=\"bs_BA\" \/>\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\u041f\u0430\u0440\u0430\u043b\u043b\u0435\u043b\u044c\u043d\u044b\u0435 \u0437\u0430\u043f\u0440\u043e\u0441\u044b \u0432 PostgreSQL | ProHoster\" \/>\n\t\t<meta property=\"og:description\" content=\"\u0412 \u0441\u043e\u0432\u0440\u0435\u043c\u0435\u043d\u043d\u044b\u0445 \u0426\u041f \u043e\u0447\u0435\u043d\u044c \u043c\u043d\u043e\u0433\u043e \u044f\u0434\u0435\u0440.\" \/>\n\t\t<meta property=\"og:url\" content=\"https:\/\/prohoster.info\/bs\/blog\/administrirovanie\/parallelnye-zaprosy-v-postgresql\" \/>\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-10-31T18:38:02+00:00\" \/>\n\t\t<meta property=\"article:modified_time\" content=\"2019-10-31T18:38:02+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\udd47Paralelni upiti u PostgreSQL | ProHoster","description":"U modernim CPU-ima ima puno jezgara.","canonical_url":"https:\/\/prohoster.info\/bs\/blog\/administrirovanie\/parallelnye-zaprosy-v-postgresql","robots":"max-image-preview:large","keywords":"","webmasterTools":{"miscellaneous":""},"schema":null,"og:locale":"bs_BA","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\u041f\u0430\u0440\u0430\u043b\u043b\u0435\u043b\u044c\u043d\u044b\u0435 \u0437\u0430\u043f\u0440\u043e\u0441\u044b \u0432 PostgreSQL | ProHoster","og:description":"\u0412 \u0441\u043e\u0432\u0440\u0435\u043c\u0435\u043d\u043d\u044b\u0445 \u0426\u041f \u043e\u0447\u0435\u043d\u044c \u043c\u043d\u043e\u0433\u043e \u044f\u0434\u0435\u0440.","og:url":"https:\/\/prohoster.info\/bs\/blog\/administrirovanie\/parallelnye-zaprosy-v-postgresql","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-31T18:38:02+00:00","article:modified_time":"2019-10-31T18:38:02+00:00","article:publisher":"https:\/\/www.facebook.com\/prohoster","article:author":"https:\/\/www.facebook.com\/prohoster"},"aioseo_meta_data":{"post_id":"30900","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-21 03:34:04","breadcrumb_settings":null,"limit_modified_date":false,"reviewed_by":null,"ai":null,"created":"2021-03-01 03:27:06","updated":"2026-01-21 03:34:04","focus_keyword":null,"additional_keywords":null,"truseo_locale":null},"gt_translate_keys":[{"key":"link","format":"url"}],"_links":{"self":[{"href":"https:\/\/prohoster.info\/bs\/wp-json\/wp\/v2\/posts\/30900","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/prohoster.info\/bs\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/prohoster.info\/bs\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/prohoster.info\/bs\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/prohoster.info\/bs\/wp-json\/wp\/v2\/comments?post=30900"}],"version-history":[{"count":0,"href":"https:\/\/prohoster.info\/bs\/wp-json\/wp\/v2\/posts\/30900\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/prohoster.info\/bs\/wp-json\/wp\/v2\/media\/22879"}],"wp:attachment":[{"href":"https:\/\/prohoster.info\/bs\/wp-json\/wp\/v2\/media?parent=30900"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/prohoster.info\/bs\/wp-json\/wp\/v2\/categories?post=30900"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/prohoster.info\/bs\/wp-json\/wp\/v2\/tags?post=30900"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}