Abstract

Addresses, one of the most important geographical reference systems in natural languages, are usually used to search spatial objects in daily life. Geocoding concatenates text with georeferenced coordinates and is an essential middleware service in geographic information applications. Despite its importance, geocoding remains challenging with only text as input, hindering text matching in reference databases without the specific text. To optimize the storage and retrieval of addresses in databases, this work proposes a graph-based approach for representing addresses. The approach clarifies the characteristics of relative concepts, designs a graph structure and identifies modelling strategies. Furthermore, a schema is proposed to perform address matching and toponym disambiguation using an address graph. The model is implemented on a graph database, and experimental tasks are employed to demonstrate its effectiveness. The approach provides a new reference for developers when creating address databases.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call