{
  "id": 7642898,
  "title": "SetrixDB: set engine in Go — exact intersection over IDs (and where it loses)",
  "url": "https://urgent.news/2026/09/15/setrixdb-motor-de-conjuntos-em-go-intersecao-exata-sobre-ids-e-onde",
  "topic": "tech",
  "section": "Tech",
  "published": "2026-09-15T21:40:00.000Z",
  "source": {
    "name": "Dev.to",
    "slug": "dev-to",
    "url": "https://dev.to/tgosoul/setrixdb-motor-de-conjuntos-em-go-intersecao-exata-sobre-ids-e-onde-ele-perde-dic"
  },
  "original_language": "pt",
  "account": "A new database primitive, SetrixDB, has been developed to efficiently handle set operations on large lists of unique identifiers (uint64). It uses a Minimal Perfect Hash Function to map terms to IDs, achieving 0 collisions on a 50 million key base. The database allows for fast exact intersection and membership tests, outperforming generic structures like maps and joins. Benchmarks show it uses 2.2x less memory than a map while achieving similar speed, and is much faster than other methods for intersection operations. However, it may not be suitable for very large universes that don't fit in RAM, or for range queries and frequent updates. Tests on real datasets, including Online Retail II, Wikipedia titles, and MovieLens 25M, demonstrate its effectiveness.",
  "summary": "“Dado um ID, ele está nesta lista?” e “quais IDs aparecem nas duas listas ao mesmo tempo?” Parecem exercícios de livro-texto. Mas quando essas listas têm milhões ou bilhões de elementos e precisam responder em microssegundos — num filtro facetado, numa checagem de permissão, num pré-filtro de candidatos para um LLM — a resposta deixa de ser trivial. Este artigo é sobre uma primitiva específica:…",
  "key_points": [],
  "editors_take": null,
  "illustration": null,
  "coverage": {
    "outlets": 1,
    "also_reported_by": []
  },
  "ai_generated": true,
  "disclaimer": "Summaries, key points and the editor’s take are written by software from other outlets’ reporting and may contain errors — always check the linked original."
}