Adaptive tiling
Dense ground splits itself
Any tile that hits the result ceiling divides into four, recursively, up to six levels. Downtown becomes dozens of tiles; farmland stays one.
6
Levels
36
Tiles · Lyon
1,732
Found
Tile tree · Lyon centre
Search “restaurant” across France and you get 100 rows, not 175,000. Three mechanisms exist to break that.
Any tile that hits the result ceiling divides into four, recursively, up to six levels. Downtown becomes dozens of tiles; farmland stays one.
The engine speaks the source’s own request format over HTTP. A headless page costs 1.5s; a direct call, 150ms.
Website enrichment is cached platform-wide. A search overlapping known ground returns almost instantly.
Blocks are recovered automatically — sessions and proxies rotate without losing the job.
Format changes on the source side degrade fields, never the whole extraction.
Every tile is checkpointed. A job picks up where it stopped, never from zero.