Ordered information geocoding method and apparatus

• US 6,101,496 A
• Filed: 06/08/1998
• Issued: 08/08/2000
• Est. Priority Date: 06/08/1998
• Status: Expired due to Term

• Current Assignee: Mapinfo Corp.
• Original Assignee: Mapinfo Corp.
• Inventors: Esposito, David J.
• Primary Examiner(s): Black, Thomas G.
• Assistant Examiner(s): ALAM, SHAHID AL
• Application Number:
  US09/093,259
• Time in Patent Office: 792 Days
• Field of Search: 707/3-8, 707/104, 707/530, 707/532, 701/207-208, 705/10, 705/62, 379/220
• US Class Current: 1/1
• CPC Class Codes: G01C 21/32 Structuring or formatting of map data
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99934 Query formulation, input preparation, or translation
• CPC Class Codes: Y10S 707/99935 Query augmenting and refining, e.g. inexact access
• CPC Class Codes: Y10S 707/99936 Pattern matching access
• CPC Class Codes: Y10S 707/99937 Sorting
• CPC Class Codes: Y10S 707/99945 Object-oriented database structure processing

Abstract

Ordered information data 22 is combined with prior geocoded data 21 to improve geocoding. The combined records are sorted by precision 33. The two highest precision groups are interpolated to further geocode the records and provide enhanced street address products 42.

Claims

1. A method for improving a geocoded database comprising the steps of:

comparing a first set of geocoded database records to second set of records containing inherent geographic information,

said first set of records each comprising a first number of data fields including data representing an identification of a geographic location corresponding to the record and data representing one of two or more geographic centroids representative of geographic areas including the location, said centroids from a centroid with highest precision to a centroid with lowest precision;

said second set of records comprising inherent geographically ordered data fields where said data represents a unique identification of a geographic location and the proximity of one record of one location to other records at other geographic locations and one or more data fields corresponding to the data fields of the records in the first set;

generating a plurality of matches where a record in the first set has a data field that matches a data field of a record in the second set;

sorting the matched sets by the centroids of the first set of records;

selecting matched sets with the highest precision centroids;

adding the geographically ordered data fields of the second set to the records matched in the first set to generate a third set of records.

2. The method of claim 1 comprising the further step of comparing the third set of records to the second set of records to identify records in the second set that are geographically proximate to one or more records in the third set;

changing the centroid of the identified records of the second set to correspond to the centroid of the most proximate record in the third set; and

adding the geographically ordered data fields of the second set to the most proximate records of the third set.

3. The method of claim 1 wherein the centroids comprise at least four centroids of different precision.

4. The method of claim 3 wherein the centroids comprise street level, ZIP+4, ZIP+2, and ZIP.

5. The method of claim 1 wherein the step of selecting comprises selecting the matched sets for the highest and the second highest precision centroids.

6. The method of claim 5 wherein the highest and second highest precision centroids are street level and ZIP+4.

7. The method of claim 6 wherein the step of selecting matched sets comprises selecting matches with the highest and second highest precision centroids to create a third set of records;

and further comprising comparing the third set of records to the second set of records to identify records in the second set that are geographically proximate to one or more records in the third set;

changing the centroid of the identified records of the second set to correspond to the centroid of the most proximate record in the third set; and

adding the geographically ordered data fields of the second set to the most proximate records of the third set.

8. The method of claim 1 wherein the records in both sets comprise data fields for the street address of the records and the matching step comprises comparing the street address data fields of records in the first set to the street address data fields of records in the second set.

9. The method of claim 1 comprising the further step of mapping further data to the third set of records.

10. The method of claim 1 comprising the further step of adding additional street address segments and points to existing street segment address data using topological structure interpolated from said second set and third set of records comprising inherent geographically ordered data fields where said data represents a unique identification of a geographic location and the proximity of one record of one location to other records at other geographic locations.

11. The method of claim 1 comprising the further step of adding additional street address segments and points to existing street segment address data from said second set and third set of records.

12. A computer program stored on a disc and comprising a program for geocoding a database comprising the steps of:

comparing a first set of geocoded database records to second set of geographically ordered records,

said first set of records each comprising a first number of data fields including data representing an identification of a geographic location corresponding to the record and data representing one of two or more geographic centroids representative of geographic areas including the location, said centroids from a centroid with highest precision to a centroid with lowest precision;

said second set of records comprising inherent geographically ordered data fields where said data represents a unique identification of a geographic location and the proximity of one record of one location to other records at other geographic locations and one or more data fields corresponding to the data fields of the records in the first set;

generating a plurality of matches where a record in the first set has a data field that matches a data field of a record in the second set;

sorting the matched sets by the centroids of the first set of records;

selecting matched sets with the highest precision centroids;

adding the geographically ordered data fields of the second set to the records matched in the first set to generate a third set of records.

13. The computer program of claim 12 comprising the further step of comparing the third set of records to the second set of records to identify records in the second set that are geographically proximate to one or more records in the third set;

changing the centroid of the identified records of the second set to correspond to the centroid of the most proximate record in the third set; and

adding the geographically ordered data fields of the second set to the most proximate records of the third set.

14. The computer program of claim 12 wherein the centroids comprise at least four centroids of different precision.

15. The computer program of claim 14 wherein the centroids comprise street level, ZIP+4, ZIP+2, and ZIP.

16. The computer program of claim 12 wherein the step of selecting comprises selecting the matched sets for the highest and the second highest precision centroids.

17. The computer program of claim 16 wherein the highest and second highest precision centroids are street level and ZIP+4.

18. The computer program of claim 17 wherein the step of selecting matched sets comprises selecting matches with the highest and second highest precision centroids to create a third set of records;

and further comprising comparing the third set of records to the second set of records to identify records in the second set that are geographically proximate to one or more records in the third set;

changing the centroid of the identified records of the second set to correspond to the centroid of the most proximate record in the third set; and

adding the geographically ordered data fields of the second set to the most proximate records of the third set.

19. The computer program of claim 12 wherein the records in both sets comprise data fields for the street address of the records and the matching step comprises comparing the street address data fields of records in the first set to the street address data fields of records in the second set.

20. The computer program of claim 12 comprising the further step of mapping further data to the third set of records.

21. A computer for geocoding a database comprising:

a memory for holding a first set of geocoded database records and a second set of geographically ordered records;

means comparing the first set of geocoded database records to the second set of geographically ordered records,

said first set of records each comprising a first number of data fields including data representing an identification of a geographic location corresponding to the record and data representing one of two or more geographic centroids representative of geographic areas including the location, said centroids from a centroid with highest precision to a centroid with lowest precision;

said second set of records comprising inherent geographically ordered data fields where said data represents a unique identification of a geographic location and the proximity of one record of one location to other records at other geographic locations and one or more data fields corresponding to the data fields of the records in the first set;

means for generating a plurality of matches where a record in the first set has a data field that matches a data field of a record in the second set;

means for sorting the matched sets by the centroids of the first set of records;

means for selecting matched sets with the highest precision centroids;

means for adding the geographically ordered data fields of the second set to the records matched in the first set to generate a third set of records.

22. The computer of claim 21 further comprising means for comparing the third set of records to the second set of records to identify records in the second set that are geographically proximate to one or more records in the third set;

means for changing the centroid of the identified records of the second set to correspond to the centroid of the most proximate record in the third set; and

means for adding the geographically ordered data fields of the second set to the most proximate records of the third set.

23. The computer of claim 21 wherein the centroids comprise at least four centroids of different precision.

24. The computer of claim 23 wherein the centroids comprise street level, ZIP+4, ZIP+2, and ZIP.

25. The computer of claim 21 wherein the means for selecting comprises means for selecting the matched sets for the highest and the second highest precision centroids.

26. The computer of claim 21 wherein the highest and second highest precision centroids are street level and ZIP+4.

27. The computer of claim 26 wherein the means for selecting matched sets comprises means for selecting matches with the highest and second highest precision centroids to create a third set of records;

means for comparing the third set of records to the second set of records to identify records in the second set that are geographically proximate to one or more records in the third set;

means for changing the centroid of the identified records of the second set to correspond to the centroid of the most proximate record in the third set; and

adding the geographically ordered data fields of the second set to the most proximate records of the third set.

28. The computer of claim 21 wherein the records in both sets comprise data fields for the street address of the records and the means for matching comprises means for comparing the street address data fields of records in the first set to the street address data fields of records in the second set.

29. The computer of claim 21 further comprising means for mapping further data to the third set of records.