METHOD FOR APPROXIMATE INDEXING IN ROAD NETWORK DATABASES

摘要

A method for performing approximate indexing in a road network database is provided to index a static object approximately based on a distance in a road network and process a query quickly in the road network database with a small overhead by indexing the static object approximately. A network distance of all static object pairs is calculated in a road network space(S10). The static object is mapped to an m-dimensional Euclid space by using FastMap, a pivot object for the mapped static object is determined, and pivot object information is stored(S11). All static objects on the m-dimensional Euclid space are indexed by using an R-tree(S14), and the network distance to all pivot objects from each node is calculated and stored(S15). A B-tree for node IDs is constructed to manage the distance to all pivot objects from each node(S16).