PostgreSQL , topn , topn.number_of_counters , count(*) group by order by count(*) desc limit x
count(*) group by order by count(*) desc limit x 用来统计 topn。
topn是运营的重要指标,比如排行前10的活跃用户。
如果数据量非常庞大,统计会比较耗时,citus提供了一个topn插件,与HLL类似,核心是使用少量空间存储聚合过程中的数据,同时返回一个固定大小(参数设置topn.number_of_counters)的JSONB,可用于下次聚合。(注意,PostgreSQL 11支持更强大的hashagg parallel后,聚合大数据量已不是问题)
topn插件聚合过程如图。
对topn的结果使用topn_union_agg可以再次聚合。
postgres=# \df topn*
List of functions
Schema | Name | Result data type | Argument data types | Type
--------+------------------+-------------------+---------------------+--------
public | topn | SETOF topn_record | jsonb, integer | normal
public | topn_add | jsonb | jsonb, text | normal
public | topn_add_agg | jsonb | text | agg
public | topn_add_trans | internal | internal, text | normal
public | topn_pack | jsonb | internal | normal
public | topn_union | jsonb | jsonb, jsonb | normal
public | topn_union_agg | jsonb | jsonb | agg
public | topn_union_trans | internal | internal, jsonb | normal
(8 rows)
-- starting from nothing, record that we saw an "a"
select topn_add('{}', 'a');
-- => {"a": 1}
-- record the sighting of another "a"
select topn_add(topn_add('{}', 'a'), 'a');
-- => {"a": 2}
-- for normal_rand
create extension tablefunc;
-- count values from a normal distribution
SELECT topn_add_agg(floor(abs(i))::text)
FROM normal_rand(1000, 5, 0.7) i;
-- => {"2": 1, "3": 74, "4": 420, "5": 425, "6": 77, "7": 3}
从topn jsonb中直接获取topn的值
postgres=# select (topn(topn_union_agg(agg_prodid),5)).* from reviews_by_prodid;
item | frequency
--------+-----------
509594 | 66
497599 | 59
505217 | 58
461257 | 58
403111 | 57
(5 rows)
1、所有节点(包括coordinator, worker)安装topn软件
cd ~
. /var/lib/pgsql/.bash_profile
git clone https://github.com/citusdata/postgresql-topn
cd postgresql-topn
USE_PGXS=1 make
USE_PGXS=1 make install
2、安装插件(coordinator)
postgres=# create extension topn;
CREATE EXTENSION
3、安装插件(worker),在coordinator中调用run_command_on_workers,在所有worker中执行。
postgres=# select run_command_on_workers('create extension topn;');
run_command_on_workers
--------------------------------------------
(xxx.xxx.xxx.224,1921,t,"CREATE EXTENSION")
(xxx.xxx.xxx.225,1921,t,"CREATE EXTENSION")
(xxx.xxx.xxx.226,1921,t,"CREATE EXTENSION")
(xxx.xxx.xxx.227,1921,t,"CREATE EXTENSION")
(xxx.xxx.xxx.229,1921,t,"CREATE EXTENSION")
(xxx.xxx.xxx.230,1921,t,"CREATE EXTENSION")
(xxx.xxx.xxx.231,1921,t,"CREATE EXTENSION")
(xxx.xxx.xxx.232,1921,t,"CREATE EXTENSION")
(8 rows)
1、测试表
create table tbl(id serial8,gid int, prodid int, c1 int, c2 int);
postgres=# \d tbl
Table "public.tbl"
Column | Type | Collation | Nullable | Default
--------+---------+-----------+----------+---------------------------------
id | bigint | | not null | nextval('tbl_id_seq'::regclass)
gid | integer | | |
prodid | integer | | |
c1 | integer | | |
c2 | integer | | |
postgres=# alter sequence tbl_id_seq cache 10000;
ALTER SEQUENCE
2、写入2亿测试数据
vi test.sql
\set gid random_gaussian(1,1000,2.5)
\set prodid random_gaussian(1,1000000,2.5)
\set c1 random(1,3000)
\set c2 random(1,100000000)
insert into tbl(gid,prodid,c1,c2) values (:gid,:prodid,:c1,:c2);
pgbench -M prepared -n -r -P 1 -f ./test.sql -c 64 -j 64 -T 1200
postgres=# select count(*) from tbl;
count
-----------
216524755
(1 row)
Time: 421.860 ms
3、几组真实的TOPN数据
postgres=# select gid,count(*) from tbl group by gid order by count(*) desc limit 10;
gid | count
-----+--------
494 | 438102
499 | 438017
514 | 437929
506 | 437852
511 | 437546
509 | 437469
495 | 437458
490 | 437320
496 | 437257
500 | 437239
(10 rows)
postgres=# select c1,count(*) from tbl group by c1 order by count(*) desc limit 10;
c1 | count
------+-------
1370 | 73175
168 | 73121
1016 | 73114
1816 | 73045
1463 | 73020
585 | 72986
1529 | 72974
1857 | 72944
2580 | 72930
298 | 72917
(10 rows)
postgres=# select prodid,count(*) from tbl group by prodid order by count(*) desc limit 10;
prodid | count
--------+-------
516916 | 534
481914 | 534
520680 | 527
530544 | 526
449685 | 523
493560 | 523
520464 | 523
502098 | 522
495170 | 522
501695 | 522
(10 rows)
4、gid维度估值topn (gid唯一值个数小于等于参数topn.number_of_counters)
结果精准
CREATE TABLE reviews_by_gid
(
agg jsonb
);
SELECT create_reference_table('reviews_by_gid');
INSERT INTO reviews_by_gid
SELECT topn_add_agg(gid::text)
FROM tbl;
postgres=# select (topn(agg,5)).* from reviews_by_gid;
item | frequency
------+-----------
494 | 438102
499 | 438017
514 | 437929
506 | 437852
511 | 437546
(5 rows)
5、prodid维度估值topn (prodid唯一值个数远远大于等于参数topn.number_of_counters)
结果偏差非常大。
CREATE TABLE reviews_by_prodid
(
agg_prodid jsonb
);
SELECT create_reference_table('reviews_by_prodid');
INSERT INTO reviews_by_prodid
SELECT topn_add_agg(prodid::text)
FROM tbl;
postgres=# select (topn(agg_prodid,5)).* from reviews_by_prodid;
item | frequency
--------+-----------
470098 | 36
531880 | 35
451724 | 34
420093 | 34
522676 | 33
(5 rows)
6、c1维度估值topn (c1唯一值个数略大于等于参数topn.number_of_counters)
结果不精准。
CREATE TABLE reviews_by_c1
(
aggc1 jsonb
);
SELECT create_reference_table('reviews_by_c1');
INSERT INTO reviews_by_c1
SELECT topn_add_agg(c1::text)
FROM tbl;
postgres=# select (topn(aggc1,5)).* from reviews_by_c1;
item | frequency
------+-----------
2580 | 37073
1016 | 36162
1983 | 35311
1752 | 35285
2354 | 34740
(5 rows)
造成以上精准度偏差的原因:
当topn hashtable已满,有新值写入时,会导致清除hashtable中一半的元素(item, count)pairs(指按count排序后,较小的一半)。
The TopN approximation algorithm keeps a predefined number of frequent items and counters. If a new item already exists among these frequent items, the algorithm increases the item's frequency counter. Else, the algorithm inserts the new item into the counter list when there is enough space. If there isn't enough space, the algorithm evicts the bottom half of all counters. Since we typically keep counters for many more items (e.g. 100*N) than we are actually interested in, the actual top N items are unlikely to get evicted and will typically have accurate counts.
You can increase the algoritm's accuracy by increasing the predefined number of frequent items/counters.
对应代码
/*
* PruneHashTable removes some items from the HashTable to decrease its size. It finds
* minimum and maximum frequencies first and removes the items which have lower frequency
* than the average of them.
*/
static void
PruneHashTable(HTAB *hashTable, int itemLimit, int numberOfRemainingElements)
{
Size topnArraySize = 0;
int topnIndex = 0;
FrequentTopnItem *sortedTopnArray = NULL;
bool itemAlreadyHashed = false;
HASH_SEQ_STATUS status;
FrequentTopnItem *currentTask = NULL;
FrequentTopnItem *frequentTopnItem = NULL;
int index = 0;
int hashTableSize = hash_get_num_entries(hashTable);
if (hashTableSize <= itemLimit)
{
return;
}
/* create an array to copy top-n items and sort them later */
topnArraySize = sizeof(FrequentTopnItem) * hashTableSize;
sortedTopnArray = (FrequentTopnItem *) palloc0(topnArraySize);
hash_seq_init(&status, hashTable);
while ((currentTask = (FrequentTopnItem *) hash_seq_search(&status)) != NULL)
{
frequentTopnItem = palloc0(sizeof(FrequentTopnItem));
memcpy(frequentTopnItem->key, currentTask->key,
sizeof(frequentTopnItem->key));
frequentTopnItem->frequency = currentTask->frequency;
sortedTopnArray[topnIndex] = *frequentTopnItem;
topnIndex++;
}
qsort(sortedTopnArray, hashTableSize, sizeof(FrequentTopnItem),
compareFrequentTopnItem);
for (index = numberOfRemainingElements; index < hashTableSize; index++)
{
FrequentTopnItem *topnItem = &(sortedTopnArray[index]);
hash_search(hashTable, (void *) topnItem->key, HASH_REMOVE,
&itemAlreadyHashed);
}
}
postgres=# load 'topn';
LOAD
postgres=# show topn.number_of_counters ;
topn.number_of_counters
-------------------------
1000
(1 row)
set topn.number_of_counters =20000;
需要在所有节点(coordinator+worker)操作,例如。
postgresql.conf
shared_preload_libraries='citus,topn,pg_stat_statements'
topn.number_of_counters=10000
1、建议阶段性聚合,并且保证每个阶段被聚合的字段,唯一值个数小于topn.number_of_counters,否则会失真。
例如每小时有1万个活跃用户,那么topn.number_of_counters,建议设置为1万或更大,并且按小时聚合。每个小时存一个聚合后的jsonb结果。需要统计天的结果时,再将全天的jsonb进行聚合。
2、元素个数大于topn.number_of_counters时,会导致topn结果失真。
https://github.com/citusdata/postgresql-topn
https://docs.citusdata.com/en/v7.5/develop/reference_sql.html
《PostgreSQL count-min sketch top-n 概率计算插件 cms_topn (结合窗口实现同比、环比、滑窗分析等) - 流计算核心功能之一》
来源:https://yq.aliyun.com/articles/698143
需求:用presto跑sql的时候,发现group by去重之后直接count不是总条数,而是按照group by key的key分组之后的条数,万万没想到啊。因为语句执行顺序是group by 再count,所以按理说不应该,但是实际上这是一个需要注意的坑,最好在外面包一层。曾一度怀疑是presto和hive语法的差异,但实际上sql就有这么一个坑。 下面用三个sql例子说明 例子1: 例子2:...
转自https://www.cnblogs.com/linJie1930906722/p/6036053.html 分区函数Partition By的与row_number()的用法以及与排序rank()的用法详解(获取分组(分区)中前几条记录) partition by关键字是分析性函数的一部分,它和聚合函数不同的地方在于它能返回一个分组中的多条记录,而聚合函数一般只有一条反映统计值的记录,pa...
一.创建表与初始化数据 create table POLICY_PRODUCT_SIG ( sig_policy_no VARCHAR2(20) not null,--个单号 product_code VARCHAR2(10) not null,--险种代码 is_primary_plan VAR...
写在前面 上篇文章介绍mysql的增删改查操作,这篇将介绍group和order by操作。 系列文章 mysql之创建数据库,创建数据表 mysql之select,insert,delete,update 一个例子 group by 顾名思义,是按照哪个字段分组,比如按照名字分组,则是所有名字相同的分为一组。在一些计数及求和中用到最多。 还以上篇文章的学生信息表为例。 1.求出每个年龄阶段的学生...
1、项目中需要查询每个用户最后一次登录时间 select * from m_user_login_log a grou by a.user_id order by a.login_time desc; 选择出来不是想要的记录,因为mysql执行顺序如下: 会先执行group by,再执行order by 2、想要得到正确的结果: SELECT b.* FROM( SELEC...
十、麦收与秋收 田家少闲月,五月人倍忙。夜来南风起,小麦覆陇黄。 足蒸暑土气,背灼炎天光,力尽不知热,但惜夏日长。 三月分蘖,四月灌浆,五月麦稍黄。 五月当午前后,麦收季节,牛欢马叫,农人纷忙,学校就放十多天的麦假,并有拾麦之勤工俭学任务。 而四里八乡老师,家里也都是有地的,也要回去收麦子。 于是,这假期也令我们渴望,相比上学日子,虽然干活,总是多些自由。 爷一早就开始...
FFmpeg下载 1、下载ffmpeg安装包 2、找到适合 你电脑的版本,win 3、点击下载ZIP格式的, 4、下载之后解压,bin里面可以看到三个安装文件 5、配置环境, 点击“系统属性->高级系统设置->环境变量->用户变量”,选择“Path”条目,点击“编辑->新建”,把第一步的bin文件夹路径...
报错说明: cmake时勾选了BOOST_STATIC colmap_exe项目在编译时报错:xxxx已定义 自测解决办法: 将libboost_program_XXXXXXXXXXX修改为boost_program_XXXXXXXXXXX,如下图 备注: cmake-gui 中不勾选BOOST_STATIC,可直接编译成功。...
python中的数值类型 (https://www.cnblogs.com/russellluo/p/3292985.html) 链接里面有 转载下,方便后面查找 python中的type dtype astype 的用法 1.type 获取数据类型 2.dtype 数组元素的类型 3.astype 修改数据类型 也就是说对于numpy创建的数组,是用dtype查看数据类型(也就是相当于dtype...
The following polymorphic methods compile: However, if I change the integer 2 to the double 2.0 the compiler complains about not finding an implicit value I have tried to understand some of the other ...
I am considering Erlang as a potential for my upcoming project. I need a "Highly scalable, highly reliable" (duh, what project doesn't?) web server to accept HTTP requests, but not really se...
I've been trying to implement the following adapter to connect StreamInsight with BizTalk: http://seroter.wordpress.com/2010/07/09/sending-streaminsight-events-to-biztalk-through-new-web-soaprest-adap...
I have to reproduce the following circular effect on the exoplayer. I added two views, exo_rew and exo_ffwd. Which automatically do go back or forward by standard setting. This is the code I've writte...
The problem we would like to understand and work around is delivering push notifications to players that are in different timezones and regions, all at the same local time. It would appear the recipie...