One record
Check one known place on additional maps straight from its profile.
Sequential lookup of a known set
Find places from an existing dataset on other maps
Start with one record, selected table rows, or a completed single-map run. CrawlRover excludes linked sources, checks the chosen target maps, and holds ambiguous candidates for confirmation.
Three entry points
The same engine, a different seed-set size
Selected rows
Run lookup only for the records you selected, without touching the rest of the dataset.
After a single-map run
Use the completed result as the seed set for selected target providers.
Source map ≠ target maps
The preview avoids duplicate work and inflated counts
| Step | You choose | The interface shows |
|---|---|---|
| Seed | a row, selection, or completed run | existing provider badges |
| Targets | missing maps available in the package | excluded source and linked providers |
| Preview | concurrency and compatible fields | up to N lookups + up to N slot operations |
| Outcome | matched, not found, needs attention | a terminal reason for every target |
Two phases, not one opaque counter
Find and link first; collect selected fields second
1. Lookup and linking
- searches for candidates on target maps
- checks address, name and other signals
- leaves an ambiguous candidate for confirmation
→
2. Collection and gap fill
- runs only for linked listings
- collects compatible selected fields
- shows work as “up to N”, not a promised N/N
How this differs from post-cross-map completion
The engine is related; the timing and seed set are not
Find on other maps
Run it later for any existing dataset: one row, a selection, or a single-map result.
Complete after cross-map
Continues one parent run after primary scans reach terminal states and uses that run’s found set.
How cross-map works ›Field enrichment
Adds selected fields to already found and linked records; by itself it does not discover another provider listing.
Fields and freshness ›Check an existing dataset against other sources
Review target maps, both work upper bounds, and possible outcomes before launch.