{"id":34419,"date":"2019-10-31T21:58:13","date_gmt":"2019-10-31T18:58:13","guid":{"rendered":"https:\/\/prohoster.info\/blog\/ispolzuem-vse-vozmozhnosti-indeksov-v-postgresql\/"},"modified":"2019-10-31T21:58:13","modified_gmt":"2019-10-31T18:58:13","slug":"ispolzuem-vse-vozmozhnosti-indeksov-v-postgresql","status":"publish","type":"post","link":"https:\/\/prohoster.info\/bs\/blog\/administrirovanie\/ispolzuem-vse-vozmozhnosti-indeksov-v-postgresql","title":{"rendered":"Iskoristite sve mogu\u0107nosti indeksa u PostgreSQL","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"<p><img decoding=\"async\" alt=\"Iskoristite sve mogu\u0107nosti indeksa u PostgreSQL\" src=\"\/wp-content\/uploads\/2019\/05\/34a92715e0cfaff2519d1aea460592ea.jpg\" style=\"display:block;margin: 0 auto;\" \/><br \/>\nU svijetu Postgres indeksi su izuzetno va\u017eni za efikasnu navigaciju po skladi\u0161tu baze podataka (koje se naziva \u201eheap\u201c). Postgres ne podr\u017eava klasterizaciju za njega, a MVCC arhitektura dovodi do toga da se akumulira mnogo verzija istog tuplja. Stoga je veoma va\u017eno umjeti kreirati i odr\u017eavati efikasne indekse za podr\u0161ku aplikacijama.<\/p>\n<p>Predla\u017eem nekoliko savjeta za optimizaciju i pobolj\u0161anje kori\u0161tenja indeksa.<\/p>\n<p><i>Napomena: ispod prikazani upiti rade na neizmijenjenom <noindex><a rel=\"nofollow\" href=\"https:\/\/github.com\/devrimgunduz\/pagila\">uzorku baze podataka pagila.<\/a><\/noindex>.<\/i><br \/>\n<noindex><a rel=\"nofollow\" name=\"habracut\"><\/a><\/noindex><\/p>\n<h3>Kori\u0161tenje pokrivaju\u0107ih indeksa (Covering Indexes)<\/h3>\n<p>\nPogledajmo upit za izdvajanje adresa e-po\u0161te za neaktivne korisnike. U tabeli <code>customer<\/code> ima kolonu <code>aktivno<\/code>, a upit je prili\u010dno jednostavan:<\/p>\n<pre><code class=\"sql\">pagila=# EXPLAIN SELECT email FROM customer WHERE active=0;\n                        PLAN OUPITA\n-----------------------------------------------------------\n Sekvencijalno skeniranje na customer  (tro\u0161ak=0.00..16.49 redova=15 \u0161irina=32)\n   Filter: (active = 0)\n(2 reda)<\/code><\/pre>\n<p>\nUpit poziva cjelokupno sekvencijalno skeniranje tabele <code>customer<\/code>. Kreirajmo indeks za kolonu <code>aktivno<\/code>:<\/p>\n<pre><code class=\"sql\">pagila=# CREATE INDEX idx_cust1 ON customer(active);\nCREATE INDEX\npagila=# EXPLAIN SELECT email FROM customer WHERE active=0;\n                                 PLAN OUPITA\n-----------------------------------------------------------------------------\n Indeks skeniranje koriste\u0107i idx_cust1 na customer  (tro\u0161ak=0.28..12.29 redova=15 \u0161irina=32)\n   Indeks uvjet: (active = 0)\n(2 reda)<\/code><\/pre>\n<p>\nPomoglo, sljede\u0107e skeniranje je postalo &#171;<code>indeks skeniranje<\/code>&#171;. To zna\u010di da \u0107e Postgres skenirati indeks &#171;<code>idx_cust1<\/code>&#171;, a zatim \u0107e nastaviti pretra\u017eivanje u hrpi tablice kako bi pro\u010ditao vrijednosti drugih kolona (u ovom slu\u010daju, kolonu <code>email<\/code>), koje su potrebne upitu.<\/p>\n<p>U PostgreSQL 11 su uvedeni pokrivaju\u0107i indeksi. Oni omogu\u0107avaju uklju\u010divanje jedne ili vi\u0161e dodatnih kolona u sam indeks \u2014 njihove vrijednosti se \u010duvaju u skladi\u0161tu podataka indeksa.<\/p>\n<p>Da smo iskoristili ovu mogu\u0107nost i dodali vrijednost e-po\u0161te unutar indeksa, Postgresu ne bi bilo potrebno tra\u017eiti u heap-u tabele vrijednost <code>email<\/code>. Pogledajmo ho\u0107e li to raditi:<\/p>\n<pre><code class=\"sql\">pagila=# CREATE INDEX idx_cust2 ON customer(active) INCLUDE (email);\nCREATE INDEX\npagila=# EXPLAIN SELECT email FROM customer WHERE active=0;\n                                    PLAN OUPITA\n----------------------------------------------------------------------------------\n Indeks samo skeniranje koriste\u0107i idx_cust2 na customer  (tro\u0161ak=0.28..12.29 redova=15 \u0161irina=32)\n   Indeks uvjet: (active = 0)\n(2 reda)<\/code><\/pre>\n<p>\n\u00ab<code>Indeks samo skeniranje<\/code>&#187; nam govori da je za zahtjev sada dovoljan samo indeks, \u0161to poma\u017ee izbjegavanju svih diskovnih operacija ulaza\/izlaza za \u010ditanje hrpe tablice.<\/p>\n<p>Trenutno, pokriva\u010dki indeksi su dostupni samo za B-stabla. Me\u0111utim, u ovom slu\u010daju, napori za odr\u017eavanje \u0107e biti ve\u0107i.<\/p>\n<h3>Kori\u0161\u0107enje delimi\u010dnih indeksa<\/h3>\n<p>\nDelimi\u010dni indeksi indeksiraju samo podskup redova tabele. To omogu\u0107ava u\u0161tedu na veli\u010dini indeksa i br\u017ee izvo\u0111enje skeniranja.<\/p>\n<p>Pretpostavimo da nam je potreban spisak e-mail adresa na\u0161ih klijenata iz Kalifornije. Upit \u0107e izgledati ovako:<\/p>\n<pre><code class=\"sql\">SELECT c.email FROM customer c\nJOIN address a ON c.address_id = a.address_id\nWHERE a.district = 'California';\nkoji ima plan upita koji uklju\u010duje skeniranje obe spojene tabele:\npagila=# EXPLAIN SELECT c.email FROM customer c\npagila-# JOIN address a ON c.address_id = a.address_id\npagila-# WHERE a.district = 'California';\n                              PLAN UPITA\n----------------------------------------------------------------------\n Hash Join  (tro\u0161ak=15.65..32.22 redova=9 \u0161irine=32)\n   Hash Cond: (c.address_id = a.address_id)\n   -&gt;  Seq Scan on customer c  (tro\u0161ak=0.00..14.99 redova=599 \u0161irine=34)\n   -&gt;  Hash  (tro\u0161ak=15.54..15.54 redova=9 \u0161irine=4)\n         -&gt;  Seq Scan on address a  (tro\u0161ak=0.00..15.54 redova=9 \u0161irine=4)\n               Filter: (district = 'California'::text)\n(6 redova)<\/code><\/pre>\n<p>\n\u0160ta \u0107e nam dati obi\u010dni indeksi:<\/p>\n<pre><code class=\"sql\">pagila=# CREATE INDEX idx_address1 ON address(district);\nCREATE INDEX\npagila=# EXPLAIN SELECT c.email FROM customer c\npagila-# JOIN address a ON c.address_id = a.address_id\npagila-# WHERE a.district = 'California';\n                                      PLAN UPITA\n---------------------------------------------------------------------------------------\n Hash Join  (tro\u0161ak=12.98..29.55 redova=9 \u0161irine=32)\n   Hash Cond: (c.address_id = a.address_id)\n   -&gt;  Seq Scan on customer c  (tro\u0161ak=0.00..14.99 redova=599 \u0161irine=34)\n   -&gt;  Hash  (tro\u0161ak=12.87..12.87 redova=9 \u0161irine=4)\n         -&gt;  Bitmap Heap Scan on address a  (tro\u0161ak=4.34..12.87 redova=9 \u0161irine=4)\n               Recheck Cond: (district = 'California'::text)\n               -&gt;  Bitmap Index Scan on idx_address1  (tro\u0161ak=0.00..4.34 redova=9 \u0161irine=0)\n                     Index Cond: (district = 'California'::text)\n(8 redova)<\/code><\/pre>\n<p>\nSkeniranje <code>address<\/code> bilo zamenjeno skeniranjem indeksa <code>idx_address1<\/code>, a zatim je skenirana hrpa <code>address<\/code>.<\/p>\n<p>Po\u0161to je ovo \u010dest upit i potrebno ga je optimizovati, mo\u017eemo koristiti delimi\u010dni indeks koji indeksira samo one redove sa adresama gde je okrug <code>\u2018California\u2019<\/code>:<\/p>\n<pre><code class=\"sql\">pagila=# CREATE INDEX idx_address2 ON address(address_id) WHERE district='California';\nCREATE INDEX\npagila=# EXPLAIN SELECT c.email FROM customer c\npagila-# JOIN address a ON c.address_id = a.address_id\npagila-# WHERE a.district = 'California';\n                                           PLAN UPITA\n------------------------------------------------------------------------------------------------\n Hash Join  (tro\u0161ak=12.38..28.96 redova=9 \u0161irine=32)\n   Hash Cond: (c.address_id = a.address_id)\n   -&gt;  Seq Scan on customer c  (tro\u0161ak=0.00..14.99 redova=599 \u0161irine=34)\n   -&gt;  Hash  (tro\u0161ak=12.27..12.27 redova=9 \u0161irine=4)\n         -&gt;  Index Only Scan using idx_address2 on address a  (tro\u0161ak=0.14..12.27 redova=9 \u0161irine=4)\n(5 redova)<\/code><\/pre>\n<p>\nSada upit \u010dita samo <code>idx_address2<\/code> i ne dodiruje tabelu <code>address<\/code>.<\/p>\n<h3>Kori\u0161\u0107enje vi\u0161estrukih indeksa (Multi-Value Indexes)<\/h3>\n<p>\nNeke kolone koje treba indeksirati mo\u017eda ne\u0107e sadr\u017eavati skalarni tip podataka. Tipovi kolona poput <code>jsonb<\/code>, <code>nizova<\/code> i <code>tsvector<\/code> mogu sadr\u017eavati slo\u017eene ili vi\u0161estruke vrednosti. Ako potrebno indeksirati takve kolone, obi\u010dno se mora pretra\u017eivati svaka pojedina\u010dna vrednost u tim kolonama.<\/p>\n<p>Poku\u0161ajmo prona\u0107i nazive svih filmova koji sadr\u017ee isje\u010dke iz neuspelih dupliranja. U tabeli <code>film<\/code> postoji tekstualna kolona koja se zove <code>special_features<\/code>. Ako film ima ovo \"posebno svojstvo\", tada kolona sadr\u017ei element u obliku tekstualnog niza <code>Behind The Scenes<\/code>. Da bismo prona\u0161li sve takve filmove, trebamo izabrati sve redove sa \"Behind The Scenes\" pri <b>bilo kojim <\/b>vrednostima niza <code>special_features<\/code>:<\/p>\n<pre><code class=\"sql\">SELECT title FROM film WHERE special_features @&gt; '{\"Behind The Scenes\"}';<\/code><\/pre>\n<p>\nOperator umetnosti (containment operator) <code>@&gt;<\/code> proverava da li je desna strana podskup leve strane.<\/p>\n<p>Plan upita:<\/p>\n<pre><code class=\"sql\">pagila=# EXPLAIN SELECT title FROM film\npagila-# WHERE special_features @&gt; '{\"Behind The Scenes\"}';\n                           QUERY PLAN\n-----------------------------------------------------------------\n Seq Scan on film  (cost=0.00..67.50 rows=5 width=15)\n   Filter: (special_features @&gt; '{\"Behind The Scenes\"}'::text[])\n(2 rows)<\/code><\/pre>\n<p>\nKoji zahteva potpuno skeniranje hrpe sa tro\u0161kovima 67.<\/p>\n<p>Pogledajmo da li \u0107e nam obi\u010dan B-stablo indeks pomo\u0107i:<\/p>\n<pre><code class=\"sql\">pagila=# CREATE INDEX idx_film1 ON film(special_features);\nCREATE INDEX\npagila=# EXPLAIN SELECT title FROM film\npagila-# WHERE special_features @&gt; '{\"Behind The Scenes\"}';\n                           QUERY PLAN\n-----------------------------------------------------------------\n Seq Scan on film  (cost=0.00..67.50 rows=5 width=15)\n   Filter: (special_features @&gt; '{\"Behind The Scenes\"}'::text[])\n(2 rows)<\/code><\/pre>\n<p>\nIndeks \u010dak nije razmatran. B-stablo indeks ne prepoznaje postojanje pojedina\u010dnih elemenata u indeksiranim vrednostima.<\/p>\n<p>Potrebna nam je GIN-indeks.<\/p>\n<pre><code class=\"sql\">pagila=# CREATE INDEX idx_film2 ON film USING GIN(special_features);\nCREATE INDEX\npagila=# EXPLAIN SELECT title FROM film\npagila-# WHERE special_features @&gt; '{\"Behind The Scenes\"}';\n                                QUERY PLAN\n---------------------------------------------------------------------------\n Bitmap Heap Scan on film  (cost=8.04..23.58 rows=5 width=15)\n   Recheck Cond: (special_features @&gt; '{\"Behind The Scenes\"}'::text[])\n   -&gt;  Bitmap Index Scan on idx_film2  (cost=0.00..8.04 rows=5 width=0)\n         Index Cond: (special_features @&gt; '{\"Behind The Scenes\"}'::text[])\n(4 rows)<\/code><\/pre>\n<p>\nGIN-indeks podr\u017eava mapiranje pojedina\u010dnih vrednosti na indeksirane slo\u017eene vrednosti, kao rezultat \u0161to \u0107e tro\u0161kovi plana upita smanjiti vi\u0161e od polovine.<\/p>\n<h3>Re\u0161avamo se dupliranja indeksa<\/h3>\n<p>\nIndeksi se akumuliraju tokom vremena, i ponekad novi indeks mo\u017ee sadr\u017eavati isto definiciju kao i jedan od prethodnih. Za \u010ditljive SQL definicije indeksa mo\u017eete koristiti katalog predstave <code>pg_indexes<\/code>. Tako\u0111e \u0107ete mo\u0107i lako prona\u0107i identi\u010dne definicije:<\/p>\n<pre><code class=\"sql\"> SELECT array_agg(indexname) AS indexes, replace(indexdef, indexname, '') AS defn\n    FROM pg_indexes\nGROUP BY defn\n  HAVING count(*) &gt; 1;\nI evo rezultata kada se izvr\u0161i na osnovnoj pagila bazi podataka:\npagila=#   SELECT array_agg(indexname) AS indexes, replace(indexdef, indexname, '') AS defn\npagila-#     FROM pg_indexes\npagila-# GROUP BY defn\npagila-#   HAVING count(*) &gt; 1;\n                                indexes                                 |                                defn\n------------------------------------------------------------------------+------------------------------------------------------------------\n {payment_p2017_01_customer_id_idx,idx_fk_payment_p2017_01_customer_id} | CREATE INDEX  ON public.payment_p2017_01 USING btree (customer_id\n {payment_p2017_02_customer_id_idx,idx_fk_payment_p2017_02_customer_id} | CREATE INDEX  ON public.payment_p2017_02 USING btree (customer_id\n {payment_p2017_03_customer_id_idx,idx_fk_payment_p2017_03_customer_id} | CREATE INDEX  ON public.payment_p2017_03 USING btree (customer_id\n {idx_fk_payment_p2017_04_customer_id,payment_p2017_04_customer_id_idx} | CREATE INDEX  ON public.payment_p2017_04 USING btree (customer_id\n {payment_p2017_05_customer_id_idx,idx_fk_payment_p2017_05_customer_id} | CREATE INDEX  ON public.payment_p2017_05 USING btree (customer_id\n {idx_fk_payment_p2017_06_customer_id,payment_p2017_06_customer_id_idx} | CREATE INDEX  ON public.payment_p2017_06 USING btree (customer_id\n(6 rows)\n<\/code><\/pre>\n<p><\/p>\n<h3>Indeksi nadmno\u017estava (Superset Indexes)<\/h3>\n<p>\nMo\u017ee se dogoditi da vam se nakupi mnogo indeksa, od kojih jedan indeksira nadmno\u017eak kolona, koje indeksiraju drugi indeksi. To mo\u017ee biti po\u017eeljno ili ne \u2014 nadmno\u017eak mo\u017ee dovesti do skeniranja samo kroz indekse, \u0161to je dobro, ali mo\u017ee zauzimati previ\u0161e prostora, ili zahtev, za optimizaciju kojeg je ovaj nadmno\u017eak bio namenjen, vi\u0161e se ne koristi.<\/p>\n<p>Ako \u017eelite automatizovati identifikaciju ovakvih indeksa, mo\u017eete po\u010deti sa <noindex><a rel=\"nofollow\" href=\"https:\/\/www.postgresql.org\/docs\/current\/catalog-pg-index.html\">pg_index<\/a><\/noindex> iz tabele <code>pg_catalog<\/code>.<\/p>\n<h3>Neiskori\u0161\u0107eni indeksi<\/h3>\n<p>\nKako se razvijaju aplikacije koje koriste baze podataka, razvijaju se i njihovi zahtevi. Indeksi dodati ranije mo\u017eda vi\u0161e nisu kori\u0161\u0107eni ni jednim zahtevom. Prilikom svake analize indeksa, on se ozna\u010dava od strane menad\u017eera statistike, i u prikazu sistemskog kataloga <code>pg_stat_user_indexes<\/code> mo\u017eete proveriti vrednost <code>idx_scan<\/code>, koji je akumulativni broja\u010d. Pra\u0107enje ove vrijednosti tokom odre\u0111enog vremenskog perioda (recimo, mjesec dana) pru\u017eit \u0107e dobar uvid u to koje indekse nije mogu\u0107e koristiti i koji se mogu ukloniti.<\/p>\n<p>Evo upita za dobijanje trenutnih broja\u010da skeniranja svih indeksa u \u0161emi <code>\u2018public\u2019<\/code>:<\/p>\n<pre><code class=\"sql\">SELECT relname, indexrelname, idx_scan\nFROM   pg_catalog.pg_stat_user_indexes\nWHERE  schemaname = 'public';\nizlaz kao \u0161to je ovo:\npagila=# SELECT relname, indexrelname, idx_scan\npagila-# FROM   pg_catalog.pg_stat_user_indexes\npagila-# WHERE  schemaname = 'public'\npagila-# LIMIT  10;\n    relname    |    indexrelname    | idx_scan\n---------------+--------------------+----------\n customer      | customer_pkey      |    32093\n actor         | actor_pkey         |     5462\n address       | address_pkey       |      660\n category      | category_pkey      |     1000\n city          | city_pkey          |      609\n country       | country_pkey       |      604\n film_actor    | film_actor_pkey    |        0\n film_category | film_category_pkey |        0\n film          | film_pkey          |    11043\n inventory     | inventory_pkey     |    16048\n(10 redova)<\/code><\/pre>\n<p><\/p>\n<h3>Ponovno kreiranje indeksa uz manje zaklju\u010davanja<\/h3>\n<p>\n\u010cesto se indeksi moraju ponovo kreirati, na primjer, kada se pro\u0161ire i ponovo kreiranje mo\u017ee ubrzati skeniranje. Tako\u0111e, indeksi mogu biti o\u0161te\u0107eni. Promjena parametara indeksa tako\u0111e mo\u017ee zahtijevati njegovo ponovno kreiranje.<\/p>\n<h3>Omogu\u0107avanje paralelnog kreiranja indeksa<\/h3>\n<p>\nU PostgreSQL 11, kreiranje B-Tree indeksa je konkurentno. Za ubrzanje procesa kreiranja mo\u017ee se koristiti nekoliko paralelno aktivnih radnika. Me\u0111utim, pobrinite se da su ovi konfiguracijski parametri ispravno postavljeni:<\/p>\n<pre><code class=\"sql\">SET max_parallel_workers = 32;\nSET max_parallel_maintenance_workers = 16;<\/code><\/pre>\n<p>\nZadane vrijednosti su preniske. Idealno, ove brojke treba pove\u0107avati zajedno s brojem jezgri procesora. Vi\u0161e informacija mo\u017eete pro\u010ditati u <noindex><a rel=\"nofollow\" href=\"https:\/\/www.postgresql.org\/docs\/current\/runtime-config-resource.html#RUNTIME-CONFIG-RESOURCE-ASYNC-BEHAVIOR\">dokumentaciji<\/a><\/noindex>.<\/p>\n<h3>Pozadinsko kreiranje indeksa<\/h3>\n<p>\nMo\u017eete kreirati indeks u pozadini koriste\u0107i parametar <code>CONCURRENTLY<\/code> komandi <code>CREATE INDEX<\/code>:<\/p>\n<pre><code class=\"sql\">pagila=# CREATE INDEX CONCURRENTLY idx_address1 ON address(district);\nCREATE INDEX<\/code><\/pre>\n<p>Ova procedura kreiranja indeksa se razlikuje od obi\u010dne po tome \u0161to ne zahtijeva zaklju\u010davanje tabele, \u0161to zna\u010di da ne blokira operacije pisanja. S druge strane, traje du\u017ee i tro\u0161i vi\u0161e resursa.<\/p>\n<p>Postgres pru\u017ea mnoge fleksibilne mogu\u0107nosti za kreiranje indeksa i rje\u0161avanje bilo kojih specifi\u010dnih slu\u010dajeva, a tako\u0111er nudi na\u010dine za upravljanje bazom podataka u slu\u010daju eksplozivnog rasta va\u0161e aplikacije. Nadamo se da \u0107e vam ovi savjeti pomo\u0107i da u\u010dinite upite br\u017eim, a bazu spremnom za skaliranje.<br \/>\n<br \/>Izvor: <a content=\"nofollow\" rel=\"nofollow\" href=\"https:\/\/habr.com\/ru\/company\/mailru\/blog\/453046\/\">habr.com<\/a><\/p>","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"excerpt":{"rendered":"<p>\u0412 \u043c\u0438\u0440\u0435 Postgres \u0438\u043d\u0434\u0435\u043a\u0441\u044b \u043a\u0440\u0430\u0439\u043d\u0435 \u0432\u0430\u0436\u043d\u044b \u0434\u043b\u044f \u044d\u0444\u0444\u0435\u043a\u0442\u0438\u0432\u043d\u043e\u0439 \u043d\u0430\u0432\u0438\u0433\u0430\u0446\u0438\u0438 \u043f\u043e \u0445\u0440\u0430\u043d\u0438\u043b\u0438\u0449\u0443 \u0431\u0430\u0437\u044b \u0434\u0430\u043d\u043d\u044b\u0445 (\u0435\u0433\u043e \u043d\u0430\u0437\u044b\u0432\u0430\u044e\u0442 \u00ab\u043a\u0443\u0447\u0430\u00bb, heap). Postgres \u043d\u0435 \u043f\u043e\u0434\u0434\u0435\u0440\u0436\u0438\u0432\u0430\u0435\u0442 \u0434\u043b\u044f \u043d\u0435\u0433\u043e \u043a\u043b\u0430\u0441\u0442\u0435\u0440\u0438\u0437\u0430\u0446\u0438\u044e, \u0438 \u0430\u0440\u0445\u0438\u0442\u0435\u043a\u0442\u0443\u0440\u0430 MVCC \u043f\u0440\u0438\u0432\u043e\u0434\u0438\u0442 \u043a \u0442\u043e\u043c\u0443, \u0447\u0442\u043e \u0443 \u0432\u0430\u0441 \u043d\u0430\u043a\u0430\u043f\u043b\u0438\u0432\u0430\u0435\u0442\u0441\u044f \u043c\u043d\u043e\u0433\u043e \u0432\u0435\u0440\u0441\u0438\u0439 \u043e\u0434\u043d\u043e\u0433\u043e \u0438 \u0442\u043e\u0433\u043e \u0436\u0435 \u043a\u043e\u0440\u0442\u0435\u0436\u0430. \u041f\u043e\u044d\u0442\u043e\u043c\u0443 \u043e\u0447\u0435\u043d\u044c \u0432\u0430\u0436\u043d\u043e \u0443\u043c\u0435\u0442\u044c \u0441\u043e\u0437\u0434\u0430\u0432\u0430\u0442\u044c \u0438 \u0441\u043e\u043f\u0440\u043e\u0432\u043e\u0436\u0434\u0430\u0442\u044c \u044d\u0444\u0444\u0435\u043a\u0442\u0438\u0432\u043d\u044b\u0435 \u0438\u043d\u0434\u0435\u043a\u0441\u044b \u0434\u043b\u044f \u043f\u043e\u0434\u0434\u0435\u0440\u0436\u043a\u0438 \u043f\u0440\u0438\u043b\u043e\u0436\u0435\u043d\u0438\u0439. \u041f\u0440\u0435\u0434\u043b\u0430\u0433\u0430\u044e \u0432\u0430\u0448\u0435\u043c\u0443 \u0432\u043d\u0438\u043c\u0430\u043d\u0438\u044e [&hellip;]<\/p>\n","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"author":1,"featured_media":25931,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[688],"tags":[],"class_list":["post-34419","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 \u043c\u0438\u0440\u0435 Postgres \u0438\u043d\u0434\u0435\u043a\u0441\u044b \u043a\u0440\u0430\u0439\u043d\u0435 \u0432\u0430\u0436\u043d\u044b \u0434\u043b\u044f.\" \/>\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\/ispolzuem-vse-vozmozhnosti-indeksov-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\u0418\u0441\u043f\u043e\u043b\u044c\u0437\u0443\u0435\u043c \u0432\u0441\u0435 \u0432\u043e\u0437\u043c\u043e\u0436\u043d\u043e\u0441\u0442\u0438 \u0438\u043d\u0434\u0435\u043a\u0441\u043e\u0432 \u0432 PostgreSQL | ProHoster\" \/>\n\t\t<meta property=\"og:description\" content=\"\u0412 \u043c\u0438\u0440\u0435 Postgres \u0438\u043d\u0434\u0435\u043a\u0441\u044b \u043a\u0440\u0430\u0439\u043d\u0435 \u0432\u0430\u0436\u043d\u044b \u0434\u043b\u044f.\" \/>\n\t\t<meta property=\"og:url\" content=\"https:\/\/prohoster.info\/bs\/blog\/administrirovanie\/ispolzuem-vse-vozmozhnosti-indeksov-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:58:13+00:00\" \/>\n\t\t<meta property=\"article:modified_time\" content=\"2019-10-31T18:58:13+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\udd47Iskoristite sve mogu\u0107nosti indeksa u PostgreSQL-u | ProHoster","description":"U svijetu Postgresa indeksi su izuzetno va\u017eni za.","canonical_url":"https:\/\/prohoster.info\/bs\/blog\/administrirovanie\/ispolzuem-vse-vozmozhnosti-indeksov-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\u0418\u0441\u043f\u043e\u043b\u044c\u0437\u0443\u0435\u043c \u0432\u0441\u0435 \u0432\u043e\u0437\u043c\u043e\u0436\u043d\u043e\u0441\u0442\u0438 \u0438\u043d\u0434\u0435\u043a\u0441\u043e\u0432 \u0432 PostgreSQL | ProHoster","og:description":"\u0412 \u043c\u0438\u0440\u0435 Postgres \u0438\u043d\u0434\u0435\u043a\u0441\u044b \u043a\u0440\u0430\u0439\u043d\u0435 \u0432\u0430\u0436\u043d\u044b \u0434\u043b\u044f.","og:url":"https:\/\/prohoster.info\/bs\/blog\/administrirovanie\/ispolzuem-vse-vozmozhnosti-indeksov-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:58:13+00:00","article:modified_time":"2019-10-31T18:58:13+00:00","article:publisher":"https:\/\/www.facebook.com\/prohoster","article:author":"https:\/\/www.facebook.com\/prohoster"},"aioseo_meta_data":{"post_id":"34419","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 19:13:20","breadcrumb_settings":null,"limit_modified_date":false,"reviewed_by":null,"ai":null,"created":"2021-02-28 13:52:22","updated":"2026-01-21 19:13:20","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\/34419","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=34419"}],"version-history":[{"count":0,"href":"https:\/\/prohoster.info\/bs\/wp-json\/wp\/v2\/posts\/34419\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/prohoster.info\/bs\/wp-json\/wp\/v2\/media\/25931"}],"wp:attachment":[{"href":"https:\/\/prohoster.info\/bs\/wp-json\/wp\/v2\/media?parent=34419"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/prohoster.info\/bs\/wp-json\/wp\/v2\/categories?post=34419"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/prohoster.info\/bs\/wp-json\/wp\/v2\/tags?post=34419"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}