我需要建议,因为我不够好。
我在 PostgreSQL 中有一个在 AWS(亚马逊网络服务)上运行的数据库。我有一个表“user_location”,其中存储了每个用户的位置,现在有超过 300 万行。
我有一个经常运行以下查询的脚本,以查看附近是否有两个用户:
SELECT
UL.id AS id,
UL.user_id AS user_id,
ST_X(UL.location::geometry) AS lat,
ST_Y(UL.location::geometry) AS lng,
UL.datetime AS datetime
FROM
public.user_location AS UL
WHERE
UL.user_id <> 1234567890 AND
'1890-10-31 03:00:00 +00:00' - UL.datetime <= interval '1' minute AND
'1890-10-31 03:00:00 +00:00' >= UL.datetime AND
ST_DWithin(UL.location, ST_GeogFromText('POINT(54 -1)'), 5000)
ORDER BY
UL.datetime DESC;
问题似乎是半径,查询的执行时间通过增加半径呈指数增长,因为它需要检查更多行。
我需要一个可扩展的解决方案,通过增加给定位置周围的半径,执行时间几乎相同。我需要在日期时间之前和查询中的半径之后使用“水平切割”数据,我该怎么办?
我还有 EXPLAIN ANALYZE 的输出,即:
"Sort (cost=389.72..389.73 rows=3 width=52) (actual time=136848.985..136848.985 rows=0 loops=1)"
" Sort Key: datetime"
" Sort Method: quicksort Memory: 25kB"
" -> Bitmap Heap Scan on user_location ul (cost=11.00..389.70 rows=3 width=52) (actual time=136848.976..136848.976 rows=0 loops=1)"
" Recheck Cond: (location && '0101000020E6100000C182458F29494B4095E0C3DB39E3F3BF'::geography)"
" Filter: ((user_id <> 1234567890) AND ('1890-10-31 03:00:00 +00:00'::timestamp with time zone >= datetime) AND (('1890-10-31 03:00:00 +00:00'::timestamp with time zone - datetime) <= '00:01:00'::interval minute) AND ('0101000020E6100000C182458F29494B4095E0C3DB39E3F3BF'::geography && _st_expand(location, 5000::double precision)) AND _st_dwithin(location, '0101000020E6100000C182458F29494B4095E0C3DB39E3F3BF'::geography, 5000::double precision, true))"
" -> Bitmap Index Scan on users_locations_gix (cost=0.00..11.00 rows=91 width=0) (actual time=4463.249..4463.249 rows=165622 loops=1)"
" Index Cond: (location && '0101000020E6100000C182458F29494B4095E0C3DB39E3F3BF'::geography)"
"Total runtime: 136849.591 ms"
提前致谢!干杯