{"id":32353,"date":"2019-10-31T21:46:32","date_gmt":"2019-10-31T18:46:32","guid":{"rendered":"https:\/\/prohoster.info\/blog\/monitoring-proizvoditelnosti-zaprosov-postgresql-chast-1-reporting\/"},"modified":"2019-10-31T21:46:32","modified_gmt":"2019-10-31T18:46:32","slug":"monitoring-proizvoditelnosti-zaprosov-postgresql-chast-1-reporting","status":"publish","type":"post","link":"https:\/\/prohoster.info\/ro\/blog\/administrirovanie\/monitoring-proizvoditelnosti-zaprosov-postgresql-chast-1-reporting","title":{"rendered":"Monitorizarea performan\u021bei interog\u0103rilor PostgreSQL. Partea 1 \u2014 raportare","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"<p>Inginer \u2014 tradus din latin\u0103 ca fiind inspirat.<br \/>\nInginerul poate face orice. (c) R.Diesel.<br \/>\n<i>Epigrafe.<\/i><br \/>\n<img decoding=\"async\" alt=\"Monitorizarea performan\u021bei interog\u0103rilor PostgreSQL. Partea 1 \u2014 raportare\" src=\"\/wp-content\/uploads\/2019\/04\/9a2640267ea05006b94e03642b864ddc.jpeg\" style=\"display:block;margin: 0 auto;\" \/><br \/>\n<i>Sau povestea despre de ce un administrator de baze de date ar trebui s\u0103-\u0219i aminteasc\u0103 trecutul de programator. <\/i><\/p>\n<h2>Prefa\u021b\u0103<\/h2>\n<p>\nToate numele sunt modificate. Coinciden\u021bele sunt \u00eent\u00e2mpl\u0103toare. Materialul reprezint\u0103 exclusiv opinia personal\u0103 a autorului.<\/p>\n<blockquote><p><b>Declinarea garan\u021biilor:<\/b> <i>\u00een ciclul planificat de articole nu va exista o descriere detaliat\u0103 \u0219i exact\u0103 a tabelelor \u0219i scripturilor folosite. Materialele nu pot fi utilizate imediat \u201eCA ATARE\u201d. <br \/>\n\u00cen primul r\u00e2nd, din cauza volumului mare de material, <br \/>\n\u00een al doilea r\u00e2nd, din cauza adapt\u0103rii la baza de produc\u021bie a clientului real. <br \/>\nDe aceea, \u00een articole vor fi prezentate doar idei \u0219i descrieri \u00een cele mai generale termeni. <br \/>\nPoate, \u00een viitor, sistemul va ajunge la nivelul de a fi publicat pe GitHub, poate nu. Timpul va ar\u0103ta.<\/i><\/p><\/blockquote>\n<p>\n\u00cenceputul pove\u0219tii- \u201e<noindex><a rel=\"nofollow\" href=\"https:\/\/habr.com\/ru\/company\/icl_services\/blog\/446314\/\">\u00ce\u021bi aminte\u0219ti cum a \u00eenceput totul<\/a><\/noindex>\u00bb.<br \/>\nCe s-a ob\u021binut \u00een rezultat, \u00een cele mai generale contururi- \u201e<noindex><a rel=\"nofollow\" href=\"https:\/\/habr.com\/ru\/post\/444988\/\">Sintez\u0103 ca o metod\u0103 de \u00eembun\u0103t\u0103\u021bire a performan\u021bei PostgreSQL<\/a><\/noindex>\u00bb<\/p>\n<h2>De ce \u00eemi trebuie asta?<\/h2>\n<p>\nEi bine, \u00een primul r\u00e2nd, pentru a nu uita, \u00een amintiri, \u00een pensionare, zilele glorioase. <br \/>\n\u00cen al doilea r\u00e2nd, pentru a sistematiza ceea ce am scris. C\u0103ci deja, uneori, \u00eencep s\u0103 m\u0103 \u00eencurc \u0219i s\u0103 uit p\u0103r\u021bi separate. <\/p>\n<p>\u0218i cel mai important \u2014 poate c\u0103 va fi de folos cuiva \u0219i va ajuta s\u0103 nu reinventeze bicicleta \u0219i s\u0103 nu str\u00e2ng\u0103 greble. Cu alte cuvinte, s\u0103-\u0219i \u00eembun\u0103t\u0103\u021beasc\u0103 karma (nu cea de pe Habr). C\u0103ci, cel mai valoros lucru \u00een aceast\u0103 lume sunt ideile. Principalul este s\u0103 g\u0103se\u0219ti o idee. Iar a implementa o idee \u00een realitate este deja o problem\u0103 pur tehnic\u0103.<\/p>\n<p>Deci, s\u0103 \u00eencepem, \u00eencet\u2026<\/p>\n<h2>Stabilirea sarcinii.<\/h2>\n<p><\/p>\n<h3>Exist\u0103: <\/h3>\n<p>\nBaza de date PostgreSQL(10.5), de tip mixt de \u00eenc\u0103rcare (OLTP+DSS), cu o \u00eenc\u0103rcare medie-mic\u0103, situat\u0103 \u00een cloud AWS. <br \/>\nMonitorizarea bazei de date lipse\u0219te, iar monitorizarea infrastructurii este prezentat\u0103 sub forma instrumentelor standard AWS \u00een configura\u021bie minim\u0103.<\/p>\n<h3>Este necesar:<\/h3>\n<p>\nMonitorizarea performan\u021bei \u0219i st\u0103rii bazei de date, g\u0103sirea \u0219i ob\u021binerea informa\u021biilor ini\u021biale pentru optimizarea interog\u0103rilor grele c\u0103tre baza de date.<br \/>\n<noindex><a rel=\"nofollow\" name=\"habracut\"><\/a><\/noindex><\/p>\n<h2>O scurt\u0103 prefa\u021b\u0103 sau analiz\u0103 a variantelor de solu\u021bie<\/h2>\n<p>\nPentru \u00eenceput, vom \u00eencerca s\u0103 analiz\u0103m variantele de solu\u021bie a sarcinii din perspectiva unei analize comparative a beneficiilor \u0219i nepl\u0103cerilor pentru inginer, iar beneficiile \u0219i pierderile managementului s\u0103 fie l\u0103sate celor care sunt desemna\u021bi pentru asta conform organigramei.<\/p>\n<h3>Varianta 1- \u201eLucr\u00e2nd la cerere\u201d<\/h3>\n<p>\nL\u0103s\u0103m totul a\u0219a cum este. Dac\u0103 clientul nu este mul\u021bumit de func\u021bionarea, performan\u021ba bazei de date sau a aplica\u021biei, acesta va informa inginerii DBA prin e-mail sau va crea un incident \u00een sistemul de ticketing. <br \/>\nInginerul, dup\u0103 ce prime\u0219te notificarea, se va ocupa de problem\u0103, va propune o solu\u021bie sau va pune problema pe un plan secundar, sper\u00e2nd c\u0103 totul se va rezolva de la sine \u0219i, oricum, cur\u00e2nd totul va fi uitat.<br \/>\n<b class=\"spoiler_title\">Pr\u0103jituri \u0219i gogo\u0219i, v\u00e2n\u0103t\u0103i \u0219i umfl\u0103turi<\/b><b>Pr\u0103jituri \u0219i gogo\u0219i:<\/b><br \/>\n1. Nu trebuie s\u0103 facem nimic \u00een plus.<br \/>\n2. Sempre exist\u0103 posibilitatea de a te eschiva \u0219i a evita responsabilit\u0103\u021bile. <br \/>\n3. O mul\u021bime de timp pe care \u00eel putem petrece dup\u0103 bunul plac.<br \/>\n<b>V\u00e2n\u0103t\u0103i \u0219i umfl\u0103turi:<\/b><br \/>\n1. Mai devreme sau mai t\u00e2rziu, clientul se va g\u00e2ndi la esen\u021ba existen\u021bei \u0219i la justi\u021bia universal\u0103 \u00een aceast\u0103 lume \u0219i se va \u00eentreba din nou \u2014 de ce pl\u0103tesc eu ace\u0219ti bani? Consecin\u021ba este \u00eentotdeauna aceea\u0219i \u2014 \u00eentrebarea este doar c\u00e2nd clientul se va plictisi \u0219i va renun\u021ba. \u0218i sursa de venit se va goli. Este trist.<br \/>\n2. Dezvoltarea inginerului \u2014 zero.<br \/>\n3. Dificult\u0103\u021bi \u00een planificarea muncii \u0219i a \u00eenc\u0103rc\u0103rii. <\/p>\n<h3>Varianta 2 - \u201eDan\u021buim cu tobe, v\u00e2ndem \u0219i \u00eenc\u0103l\u021b\u0103m\u201d<\/h3>\n<p>\n<b>Punctul 1<\/b>- De ce s\u0103 avem un sistem de monitorizare, vom ob\u021bine totul prin cereri. Vom lansa o mul\u021bime de cereri c\u0103tre dic\u021bionarul de date \u0219i prezent\u0103ri dinamice, activ\u0103m diverse contoruri, combin\u0103m totul \u00een tabele, analiz\u0103m periodic listele \u0219i tabelele. Drept rezultat, avem grafice frumoase sau nu foarte frumoase, tabele, rapoarte. Principalul este s\u0103 fie c\u00e2t mai multe.<br \/>\n<b>Punctul 2<\/b>- Gener\u0103m activitate \u2014 lans\u0103m analiza tuturor acestora.<br \/>\n<b>Punctul 3<\/b>- Preg\u0103tim un document oarecare, numim acest document pur \u0219i simplu \u2014 \u201ecum s\u0103 ne organiz\u0103m baza de date\u201d.<br \/>\n<b>Punctul 4<\/b>- Clientul, v\u0103z\u00e2nd toate aceste minunate grafice \u0219i cifre, se afl\u0103 \u00eentr-o naivitate copil\u0103reasc\u0103 \u2014 acum cu siguran\u021b\u0103 totul va func\u021biona, \u00een cur\u00e2nd. \u0218i renun\u021b\u0103 cu u\u0219urin\u021b\u0103 \u0219i f\u0103r\u0103 durere la resursele sale financiare. Managementul este, de asemenea, \u00eencrez\u0103tor \u2014 inginerii no\u0219tri lucreaz\u0103 excelent. \u00cenc\u0103rcarea este la maxim. <br \/>\n<b>Punctul 5<\/b>- Se repet\u0103 periodic Punctul 1.<br \/>\n<b class=\"spoiler_title\">Pr\u0103jituri \u0219i gogo\u0219i, v\u00e2n\u0103t\u0103i \u0219i umfl\u0103turi<\/b><b>Pr\u0103jituri \u0219i gogo\u0219i: <\/b><br \/>\n1. Via\u021ba managerilor \u0219i inginerilor este simpl\u0103, previzibil\u0103 \u0219i plin\u0103 de activitate. Totul zumz\u0103ie, to\u021bi sunt ocupa\u021bi. <br \/>\n2. Via\u021ba clientului nu este r\u0103u \u2014 el este \u00eentotdeauna convins c\u0103 trebuie s\u0103 mai aib\u0103 pu\u021bin\u0103 r\u0103bdare \u0219i totul se va rezolva. Se mai stric\u0103, ei bine, ce s\u0103 faci \u2014 acesta este o lume nedreapt\u0103, \u00een via\u021ba urm\u0103toare \u2014 va avea noroc.<br \/>\n<b>V\u00e2n\u0103t\u0103i \u0219i umfl\u0103turi:<\/b><br \/>\n1. Mai devreme sau mai t\u00e2rziu, va ap\u0103rea un furnizor mai rapid de servicii similare, care va face acela\u0219i lucru, dar un pic mai ieftin. \u0218i dac\u0103 rezultatul este acela\u0219i, de ce s\u0103 pl\u0103te\u0219ti mai mult? Aceasta va duce la dispari\u021bia surselor de venit.<br \/>\n2. Este plictisitor. A\u0219a cum este plictisitoare orice activitate lipsit\u0103 de sens.<br \/>\n3. Ca \u0219i \u00een varianta anterioar\u0103 \u2013 nu exist\u0103 nicio dezvoltare. Dar pentru inginer, dezavantajul este c\u0103, spre deosebire de prima variant\u0103, aici trebuie s\u0103 genereze constant date despre bazele de date. \u0218i acest lucru consum\u0103 timp. Timp pe care \u00eel po\u021bi folosi \u00een mod util pentru tine. C\u0103ci dac\u0103 nu ai grij\u0103 de tine, nimeni nu se va interesa de tine.<\/p>\n<h3>Varianta 3 \u2013 Nu trebuie s\u0103 reinventezi roata, trebuie s\u0103 o cumperi \u0219i s\u0103 te plimbi.<\/h3>\n<p>\nInginerii altor companii nu m\u0103n\u00e2nc\u0103 pizza \u0219i nu beau bere degeaba (ah, vremurile grozave din Sankt Petersburg \u00een anii '90). S\u0103 folosim sistemele de monitorizare care sunt deja create, bine reglate \u0219i care, de fapt, aduc un beneficiu (cel pu\u021bin pentru creatorii lor).<br \/>\n<b class=\"spoiler_title\">Pr\u0103jituri \u0219i gogo\u0219i, v\u00e2n\u0103t\u0103i \u0219i umfl\u0103turi<\/b><b>Pr\u0103jituri \u0219i gogo\u0219i:<\/b><br \/>\n1. Nu trebuie s\u0103 pierzi timpul invent\u00e2nd ceea ce a fost deja inventat. Ia-l \u0219i folose\u0219te-l.<br \/>\n2. Sistemele de monitorizare nu sunt scrise de prosti \u0219i, desigur, sunt utile.<br \/>\n3. Sistemele de monitorizare func\u021bionale ofer\u0103, de obicei, informa\u021bii utile \u0219i filtrate. <br \/>\n<b>V\u00e2n\u0103t\u0103i \u0219i umfl\u0103turi:<\/b><br \/>\n1. Inginerul \u00een acest caz nu este un inginer, ci doar un utilizator al unui produs str\u0103in. Sau un user.<br \/>\n2. Trebuie s\u0103 convingi clientul de necesitatea de a cump\u0103ra ceva \u00een care, de fapt, nu vrea s\u0103 se implice, nici nu ar trebui, iar bugetul pe anul acesta este deja aprobat \u0219i nu se va schimba. Apoi, trebuie s\u0103 aloci o resurs\u0103 separat\u0103, s\u0103 configurezi pentru sistemul respectiv. Adic\u0103, mai \u00eent\u00e2i trebuie s\u0103 pl\u0103te\u0219ti, s\u0103 pl\u0103te\u0219ti \u0219i iar s\u0103 pl\u0103te\u0219ti. Iar clientul este zg\u00e2rcit. Asta este norma acestei vie\u021bi.<\/p>\n<h2>Ce s\u0103 facem - Cern\u00ee\u0219evski? \u00centrebarea ta este foarte pertinent\u0103. (c)<\/h2>\n<p>\n\u00cen aceast\u0103 situa\u021bie specific\u0103 \u0219i dat\u0103, se poate proceda pu\u021bin diferit \u2013 <b>hai s\u0103 facem propriul nostru sistem de monitorizare. <\/b><br \/>\n<img decoding=\"async\" alt=\"Monitorizarea performan\u021bei interog\u0103rilor PostgreSQL. Partea 1 \u2014 raportare\" src=\"\/wp-content\/uploads\/2019\/04\/b59a3ad9e16b68c0fbc962a61d571c52.jpeg\" style=\"display:block;margin: 0 auto;\" \/><br \/>\nNu un sistem bine\u00een\u021beles, \u00een sensul propriu al cuv\u00e2ntului, este prea mult spus \u0219i arogant, dar m\u0103car s\u0103 ne u\u0219ur\u0103m sarcina \u0219i s\u0103 adun\u0103m mai multe informa\u021bii pentru rezolvarea incidentelor de performan\u021b\u0103. Ca s\u0103 nu ne afl\u0103m \u00een situa\u021bia \u2013 \u201emergi acolo, nu \u0219tiu unde, g\u0103se\u0219te asta, nu \u0219tiu ce\u201d.<\/p>\n<h4>Care sunt avantajele \u0219i dezavantajele acestei variante:<\/h4>\n<p><b>Pro:<\/b><br \/>\n1. Este interesant. Cel pu\u021bin mai interesant dec\u00e2t constantul \u201eshrink datafile, alter tablespace, etc.\u201d <br \/>\n2. Acestea sunt abilit\u0103\u021bi noi \u0219i o nou\u0103 dezvoltare. Ceea ce, \u00een perspectiv\u0103, va aduce, mai devreme sau mai t\u00e2rziu, recompense meritate \u0219i bonusuri.<br \/>\n<b>Dezavantaje:<\/b><br \/>\n1. Va trebui s\u0103 muncim. S\u0103 muncim mult. <br \/>\n2. Va trebui s\u0103 explic\u0103m regulat sensul \u0219i perspectivele \u00eentregii activit\u0103\u021bi.<br \/>\n3. Va trebui s\u0103 renun\u021b\u0103m la ceva, pentru c\u0103 singura resurs\u0103 disponibil\u0103 pentru inginer, timpul, este limitat\u0103 de Univers. <br \/>\n<b>4. Cel mai \u00eenfrico\u0219\u0103tor \u0219i nepl\u0103cut<\/b> \u2014 ca rezultat, poate ie\u0219i un lucru de genul \u201eNici \u0219oricel, nici broasc\u0103, ci o fiin\u021b\u0103 necunoscut\u0103.\u201d<\/p>\n<p><b>Cine nu risc\u0103, nu bea \u0219ampanie.<\/b><br \/>\nA\u0219adar \u2014 \u00eencepe cea mai interesant\u0103 parte.<\/p>\n<h2>Ideea general\u0103 \u2014 schematic<\/h2>\n<p>\n<img decoding=\"async\" alt=\"Monitorizarea performan\u021bei interog\u0103rilor PostgreSQL. Partea 1 \u2014 raportare\" src=\"\/wp-content\/uploads\/2019\/04\/d1ae2ddc1d4c43353fe93eebdaa8b81a.jpeg\" style=\"display:block;margin: 0 auto;\" \/><br \/>\n(<i>Ilustra\u021bia este preluat\u0103 dintr-un articol<\/i> \u00ab<noindex><a rel=\"nofollow\" href=\"https:\/\/habr.com\/ru\/post\/444988\/\">Sintez\u0103 ca o metod\u0103 de \u00eembun\u0103t\u0103\u021bire a performan\u021bei PostgreSQL<\/a><\/noindex>\u00bb)<\/p>\n<p>Explica\u021bie:<\/p>\n<ul>\n<li> \u00cen baza \u021bint\u0103 se instaleaz\u0103 extensia standard PostgreSQL \u2014 \u201cpg_stat_statements.\u201d <\/li>\n<li>\u00cen baza de date de monitorizare, cre\u0103m un set de tabele de servicii pentru a stoca istoricul pg_stat_statements \u00een prima etap\u0103 \u0219i pentru a configura metricile \u0219i monitorizarea \u00een continuare.<\/li>\n<li> Pe hostul de monitorizare, cre\u0103m un set de scripturi bash, inclusiv pentru generarea incidentelor \u00een sistemul de tichete. <\/li>\n<\/ul>\n<h2>Tabele de servicii<\/h2>\n<p>\nPentru \u00eenceput, schematic-\u0219i simplificat, o ERD, ce a rezultat \u00een final:<br \/>\n<img decoding=\"async\" alt=\"Monitorizarea performan\u021bei interog\u0103rilor PostgreSQL. Partea 1 \u2014 raportare\" src=\"\/wp-content\/uploads\/2019\/04\/03d29f4d6932d470d9d88651cbf0c715.jpeg\" style=\"display:block;margin: 0 auto;\" \/><br \/>\n<b class=\"spoiler_title\">Descriere scurt\u0103 a tabelelor<\/b><b>endpoint <\/b> \u2014 host, punct de conectare la instan\u021b\u0103<br \/>\n<b>database <\/b> \u2014 parametrii bazei de date<br \/>\n<b>pg_stat_history <\/b> \u2014 tabel istoric pentru stocarea instantaneelor temporale ale vederii pg_stat_statements a bazei de date \u021bint\u0103<br \/>\n<b>metric_glossary <\/b> \u2014 glosar de metrici de performan\u021b\u0103<br \/>\n<b>metric_config <\/b> \u2014 configura\u021bia metricilor individuale<br \/>\n<b>metric <\/b> \u2014 metric\u0103 specific\u0103 pentru interogarea monitorizat\u0103<br \/>\n<b>metric_alert_history <\/b> \u2014 istoric al avertiz\u0103rilor de performan\u021b\u0103<br \/>\n<b>log_query <\/b> \u2014 tabel de serviciu pentru stocarea \u00eenregistr\u0103rilor analizate din fi\u0219ierul de jurnal PostgreSQL desc\u0103rcat de la AWS<br \/>\n<b>baseline <\/b> \u2014 parametrii perioadei temporale utilizate ca baz\u0103 <br \/>\n<b>checkpoint <\/b> \u2014 configura\u021bia metricilor de verificare a st\u0103rii bazei de date<br \/>\n<b>checkpoint_alert_history <\/b> \u2014 istoric al avertiz\u0103rilor metricilor de verificare a st\u0103rii bazei de date<br \/>\n<b>pg_stat_db_queries <\/b> \u2014 tabel de serviciu pentru interog\u0103rile active <br \/>\n<b>activity_log <\/b> \u2014 tabel de serviciu pentru jurnalul de activitate <br \/>\n<b>trap_oid <\/b> \u2014 tabel de serviciu pentru configura\u021bia trap<\/p>\n<p><\/p>\n<h2>Etapa 1 \u2014 colect\u0103m informa\u021bii statistice despre performan\u021b\u0103 \u0219i ob\u021binem rapoarte<\/h2>\n<p>\nPentru stocarea informa\u021biilor statistice, se folose\u0219te tabelul <b>pg_stat_history<\/b><br \/>\n<b class=\"spoiler_title\">Structura tabelului pg_stat_history<\/b><\/p>\n<pre>\n                                          Tabel \"public.pg_stat_history\"\n       Coloan\u0103      |            Tip              |                          Modificatori\n--------------------+-----------------------------+-------------------------------------------\n id                 | integer                     | not null default nextval('pg_stat_history_id_seq'::regclass)\n snapshot_timestamp   | timestamp f\u0103r\u0103 zon\u0103 orar\u0103  |\n database_id        | integer                     |\n dbid               | oid                         |\n userid             | oid                         |\n queryid            | bigint                      |\n query              | text                        |\n calls              | bigint                      |\n total_time         | double precision            |\n min_time           | double precision            |\n max_time           | double precision            |\n mean_time          | double precision            |\n stddev_time        | double precision            |\n rows               | bigint                      |\n shared_blks_hit    | bigint                      |\n shared_blks_read   | bigint                      |\n shared_blks_dirtied| bigint                      |\n shared_blks_written | bigint                      |\n local_blks_hit     | bigint                      |\n local_blks_read    | bigint                      |\n local_blks_dirtied | bigint                      |\n local_blks_written  | bigint                      |\n temp_blks_read     | bigint                      |\n temp_blks_written   | bigint                      |\n blk_read_time      | double precision            |\n blk_write_time     | double precision            |\n baseline_id        | integer                     |\nIndexes:\n    \"pg_stat_history_pkey\" CHEIE PRIMAR\u0102, btree (id)\n    \"database_idx\" btree (database_id)\n    \"queryid_idx\" btree (queryid)\n    \"snapshot_timestamp_idx\" btree (snapshot_timestamp)\nConstr\u00e2ngeri de cheie extern\u0103:\n    \"database_id_fk\" CHEIE EXTERN\u0102 (database_id) REFERA la database(id) ON DELETE CASCADE<\/pre>\n<p>\nDup\u0103 cum se poate observa, tabelul reprezint\u0103 doar date cumulative ale vederii <b>pg_stat_statements <\/b> \u00een baza de date \u021bint\u0103.<\/p>\n<h3>Utilizarea acestui tabel este foarte simpl\u0103<\/h3>\n<p>\n<b>pg_stat_history<\/b> va reprezenta o statistic\u0103 acumulat\u0103 a execu\u021biei interog\u0103rilor pentru fiecare or\u0103. La \u00eenceputul fiec\u0103rei ore, dup\u0103 completarea tabelului, statisticile <b>pg_stat_statements<\/b> sunt resetate prin <b>pg_stat_statements_reset()<\/b>.<br \/>\nNot\u0103: <i>statistica este colectat\u0103 pentru interog\u0103ri cu o durat\u0103 de execu\u021bie mai mare de 1 secund\u0103.<\/i><br \/>\n<b class=\"spoiler_title\">Umplerea tabelului pg_stat_history<\/b><\/p>\n<pre><code class=\"plaintext\">--pg_stat_history.sql\nCREATE OR REPLACE FUNCTION pg_stat_history( ) RETURNS boolean AS $$\nDECLARE\n  endpoint_rec record ;\n  database_rec record ;\n  pg_stat_snapshot record ;\n  current_snapshot_timestamp timestamp without time zone;\nBEGIN\n  current_snapshot_timestamp = date_trunc('minute',now());  \n  \n  FOR endpoint_rec IN SELECT * FROM endpoint \n  LOOP\n    FOR database_rec IN SELECT * FROM database WHERE endpoint_id = endpoint_rec.id \n\t  LOOP\n\t    \n\t\tRAISE NOTICE 'SE \u00ceNCEPE CREAREA NOII IMAGINI';\n\t\t\n\t\t--Conectare la DB-ul \u021bint\u0103\t  \n\t    EXECUTE 'SELECT dblink_connect(''LINK1'',''host='||endpoint_rec.host||' dbname='||database_rec.name||' user=USER password=PASSWORD '')';\n \n        RAISE NOTICE 'gazd\u0103 % \u0219i dbname % ',endpoint_rec.host,database_rec.name;\n\t\tRAISE NOTICE 'Crearea imaginilor pg_stat_statements pentru baza de date %',database_rec.name;\n\t\t\n\t\tSELECT \n\t      *\n\t\tINTO \n\t\t  pg_stat_snapshot\n\t    FROM dblink('LINK1',\n\t      'SELECT \n\t       dbid , SUM(calls),SUM(total_time),SUM(rows) ,SUM(shared_blks_hit) ,SUM(shared_blks_read) ,SUM(shared_blks_dirtied) ,SUM(shared_blks_written) , \n           SUM(local_blks_hit) , SUM(local_blks_read) , SUM(local_blks_dirtied) , SUM(local_blks_written) , SUM(temp_blks_read) , SUM(temp_blks_written) , SUM(blk_read_time) , SUM(blk_write_time)\n\t       FROM pg_stat_statements WHERE dbid=(SELECT oid from pg_database where datname=current_database() ) \n\t\t   GROUP BY dbid\n  \t      '\n\t               )\n\t      AS t\n\t       ( dbid oid , calls bigint , \n  \t         total_time double precision , \n\t         rows bigint , shared_blks_hit bigint , shared_blks_read bigint ,shared_blks_dirtied bigint ,shared_blks_written\t bigint ,\n             local_blks_hit\t bigint ,local_blks_read bigint , local_blks_dirtied bigint ,local_blks_written bigint ,\n             temp_blks_read\t bigint ,temp_blks_written bigint ,\n             blk_read_time double precision , blk_write_time double precision\t  \n\t       );\n\t\t \n\t\tINSERT INTO pg_stat_history\n          ( \n\t\t    snapshot_timestamp  ,database_id  ,\n\t\t\tdbid , calls  ,total_time ,\n            rows ,shared_blks_hit  ,shared_blks_read  ,shared_blks_dirtied  ,shared_blks_written ,local_blks_hit , \t \n            local_blks_read,local_blks_dirtied,local_blks_written,temp_blks_read,temp_blks_written, \t\n            blk_read_time, blk_write_time \n\t\t  )\t\t  \n\t    VALUES\n\t      (\n\t       current_snapshot_timestamp ,\n\t\t   database_rec.id ,\n\t       pg_stat_snapshot.dbid ,pg_stat_snapshot.calls,\n\t       pg_stat_snapshot.total_time,\n\t       pg_stat_snapshot.rows ,pg_stat_snapshot.shared_blks_hit ,pg_stat_snapshot.shared_blks_read ,pg_stat_snapshot.shared_blks_dirtied ,pg_stat_snapshot.shared_blks_written , \n           pg_stat_snapshot.local_blks_hit , pg_stat_snapshot.local_blks_read , pg_stat_snapshot.local_blks_dirtied , pg_stat_snapshot.local_blks_written , \n\t       pg_stat_snapshot.temp_blks_read , pg_stat_snapshot.temp_blks_written , pg_stat_snapshot.blk_read_time , pg_stat_snapshot.blk_write_time \t   \n\t      );\t\t   \n\t\t  \n        RAISE NOTICE 'Crearea imaginii pg_stat_statements pentru interog\u0103rile cu timp_min mai mare de 1000ms';\n\t\n        FOR pg_stat_snapshot IN\n          --Toate interog\u0103rile cu max_time mai mare de 1000 ms\n\t      SELECT \n\t        *\n\t      FROM dblink('LINK1',\n\t        'SELECT \n\t         dbid , userid ,queryid,query,calls,total_time,min_time ,max_time,mean_time, stddev_time ,rows ,shared_blks_hit ,\n\t\t\t shared_blks_read ,shared_blks_dirtied ,shared_blks_written , \n             local_blks_hit , local_blks_read , local_blks_dirtied , \n\t\t\t local_blks_written , temp_blks_read , temp_blks_written , blk_read_time , \n\t\t\t blk_write_time\n\t         FROM pg_stat_statements \n\t\t\t WHERE dbid=(SELECT oid from pg_database where datname=current_database() AND min_time &gt;= 1000 ) \n  \t        '\n\n\t                  )\n\t        AS t\n\t         ( dbid oid , userid oid , queryid bigint ,query text , calls bigint , \n  \t           total_time double precision ,min_time double precision\t ,max_time double precision\t , mean_time double precision\t ,  stddev_time double precision\t , \n\t           rows bigint , shared_blks_hit bigint , shared_blks_read bigint ,shared_blks_dirtied bigint ,shared_blks_written\t bigint ,\n               local_blks_hit\t bigint ,local_blks_read bigint , local_blks_dirtied bigint ,local_blks_written bigint ,\n               temp_blks_read\t bigint ,temp_blks_written bigint ,\n               blk_read_time double precision , blk_write_time double precision\t  \n\t         )\n\t    LOOP\n\t\t  INSERT INTO pg_stat_history\n          ( \n\t\t    snapshot_timestamp  ,database_id  ,\n\t\t\tdbid ,userid  , queryid  , query  , calls  ,total_time ,min_time ,max_time ,mean_time ,stddev_time ,\n            rows ,shared_blks_hit  ,shared_blks_read  ,shared_blks_dirtied  ,shared_blks_written ,local_blks_hit , \t \n            local_blks_read,local_blks_dirtied,local_blks_written,temp_blks_read,temp_blks_written, \t\n            blk_read_time, blk_write_time \n\t\t  )\t\t  \n\t      VALUES\n\t      (\n\t       current_snapshot_timestamp ,\n\t\t   database_rec.id ,\n\t       pg_stat_snapshot.dbid ,pg_stat_snapshot.userid ,pg_stat_snapshot.queryid,pg_stat_snapshot.query,pg_stat_snapshot.calls,\n\t       pg_stat_snapshot.total_time,pg_stat_snapshot.min_time ,pg_stat_snapshot.max_time,pg_stat_snapshot.mean_time, pg_stat_snapshot.stddev_time ,\n\t       pg_stat_snapshot.rows ,pg_stat_snapshot.shared_blks_hit ,pg_stat_snapshot.shared_blks_read ,pg_stat_snapshot.shared_blks_dirtied ,pg_stat_snapshot.shared_blks_written , \n           pg_stat_snapshot.local_blks_hit , pg_stat_snapshot.local_blks_read , pg_stat_snapshot.local_blks_dirtied , pg_stat_snapshot.local_blks_written , \n\t       pg_stat_snapshot.temp_blks_read , pg_stat_snapshot.temp_blks_written , pg_stat_snapshot.blk_read_time , pg_stat_snapshot.blk_write_time \t   \n\t      );\n\t\t  \n        END LOOP;\n\n        PERFORM dblink_disconnect('LINK1');  \n\t\t\t\t\n\t  END LOOP ;--FOR database_rec IN SELECT * FROM database WHERE endpoint_id = endpoint_rec.id \n    \n  END LOOP;\n\nRETURN TRUE;  \nEND\n$$ LANGUAGE plpgsql;<\/code><\/pre>\n<p>Ca urmare, dup\u0103 o anumit\u0103 perioad\u0103 de timp \u00een tabel <b>pg_stat_history<\/b> vom avea un set de instantanee ale con\u021binutului tabelului <b>pg_stat_statements <\/b>bazei de date \u021bint\u0103. <\/p>\n<h2>Raportarea propriu-zis\u0103<\/h2>\n<p>\nFolosind interog\u0103ri simple, se pot ob\u021bine rapoarte destul de utile \u0219i interesante.<\/p>\n<h2>Datele agregate pentru intervalul de timp specificat<\/h2>\n<p><b class=\"spoiler_title\">Interogare<\/b><\/p>\n<pre><code class=\"plaintext\">SELECT \n  database_id , \n  SUM(calls) AS calls ,SUM(total_time)  AS total_time ,\n  SUM(rows) AS rows , SUM(shared_blks_hit)  AS shared_blks_hit,\n  SUM(shared_blks_read) AS shared_blks_read ,\n  SUM(shared_blks_dirtied) AS shared_blks_dirtied,\n  SUM(shared_blks_written) AS shared_blks_written , \n  SUM(local_blks_hit) AS local_blks_hit , \n  SUM(local_blks_read) AS local_blks_read , \n  SUM(local_blks_dirtied) AS local_blks_dirtied , \n  SUM(local_blks_written)  AS local_blks_written,\n  SUM(temp_blks_read) AS temp_blks_read, \n  SUM(temp_blks_written) AS temp_blks_written , \n  SUM(blk_read_time) AS blk_read_time , \n  SUM(blk_write_time) AS blk_write_time\nFROM \n  pg_stat_history\nWHERE \n  queryid IS NULL AND\n  database_id = DATABASE_ID  AND\n  snapshot_timestamp BETWEEN BEGIN_TIMEPOINT AND END_TIMEPOINT\nGROUP BY database_id ;<\/code><\/pre>\n<p><\/p>\n<h4>Timp DB<\/h4>\n<blockquote><p>to_char(interval '1 millisecond' * pg_total_stat_history_rec.total_time, 'HH24:MI:SS.MS')<\/p><\/blockquote>\n<p><\/p>\n<h4>Timp I\/O<\/h4>\n<blockquote><p>to_char(interval '1 millisecond' * ( pg_total_stat_history_rec.blk_read_time + pg_total_stat_history_rec.blk_write_time ), 'HH24:MI:SS.MS')<\/p><\/blockquote>\n<h3>TOP10 SQL dup\u0103 total_time<\/h3>\n<p><b class=\"spoiler_title\">Interogare<\/b><\/p>\n<pre><code class=\"plaintext\">SELECT \n  queryid , \n  SUM(calls) AS calls ,\n  SUM(total_time)  AS total_time  \t\nFROM \n  pg_stat_history\nWHERE \n  queryid IS NOT NULL AND \n  database_id = DATABASE_ID AND\n  snapshot_timestamp BETWEEN BEGIN_TIMEPOINT AND END_TIMEPOINT \nGROUP BY queryid \nORDER BY 3 DESC \nLIMIT 10<\/code><\/pre>\n<pre>-------------------------------------------------------------------------------------\n| TOP10 SQL DUP\u0102 TIMPUL TOTAL DE EXECU\u021aIE\n|   #|    queryid|      calls|    procente apeluri|                total_time (ms) |  procente timp db\n+----+-----------+-----------+-----------+--------------------------------+----------\n|   1|  821760255|          2|     .00001|00:03:23.141(    203141.681 ms.)|      5.42\n|   2| 4152624390|          2|     .00001|00:03:13.929(    193929.215 ms.)|      5.17\n|   3| 1484454471|          4|     .00001|00:02:09.129(    129129.057 ms.)|      3.44\n|   4|  655729273|          1|     .00000|00:02:01.869(    121869.981 ms.)|      3.25\n|   5| 2460318461|          1|     .00000|00:01:33.113(     93113.835 ms.)|      2.48\n|   6| 2194493487|          4|     .00001|00:00:17.377(     17377.868 ms.)|       .46\n|   7| 1053044345|          1|     .00000|00:00:06.156(      6156.352 ms.)|       .16\n|   8| 3644780286|          1|     .00000|00:00:01.063(      1063.830 ms.)|       .03\n<\/pre>\n<h4>TOP10 SQL dup\u0103 timpul total I\/O<\/h4>\n<p><b class=\"spoiler_title\">Interogare<\/b><\/p>\n<pre><code class=\"plaintext\">SELECT \n  queryid , \n  SUM(calls) AS calls ,\n  SUM(blk_read_time + blk_write_time)  AS io_time\nFROM \n  pg_stat_history\nWHERE \n  queryid IS NOT NULL AND \n  database_id = DATABASE_ID  AND\n  snapshot_timestamp BETWEEN BEGIN_TIMEPOINT AND END_TIMEPOINT\nGROUP BY  queryid \nORDER BY 3 DESC \nLIMIT 10<\/code><\/pre>\n<pre>----------------------------------------------------------------------------------------\n| TOP10 SQL DUP\u0102 TIMPUL TOTAL I\/O\n|   #|    queryid|      apeluri|    procent apeluri|                   Timp I\/O (ms)|% timp I\/O db\n+----+-----------+-----------+-----------+--------------------------------+-------------\n|   1| 4152624390|          2|     .00001|00:08:31.616(    511616.592 ms.)|        31.06\n|   2|  821760255|          2|     .00001|00:08:27.099(    507099.036 ms.)|        30.78\n|   3|  655729273|          1|     .00000|00:05:02.209(    302209.137 ms.)|        18.35\n|   4| 2460318461|          1|     .00000|00:04:05.981(    245981.117 ms.)|        14.93\n|   5| 1484454471|          4|     .00001|00:00:39.144(     39144.221 ms.)|         2.38\n|   6| 2194493487|          4|     .00001|00:00:18.182(     18182.816 ms.)|         1.10\n|   7| 1053044345|          1|     .00000|00:00:16.611(     16611.722 ms.)|         1.01\n|   8| 3644780286|          1|     .00000|00:00:00.436(       436.205 ms.)|          .03\n<\/pre>\n<h4>TOP10 SQL dup\u0103 timpul maxim de execu\u021bie<\/h4>\n<p><b class=\"spoiler_title\">Interogare<\/b><\/p>\n<pre><code class=\"plaintext\">SELECT \n  id AS snapshotid , \n  queryid , \n  snapshot_timestamp ,  \n  max_time \nFROM \n  pg_stat_history \nWHERE \n  queryid IS NOT NULL AND \n  database_id = DATABASE_ID  AND\n  snapshot_timestamp BETWEEN BEGIN_TIMEPOINT AND END_TIMEPOINT\nORDER BY 4 DESC \nLIMIT 10<\/code><\/pre>\n<p><\/p>\n<pre>-----------------------------------------------------------------------------------------\n| TOP10 SQL DUP\u0102 TIMPUL MAXIM DE EXECU\u021aIE\n|   #|          snapshot| snapshotID|    queryid|                           max_time (ms)\n+----+------------------+-----------+-----------+----------------------------------------\n|   1|  05.04.2019 01:03|       4169|  655729273|        00:02:01.869(    121869.981 ms.)\n|   2|  04.04.2019 17:00|       4153|  821760255|        00:01:41.570(    101570.841 ms.)\n|   3|  04.04.2019 16:00|       4146|  821760255|        00:01:41.570(    101570.841 ms.)\n|   4|  04.04.2019 16:00|       4144| 4152624390|        00:01:36.964(     96964.607 ms.)\n|   5|  04.04.2019 17:00|       4151| 4152624390|        00:01:36.964(     96964.607 ms.)\n|   6|  05.04.2019 10:00|       4188| 1484454471|        00:01:33.452(     93452.150 ms.)\n|   7|  04.04.2019 17:00|       4150| 2460318461|        00:01:33.113(     93113.835 ms.)\n|   8|  04.04.2019 15:00|       4140| 1484454471|        00:00:11.892(     11892.302 ms.)\n|   9|  04.04.2019 16:00|       4145| 1484454471|        00:00:11.892(     11892.302 ms.)\n|  10|  04.04.2019 17:00|       4152| 1484454471|        00:00:11.892(     11892.302 ms.)\n<\/pre>\n<h4>TOP10 SQL dup\u0103 citirea\/scrierea BUFFER-ULUI \u00ceMP\u0102RT\u0102\u0218IT<\/h4>\n<p><b class=\"spoiler_title\">Interogare<\/b><\/p>\n<pre><code class=\"plaintext\">SELECT \n  id AS snapshotid , \n  queryid ,\n  snapshot_timestamp , \n  shared_blks_read , \n  shared_blks_written \nFROM \n  pg_stat_history\nWHERE \n  queryid IS NOT NULL AND \n  database_id = DATABASE_ID  AND\n  snapshot_timestamp BETWEEN BEGIN_TIMEPOINT AND END_TIMEPOINT AND\n  ( shared_blks_read &gt; 0 OR shared_blks_written &gt; 0 )\nORDER BY 4 DESC  , 5 DESC \nLIMIT 10<\/code><\/pre>\n<pre>--------------------------------------------------------------------------------------------\n| TOP10 SQL \u00ceN FUNCTIE DE CITIRE\/ SCRIERE BUFFER COMPARTIMENTAT\n|   #|          instantaneu| snapshotID|    queryid|   blocuri partajate citite|  blocuri partajate scrise\n+----+------------------+-----------+-----------+---------------------+---------------------\n|   1|  04.04.2019 17:00|       4153|  821760255|               797308|                    0\n|   2|  04.04.2019 16:00|       4146|  821760255|               797308|                    0\n|   3|  05.04.2019 01:03|       4169|  655729273|               797158|                    0\n|   4|  04.04.2019 16:00|       4144| 4152624390|               756514|                    0\n|   5|  04.04.2019 17:00|       4151| 4152624390|               756514|                    0\n|   6|  04.04.2019 17:00|       4150| 2460318461|               734117|                    0\n|   7|  04.04.2019 17:00|       4155| 3644780286|                52973|                    0\n|   8|  05.04.2019 01:03|       4168| 1053044345|                52818|                    0\n|   9|  04.04.2019 15:00|       4141| 2194493487|                52813|                    0\n|  10|  04.04.2019 16:00|       4147| 2194493487|                52813|                    0\n--------------------------------------------------------------------------------------------\n<\/pre>\n<h4>Histograma distribu\u021biei cererilor \u00een func\u021bie de timpul maxim de execu\u021bie<\/h4>\n<p><b class=\"spoiler_title\">Cererile<\/b><\/p>\n<pre><code class=\"plaintext\">SELECT  \n  MIN(max_time) AS hist_min  , \n  MAX(max_time) AS hist_max , \n  (( MAX(max_time) - MIN(min_time) ) \/ hist_columns ) as hist_width\nFROM \n  pg_stat_history \nWHERE \n  queryid IS NOT NULL AND\n  database_id = DATABASE_ID  AND\n  snapshot_timestamp BETWEEN BEGIN_TIMEPOINT AND END_TIMEPOINT ;\n\nSELECT \n  SUM(calls) AS calls\nFROM \n  pg_stat_history \nWHERE \n  queryid IS NOT NULL AND\n  database_id = DATABASE_ID  AND\n  snapshot_timestamp BETWEEN BEGIN_TIMEPOINT AND END_TIMEPOINT AND \n  ( max_time &gt;= hist_current_min AND  max_time &lt; hist_current_max ) ;\n<\/code><\/pre>\n<pre>|-----------------------------------------------------------------------------------------------\n| HISTOGRAM\u0102 MAX_TIME\n| TOTAL CERERI : 33851920\n| TIMP MINIM  : 00:00:01.063\n| TIMP MAXIM  : 00:02:01.869\n---------------------------------------------------------------------------------\n|                      durata minim\u0103|                      durata maxim\u0103|     cereri\n+----------------------------------+----------------------------------+----------\n| 00:00:01.063(      1063.830 ms.) | 00:00:13.144(     13144.445 ms.) | 9\n| 00:00:13.144(     13144.445 ms.) | 00:00:25.225(     25225.060 ms.) | 0\n| 00:00:25.225(     25225.060 ms.) | 00:00:37.305(     37305.675 ms.) | 0\n| 00:00:37.305(     37305.675 ms.) | 00:00:49.386(     49386.290 ms.) | 0\n| 00:00:49.386(     49386.290 ms.) | 00:01:01.466(     61466.906 ms.) | 0\n| 00:01:01.466(     61466.906 ms.) | 00:01:13.547(     73547.521 ms.) | 0\n| 00:01:13.547(     73547.521 ms.) | 00:01:25.628(     85628.136 ms.) | 0\n| 00:01:25.628(     85628.136 ms.) | 00:01:37.708(     97708.751 ms.) | 4\n| 00:01:37.708(     97708.751 ms.) | 00:01:49.789(    109789.366 ms.) | 2\n| 00:01:49.789(    109789.366 ms.) | 00:02:01.869(    121869.981 ms.) | 0\n<\/pre>\n<h4>TOP10 Instantanee \u00een func\u021bie de Cereri pe secund\u0103<\/h4>\n<p><b class=\"spoiler_title\">Cererile<\/b><\/p>\n<pre><code class=\"plaintext\">--pg_qps.sql\n--Calculeaz\u0103 Query Per Second \nCREATE OR REPLACE FUNCTION pg_qps( pg_stat_history_id integer ) RETURNS double precision AS $$\nDECLARE\n pg_stat_history_rec record ;\n prev_pg_stat_history_id integer ;\n prev_pg_stat_history_rec record;\n total_seconds double precision ;\n result double precision;\nBEGIN \n  result = 0 ;\n  \n  SELECT *\n  INTO pg_stat_history_rec\n  FROM \n    pg_stat_history\n  WHERE id = pg_stat_history_id ;\n\n  IF pg_stat_history_rec.snapshot_timestamp IS NULL \n  THEN\n    RAISE EXCEPTION 'EROARE - pg_stat_history nu a fost g\u0103sit pentru id = %',pg_stat_history_id;\n  END IF ;  \n  \n --RAISE NOTICE 'pg_stat_history_id = % , snapshot_timestamp = %', pg_stat_history_id , \n pg_stat_history_rec.snapshot_timestamp ;\n  \n  SELECT \n    MAX(id)   \n  INTO\n    prev_pg_stat_history_id\n  FROM\n    pg_stat_history\n  WHERE \n    database_id = pg_stat_history_rec.database_id AND\n\tqueryid IS NULL AND\n\tid  0 \n  THEN\n    result = pg_stat_history_rec.calls \/ total_seconds ;\n  ELSE\n   result = 0 ; \n  END IF;\n   \n RETURN result ;\nEND\n$$ LANGUAGE plpgsql;\n\n\nSELECT \n  id , \n  snapshot_timestamp ,\n  calls , \t\n  total_time , \n  ( select pg_qps( id )) AS QPS ,\n  blk_read_time ,\n  blk_write_time\nFROM \n  pg_stat_history\nWHERE \n  queryid IS NULL AND \n  database_id = DATABASE_ID  AND\n  snapshot_timestamp BETWEEN BEGIN_TIMEPOINT AND END_TIMEPOINT AND\n  ( select pg_qps( id )) IS NOT NULL \nORDER BY 5 DESC \nLIMIT 10\n<\/code><\/pre>\n<pre>|-----------------------------------------------------------------------------------------------\n| TOP10 Snapshots ordonate dup\u0103 num\u0103rul de QueryPerSeconds\n-----------------------------------------------------------------------------------------------------------------------------------------------\n|    #|          snapshot| snapshotID|      apeluri|                      timp total db|        QPS|                          timp I\/O| I\/O time %\n+-----+------------------+-----------+-----------+----------------------------------+-----------+----------------------------------+-----------\n|    1|  04.04.2019 20:04|       4161|    5758631|  00:06:30.513(    390513.926 ms.)|   1573.396|  00:00:01.470(      1470.110 ms.)|       .376\n|    2|  04.04.2019 17:00|       4149|    3529197|  00:11:48.830(    708830.618 ms.)|    980.332|  00:12:47.834(    767834.052 ms.)|    108.324\n|    3|  04.04.2019 16:00|       4143|    3525360|  00:10:13.492(    613492.351 ms.)|    979.267|  00:08:41.396(    521396.555 ms.)|     84.988\n|    4|  04.04.2019 21:03|       4163|    2781536|  00:03:06.470(    186470.979 ms.)|    785.745|  00:00:00.249(       249.865 ms.)|       .134\n|    5|  04.04.2019 19:03|       4159|    2890362|  00:03:16.784(    196784.755 ms.)|    776.979|  00:00:01.441(      1441.386 ms.)|       .732\n|    6|  04.04.2019 14:00|       4137|    2397326|  00:04:43.033(    283033.854 ms.)|    665.924|  00:00:00.024(        24.505 ms.)|       .009\n|    7|  04.04.2019 15:00|       4139|    2394416|  00:04:51.435(    291435.010 ms.)|    665.116|  00:00:12.025(     12025.895 ms.)|      4.126\n|    8|  04.04.2019 13:00|       4135|    2373043|  00:04:26.791(    266791.988 ms.)|    659.179|  00:00:00.064(        64.261 ms.)|       .024\n|    9|  05.04.2019 01:03|       4167|    4387191|  00:06:51.380(    411380.293 ms.)|    609.332|  00:05:18.847(    318847.407 ms.)|     77.507\n|   10|  04.04.2019 18:01|       4157|    1145596|  00:01:19.217(     79217.372 ms.)|    313.004|  00:00:01.319(      1319.676 ms.)|      1.666\n<\/pre>\n<h4>Istoricul execu\u021biei pe or\u0103 cu QueryPerSeconds \u0219i timp I\/O<\/h4>\n<p><b class=\"spoiler_title\">Interogare<\/b><\/p>\n<pre><code class=\"plaintext\">SELECT \n  id , \n  snapshot_timestamp ,\n  apeluri , \t\n  timp_total , \n  ( select pg_qps( id )) AS QPS ,\n  blk_read_time ,\n  blk_write_time\nFROM \n  pg_stat_history\nWHERE \n  queryid IS NULL AND \n  database_id = DATABASE_ID  AND\n  snapshot_timestamp BETWEEN BEGIN_TIMEPOINT AND END_TIMEPOINT\nORDER BY 2\n<\/code><\/pre>\n<pre>|-----------------------------------------------------------------------------------------------\n| ISTORIC EXECUTIE ORARA CU QueryPerSeconds si Timp I\/O\n-----------------------------------------------------------------------------------------------------------------------------------------------\n| ISTORIC QUERY PER SECUND\u0102\n|    #|          instantaneu| idInstantaneu|      apeluri|                      timp total db|        QPS|                          timp I\/O| % timp I\/O\n+-----+------------------+-----------+-----------+----------------------------------+-----------+----------------------------------+-----------\n|    1|  04.04.2019 11:00|       4131|       3747|  00:00:00.835(       835.374 ms.)|      1.041|  00:00:00.000(          .000 ms.)|       .000\n|    2|  04.04.2019 12:00|       4133|    1002722|  00:01:52.419(    112419.376 ms.)|    278.534|  00:00:00.149(       149.105 ms.)|       .133\n|    3|  04.04.2019 13:00|       4135|    2373043|  00:04:26.791(    266791.988 ms.)|    659.179|  00:00:00.064(        64.261 ms.)|       .024\n|    4|  04.04.2019 14:00|       4137|    2397326|  00:04:43.033(    283033.854 ms.)|    665.924|  00:00:00.024(        24.505 ms.)|       .009\n|    5|  04.04.2019 15:00|       4139|    2394416|  00:04:51.435(    291435.010 ms.)|    665.116|  00:00:12.025(     12025.895 ms.)|      4.126\n|    6|  04.04.2019 16:00|       4143|    3525360|  00:10:13.492(    613492.351 ms.)|    979.267|  00:08:41.396(    521396.555 ms.)|     84.988\n|    7|  04.04.2019 17:00|       4149|    3529197|  00:11:48.830(    708830.618 ms.)|    980.332|  00:12:47.834(    767834.052 ms.)|    108.324\n|    8|  04.04.2019 18:01|       4157|    1145596|  00:01:19.217(     79217.372 ms.)|    313.004|  00:00:01.319(      1319.676 ms.)|      1.666\n|    9|  04.04.2019 19:03|       4159|    2890362|  00:03:16.784(    196784.755 ms.)|    776.979|  00:00:01.441(      1441.386 ms.)|       .732\n|   10|  04.04.2019 20:04|       4161|    5758631|  00:06:30.513(    390513.926 ms.)|   1573.396|  00:00:01.470(      1470.110 ms.)|       .376\n|   11|  04.04.2019 21:03|       4163|    2781536|  00:03:06.470(    186470.979 ms.)|    785.745|  00:00:00.249(       249.865 ms.)|       .134\n|   12|  04.04.2019 23:03|       4165|    1443155|  00:01:34.467(     94467.539 ms.)|    200.438|  00:00:00.015(        15.287 ms.)|       .016\n|   13|  05.04.2019 01:03|       4167|    4387191|  00:06:51.380(    411380.293 ms.)|    609.332|  00:05:18.847(    318847.407 ms.)|     77.507\n|   14|  05.04.2019 02:03|       4171|     189852|  00:00:10.989(     10989.899 ms.)|     52.737|  00:00:00.539(       539.110 ms.)|      4.906\n|   15|  05.04.2019 03:01|       4173|       3627|  00:00:00.103(       103.000 ms.)|      1.042|  00:00:00.004(         4.131 ms.)|      4.010\n|   16|  05.04.2019 04:00|       4175|       3627|  00:00:00.085(        85.235 ms.)|      1.025|  00:00:00.003(         3.811 ms.)|      4.471\n|   17|  05.04.2019 05:00|       4177|       3747|  00:00:00.849(       849.454 ms.)|      1.041|  00:00:00.006(         6.124 ms.)|       .721\n|   18|  05.04.2019 06:00|       4179|       3747|  00:00:00.849(       849.561 ms.)|      1.041|  00:00:00.000(          .051 ms.)|       .006\n|   19|  05.04.2019 07:00|       4181|       3747|  00:00:00.839(       839.416 ms.)|      1.041|  00:00:00.000(          .062 ms.)|       .007\n|   20|  05.04.2019 08:00|       4183|       3747|  00:00:00.846(       846.382 ms.)|      1.041|  00:00:00.000(          .007 ms.)|       .001\n|   21|  05.04.2019 09:00|       4185|       3747|  00:00:00.855(       855.426 ms.)|      1.041|  00:00:00.000(          .065 ms.)|       .008\n|   22|  05.04.2019 10:00|       4187|       3797|  00:01:40.150(    100150.165 ms.)|      1.055|  00:00:21.845(     21845.217 ms.)|     21.812\n<\/pre>\n<h4>Textul tuturor interog\u0103rilor SQL-select<\/h4>\n<p><b class=\"spoiler_title\">Interogare<\/b><\/p>\n<pre><code class=\"plaintext\">SELECT \n  queryid , \n  query \nFROM \n  pg_stat_history\nWHERE \n  queryid IS NOT NULL AND \n  database_id = DATABASE_ID  AND\n  snapshot_timestamp BETWEEN BEGIN_TIMEPOINT AND END_TIMEPOINT\nGROUP BY queryid , query\n<\/code><\/pre>\n<h2>Rezultatul<\/h2>\n<p>\nA\u0219a cum se poate observa, prin metode destul de simple, se poate ob\u021bine o cantitate semnificativ\u0103 de informa\u021bii utile despre \u00eenc\u0103rcarea \u0219i starea bazei de date. <\/p>\n<p><b>Observa\u021bie:<\/b>Dac\u0103 \u00een interog\u0103ri se \u00eenregistreaz\u0103 queryid, atunci vom ob\u021bine istoricul pentru o interogare separat\u0103 (pentru a economisi spa\u021biu, rapoartele pentru interog\u0103rile separate sunt omise).<\/p>\n<p>A\u0219adar, datele statistice despre performan\u021ba interog\u0103rilor sunt disponibile \u0219i sunt colectate.<br \/>\nPrima etap\u0103 \u201ecolectarea datelor statistice\u201d s-a \u00eencheiat.<\/p>\n<p>Putem trece la a doua etap\u0103 - \u201eoptimizarea metodelor de performan\u021b\u0103\u201d.<br \/>\n<img decoding=\"async\" alt=\"Monitorizarea performan\u021bei interog\u0103rilor PostgreSQL. Partea 1 \u2014 raportare\" src=\"\/wp-content\/uploads\/2019\/04\/a893e49280d4cb425e4667a5c51d2397.jpeg\" style=\"display:block;margin: 0 auto;\" \/><br \/>\n<br \/>\n<b>Dar aceasta este o poveste cu totul diferit\u0103.<\/b><\/p>\n<p><i>Continuarea urmeaz\u0103...<\/i><br \/>\n<br \/>Sursa: <a content=\"nofollow\" rel=\"nofollow\" href=\"https:\/\/habr.com\/ru\/company\/icl_services\/blog\/446734\/\">habr.com<\/a><\/p>","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"excerpt":{"rendered":"<p>\u0418\u043d\u0436\u0435\u043d\u0435\u0440 \u2014 \u0432 \u043f\u0435\u0440\u0435\u0432\u043e\u0434\u0435 \u0441 \u043b\u0430\u0442\u044b\u043d\u0438 \u2014 \u0432\u0434\u043e\u0445\u043d\u043e\u0432\u0435\u043d\u043d\u044b\u0439. \u0418\u043d\u0436\u0435\u043d\u0435\u0440 \u043c\u043e\u0436\u0435\u0442 \u0432\u0441\u0451. (\u0441) \u0420.\u0414\u0438\u0437\u0435\u043b\u044c. \u042d\u043f\u0438\u0433\u0440\u0430\u0444\u044b. \u0418\u043b\u0438 \u0438\u0441\u0442\u043e\u0440\u0438\u044f \u043e \u0442\u043e\u043c, \u0437\u0430\u0447\u0435\u043c \u0430\u0434\u043c\u0438\u043d\u0438\u0441\u0442\u0440\u0430\u0442\u043e\u0440\u0443 \u0431\u0430\u0437 \u0434\u0430\u043d\u043d\u044b\u0445 \u0432\u0441\u043f\u043e\u043c\u0438\u043d\u0430\u0442\u044c \u0441\u0432\u043e\u0435 \u043f\u0440\u043e\u0433\u0440\u0430\u043c\u043c\u0438\u0441\u0442\u0441\u043a\u043e\u0435 \u043f\u0440\u043e\u0448\u043b\u043e\u0435. \u041f\u0440\u0435\u0434\u0438\u0441\u043b\u043e\u0432\u0438\u0435 \u0412\u0441\u0435 \u0438\u043c\u0435\u043d\u0430 \u0438\u0437\u043c\u0435\u043d\u0435\u043d\u044b. \u0421\u043e\u0432\u043f\u0430\u0434\u0435\u043d\u0438\u044f \u0441\u043b\u0443\u0447\u0430\u0439\u043d\u044b. \u041c\u0430\u0442\u0435\u0440\u0438\u0430\u043b \u043f\u0440\u0435\u0434\u0441\u0442\u0430\u0432\u043b\u044f\u0435\u0442 \u0441\u043e\u0431\u043e\u0439 \u0438\u0441\u043a\u043b\u044e\u0447\u0438\u0442\u0435\u043b\u044c\u043d\u043e \u043b\u0438\u0447\u043d\u043e\u0435 \u043c\u043d\u0435\u043d\u0438\u0435 \u0430\u0432\u0442\u043e\u0440\u0430. Disclaimer of warranties: \u0432 \u043f\u043b\u0430\u043d\u0438\u0440\u0443\u0435\u043c\u043e\u043c \u0446\u0438\u043a\u043b\u0435 \u0441\u0442\u0430\u0442\u0435\u0439 \u043d\u0435 \u0431\u0443\u0434\u0435\u0442 \u043f\u043e\u0434\u0440\u043e\u0431\u043d\u043e\u0433\u043e \u0438 \u0442\u043e\u0447\u043d\u043e\u0433\u043e \u043e\u043f\u0438\u0441\u0430\u043d\u0438\u044f \u0438\u0441\u043f\u043e\u043b\u044c\u0437\u0443\u0435\u043c\u044b\u0445 \u0442\u0430\u0431\u043b\u0438\u0446 \u0438 [&hellip;]<\/p>\n","protected":false,"gt_translate_keys":[{"key":"rendered","format":"html"}]},"author":1,"featured_media":24168,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[688],"tags":[],"class_list":["post-32353","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.2.1 - aioseo.com -->\n\t<meta name=\"description\" content=\"\u0418\u043d\u0436\u0435\u043d\u0435\u0440 \u2014 \u0432 \u043f\u0435\u0440\u0435\u0432\u043e\u0434\u0435 \u0441 \u043b\u0430\u0442\u044b\u043d\u0438 \u2014 \u0432\u0434\u043e\u0445\u043d\u043e\u0432\u0435\u043d\u043d\u044b\u0439. \u0418\u043d\u0436\u0435\u043d\u0435\u0440 \u043c\u043e\u0436\u0435\u0442 \u0432\u0441\u0451. (\u0441) \u0420.\u0414\u0438\u0437\u0435\u043b\u044c. \u042d\u043f\u0438\u0433\u0440\u0430\u0444\u044b.\" \/>\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\/ro\/blog\/administrirovanie\/monitoring-proizvoditelnosti-zaprosov-postgresql-chast-1-reporting\" \/>\n\t<meta name=\"generator\" content=\"All in One SEO (AIOSEO) 5.0.2.1\" \/>\n\t\t<meta property=\"og:locale\" content=\"ro_RO\" \/>\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\u041c\u043e\u043d\u0438\u0442\u043e\u0440\u0438\u043d\u0433 \u043f\u0440\u043e\u0438\u0437\u0432\u043e\u0434\u0438\u0442\u0435\u043b\u044c\u043d\u043e\u0441\u0442\u0438 \u0437\u0430\u043f\u0440\u043e\u0441\u043e\u0432 PostgreSQL. \u0427\u0430\u0441\u0442\u044c 1 \u2014 \u0440\u0435\u043f\u043e\u0440\u0442\u0438\u043d\u0433 | ProHoster\" \/>\n\t\t<meta property=\"og:description\" content=\"\u0418\u043d\u0436\u0435\u043d\u0435\u0440 \u2014 \u0432 \u043f\u0435\u0440\u0435\u0432\u043e\u0434\u0435 \u0441 \u043b\u0430\u0442\u044b\u043d\u0438 \u2014 \u0432\u0434\u043e\u0445\u043d\u043e\u0432\u0435\u043d\u043d\u044b\u0439. \u0418\u043d\u0436\u0435\u043d\u0435\u0440 \u043c\u043e\u0436\u0435\u0442 \u0432\u0441\u0451. (\u0441) \u0420.\u0414\u0438\u0437\u0435\u043b\u044c. \u042d\u043f\u0438\u0433\u0440\u0430\u0444\u044b.\" \/>\n\t\t<meta property=\"og:url\" content=\"https:\/\/prohoster.info\/ro\/blog\/administrirovanie\/monitoring-proizvoditelnosti-zaprosov-postgresql-chast-1-reporting\" \/>\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:46:32+00:00\" \/>\n\t\t<meta property=\"article:modified_time\" content=\"2019-10-31T18:46:32+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\udd47Monitorizarea performan\u021bei interog\u0103rilor PostgreSQL. Partea 1 - raportare | ProHoster","description":"Inginer - tradus din latin\u0103 - \u00eenseamn\u0103 inspirat. Un inginer poate face orice. (c) R.Dizel. Epigrafe.","canonical_url":"https:\/\/prohoster.info\/ro\/blog\/administrirovanie\/monitoring-proizvoditelnosti-zaprosov-postgresql-chast-1-reporting","robots":"max-image-preview:large","keywords":"","webmasterTools":{"miscellaneous":""},"schema":null,"og:locale":"ro_RO","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\u041c\u043e\u043d\u0438\u0442\u043e\u0440\u0438\u043d\u0433 \u043f\u0440\u043e\u0438\u0437\u0432\u043e\u0434\u0438\u0442\u0435\u043b\u044c\u043d\u043e\u0441\u0442\u0438 \u0437\u0430\u043f\u0440\u043e\u0441\u043e\u0432 PostgreSQL. \u0427\u0430\u0441\u0442\u044c 1 \u2014 \u0440\u0435\u043f\u043e\u0440\u0442\u0438\u043d\u0433 | ProHoster","og:description":"\u0418\u043d\u0436\u0435\u043d\u0435\u0440 \u2014 \u0432 \u043f\u0435\u0440\u0435\u0432\u043e\u0434\u0435 \u0441 \u043b\u0430\u0442\u044b\u043d\u0438 \u2014 \u0432\u0434\u043e\u0445\u043d\u043e\u0432\u0435\u043d\u043d\u044b\u0439. \u0418\u043d\u0436\u0435\u043d\u0435\u0440 \u043c\u043e\u0436\u0435\u0442 \u0432\u0441\u0451. (\u0441) \u0420.\u0414\u0438\u0437\u0435\u043b\u044c. \u042d\u043f\u0438\u0433\u0440\u0430\u0444\u044b.","og:url":"https:\/\/prohoster.info\/ro\/blog\/administrirovanie\/monitoring-proizvoditelnosti-zaprosov-postgresql-chast-1-reporting","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:46:32+00:00","article:modified_time":"2019-10-31T18:46:32+00:00","article:publisher":"https:\/\/www.facebook.com\/prohoster","article:author":"https:\/\/www.facebook.com\/prohoster"},"aioseo_meta_data":{"post_id":"32353","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 10:28:19","breadcrumb_settings":null,"limit_modified_date":false,"reviewed_by":null,"ai":null,"created":"2021-02-28 19:13:42","updated":"2026-01-21 10:28:19","focus_keyword":null,"additional_keywords":null,"truseo_locale":null},"gt_translate_keys":[{"key":"link","format":"url"}],"_links":{"self":[{"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/posts\/32353","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/comments?post=32353"}],"version-history":[{"count":0,"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/posts\/32353\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/media\/24168"}],"wp:attachment":[{"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/media?parent=32353"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/categories?post=32353"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/prohoster.info\/ro\/wp-json\/wp\/v2\/tags?post=32353"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}