bloom

A indexing method using a probabilistic data structure is provided, which allows for fast membership testing and supports queries with multiple predicates by storing a bit vector representing the presence or absence of indexed values.

Information Analysis

Extensibility Types: Functions, Index Access Methods
System Components: None

Duplicate Code Analysis

Total Lines of Code: ? 1737
Lines of Duplicate Code: ? 60
Percentage of Codebase: ? 3.45%

Versioning Analysis

Total Lines of Code: ? 1737
Lines of Encapsulated Versioning Code: ? 0
Percentage of Encapsulated Versioning Code in Codebase: ? 0%

Compatibility Analysis

Number of Failed Extensions: 10
Failure Rate: 7.9%

Failed Extensions

earthdistance

pg_query_rewrite

pg_queryid

pg_stat_kcache

pg_stat_monitor

pg_tle

pgextwlist

pgsentinel

tds_fdw

timescaledb