System and method for linking data records for parcels

Abstract

Computerized data management systems and methods for inter-relating, indexing, and organizing data records stored in a database or as computer files are described. The systems and methods can be used for linking or associating data records relating to real estate parcels. A given parcel in a community of parcels may have many neighbors. The systems and methods can identify a reduced set of neighbors of the parcel that have addresses that bracket the address of the parcel.

1 . (canceled) 
     
     
         2 . A method comprising:
 under control of a geocoding engine comprising computer hardware:   identifying a community of parcels, at least some of the plurality of parcels having spatially contiguous boundaries;   enlarging at least some of the parcel boundaries of the parcels in the community to form a community border for the community of parcels;   identifying a location at which at least a portion of a first parcel in the community of parcels intersects the community border;   identifying a neighboring parcel in the community of parcels that is within a threshold distance of the location;   identifying address information of the neighboring parcel; and   in response to identifying that the neighboring parcel is within the threshold distance of the location, determining address information of the first parcel based on the identified address information of the neighboring parcel.   
     
     
         3 . The method of  claim 2 , wherein each parcel in the community of parcels is represented graphically by a polygon. 
     
     
         4 . The method of  claim 2 , further comprising identifying a second neighboring parcel in the community of parcels that is within the threshold distance of the location. 
     
     
         5 . The method of  claim 4 , further comprising ordering the neighboring parcel and the second neighboring parcel based on a distance of the neighboring parcel from the location and a distance of the second neighboring parcel from the location. 
     
     
         6 . The method of  claim 5 , wherein the neighboring parcel is located the least distance from the location. 
     
     
         7 . The method of  claim 6 , wherein the second neighboring parcel is located the next-to-least distance from the location. 
     
     
         8 . The method of  claim 7 , wherein determining address information of the first parcel comprises:
 determining the address information of the neighboring parcel;   determining address information of the second neighboring parcel; and   determining a number that falls between numbers indicated by the address information of the neighboring parcel and the address information of the second neighboring parcel.   
     
     
         9 . A system comprising:
 non-transitory data storage configured to store parcel data for each of a plurality of parcels; and   a computer system comprising computer hardware, the computer system in communication with the non-transitory data storage, the computer system programmed with executable instructions to at least:
 identify a community of parcels, at least some of the plurality of parcels having spatially contiguous boundaries; 
 enlarge at least some of the parcel boundaries of the parcels in the community to form a community border for the community of parcels; 
 identify a location at which at least a portion of a first parcel in the community of parcels intersects the community border: 
 identify a neighboring parcel that is within a threshold distance of the location; 
 identify address information of the neighboring parcel; and 
 in response to identifying that the neighboring parcel is within the threshold distance of the location, determine address information of the first parcel based on the identified address information of the neighboring parcel. 
   
     
     
         10 . The system of  claim 9 , wherein each parcel in the community of parcels is represented graphically by a polygon. 
     
     
         11 . The system of  claim 9 , wherein the computer system is further programmed with executable instructions to at least identify a second neighboring parcel in the community of parcels that is within the threshold distance of the location. 
     
     
         12 . The system of  claim 11 , wherein the computer system is further programmed with executable instructions to at least order the neighboring parcel and the second neighboring parcel based on a distance of the neighboring parcel from the location and a distance of the second neighboring parcel from the location. 
     
     
         13 . The system of  claim 12 , wherein the neighboring parcel is located the least distance from the location. 
     
     
         14 . The system of  claim 13 , wherein the second neighboring parcel is located the next-to-least distance from the location. 
     
     
         15 . The system of  claim 14 , wherein the computer system is further programmed with executable instructions to at least:
 determine the address information of the neighboring parcel;   determine address information of the second neighboring parcel; and   determine a number that falls between numbers indicated by the address information of the neighboring parcel and the address information of the second neighboring parcel.   
     
     
         16 . Non-transitory computer storage comprising computer-executable instructions that, when executed by a computer, cause the computer to:
 identify a community of parcels, at least some of the plurality of parcels having spatially contiguous boundaries;   enlarge at least some of the parcel boundaries of the parcels in the community to form a community border associated with the community of parcels;   identify a location at which at least a portion a first parcel in the community of parcels intersects the community border;   identify a neighboring parcel that is within a threshold distance of the location;   in response to identifying that the neighboring parcel is within the threshold distance of the location, determine address information of the first parcel based on address information of the neighboring parcel.   
     
     
         17 . The non-transitory computer storage of  claim 16 , wherein the computer-executable instructions further cause the computer to identify a second neighboring parcel in the community of parcels that is within the threshold distance of the location. 
     
     
         18 . The non-transitory computer storage of  claim 17 , wherein the computer-executable instructions further cause the computer to order the neighboring parcel and the second neighboring parcel based on a distance of the neighboring parcel from the location and a distance of the second neighboring parcel from the location. 
     
     
         19 . The non-transitory computer storage of  claim 18 , wherein the computer-executable instructions further cause the computer to:
 determine the address information of the neighboring parcel;   determine address information of the second neighboring parcel; and   determine a number that falls between numbers indicated by the address information of the neighboring parcel and the address information of the second neighboring parcel.   
     
     
         20 . The non-transitory computer storage of  claim 16 , wherein the computer-executable instructions further cause the computer to apply a union operation to the at least some of the parcel boundaries of the parcels in the community. 
     
     
         21 . The non-transitory computer storage of  claim 16 , wherein the computer-executable instructions further cause the computer to add a missing address number to a data record corresponding to the first real estate parcel based on the address information of the neighboring parcel.