TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Bloom Filter Indexes in PostgreSQL

32 pointsby kaashmoneeabout 1 year ago

3 comments

whinvikabout 1 year ago
Slightly off-topic but what tools do folks use for optimizing/analyzing/debugging indexes on Postgres.
评论 #40133498 未加载
评论 #40133434 未加载
ezekgabout 1 year ago
&gt; A sequential scan over this large table takes a long time:<p>&gt; ...<p>&gt; Execution Time: 16.988 ms<p>I feel like I have a different definition of a &quot;long time&quot;, and apparently all my queries suck lol. Also, of course the btree index on (i1, i2, i3, i4, i5, i6) won&#x27;t be used when querying on only i1 and i5. Felt a bit weird to read that as an &quot;unexpected&quot; outcome in the pg docs, but I guess the writer is just trying to make a contrast with the bloom index on the same column set.
esafakabout 1 year ago
See also <a href="https:&#x2F;&#x2F;github.com&#x2F;apache&#x2F;datasketches-postgresql">https:&#x2F;&#x2F;github.com&#x2F;apache&#x2F;datasketches-postgresql</a>