MarginaliaSearch/code
Viktor Lofgren ad8c97f342 (search-service) Begin replacement of the crawl queue mechanism with node_affinity flagging
Previously a special db table was used to hold domains slated for crawling, but this is deprecated, and instead now each domain has a node_affinity flag that decides its indexing state, where a value of -1 indicates it shouldn't be crawled, a value of 0 means it's slated for crawling by the next index partition to be crawled, and a positive value means it's assigned to an index partition.

The change set also adds a test case validating the modified behavior.
2025-01-08 13:25:56 +01:00
..
common (search-service) Add indexing indicator to sibling domains listing 2025-01-08 12:58:34 +01:00
execution (live-crawler) Improve LiveCrawlActor resilience to FeedService outages 2024-12-23 23:33:54 +01:00
features-search (WIP) Initial semi-working transformation to new tailwind UI 2024-12-05 14:00:17 +01:00
functions (search-service) Add indexing indicator to sibling domains listing 2025-01-08 12:58:34 +01:00
index (ranking-params) Add disable penalties flag to ranking params 2025-01-08 00:16:49 +01:00
libraries (search) Tweak token formation. 2025-01-05 21:01:09 +01:00
processes (specialization) Soften length requirements for wiki-specialized documents (incl. cppreference) 2025-01-07 15:41:30 +01:00
services-application (search-service) Begin replacement of the crawl queue mechanism with node_affinity flagging 2025-01-08 13:25:56 +01:00
services-core (ranking-params) Add disable penalties flag to ranking params 2025-01-08 00:16:49 +01:00
tools (converter) Drop feed data from SlopDomainRecord 2024-12-26 17:57:08 +01:00
readme.md (doc) Correct dead links and stale information in the docs 2024-09-13 11:02:13 +02:00

Code

This is a pretty large and diverse project with many moving parts.

You'll find a short description in each module of what it does and how it relates to other modules. The modules each have names like "library" or "process" or "feature". These have specific meanings. See doc/module-taxonomy.md.

Overview

A map of the most important components and how they relate can be found below.

image

The core part of the search engine is the index service, which is responsible for storing and retrieving the document data. The index serive is partitioned, along with the executor service, which is responsible for executing processes. At least one instance of each service must be run, but more can be run alongside. Multiple partitions is desirable in production to distribute load across multiple physical drives, as well as reducing the impact of downtime.

Search queries are delegated via the query service, which is a proxy that fans out the query to all eligible index services. The control service is responsible for distributing commands to the executor service, and for monitoring the health of the system. It also offers a web interface for operating the system.

Services

The system uses a service registry to find the services. The service registry is based on zookeeper, and is a separate service. The registry doesn't keep track of processes, but APIs. This means that the system is flexible to reconfiguration. The same code can in principle be run as a micro-service mesh or as a monolith.

This is an unusual architecture, but it has the benefit that you don't need to think too much about the layout of the system. You can just request an API and talk to it. Because of this, several of the services have almost no code of their own. They merely import a library and expose it as a service.

Services that expose HTTP endpoints tend to have more code. They are marked with (G).

Processes

Processes are batch jobs that deal with data retrieval, processing and loading. These are spawned and orchestrated by the executor service, which is controlled by the control service.

Features

Features are relatively stand-alone components that serve some part of the domain. They aren't domain-independent, but isolated.

Libraries and primitives

Libraries are stand-alone code that is independent of the domain logic.

  • common elements for creating a service, a client etc.
  • libraries containing non-search specific code.
    • array - large memory mapped area library
    • btree - static btree library