System and method for linking data records for parcels

• US 10,248,731 B1
• Filed: 05/15/2015
• Issued: 04/02/2019
• Est. Priority Date: 05/16/2014
• Status: Active Grant

• Current Assignee: Corelogic Solutions LLC (CoreLogic Incorporated)
• Original Assignee: Corelogic Solutions LLC (CoreLogic Incorporated)
• Inventors: Brouwer, II, Derek J., Nagy, Peter A.
• Primary Examiner(s): Thai, Hanh B
• Application Number:
  US14/713,663
• Time in Patent Office: 1,418 Days
• Field of Search: 707769, 707754, 707758, 707803
• CPC Class Codes: G06F 16/29 Geographical information databases
• CPC Class Codes: G06F 16/9537 Spatial or temporal dependent retrieval, e.g. spatiotemporal queries
• CPC Class Codes: G06Q 50/16 Real estate
• CPC Class Codes: G06Q 50/186 Estate planning

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.

Claims

1. A method of linking real estate parcels in a database, the method comprising:

under control of a geocoding engine comprising computer hardware;

accessing a data repository that is configured to store parcel data for each of a plurality of real estate parcels, the parcel data associated with each real estate parcel comprising a parcel boundary;

identifying a community of real estate parcels, the community comprising a plurality of real estate parcels separated by no more than a threshold distance, at least some of the plurality of real estate parcels having spatially contiguous boundaries;

calculating a community border for the community of real estate parcels by;

determining links among the real estate parcels in the community to identify a set of neighboring parcels for each of the real estate parcels in the community;

generating spatially enlarged parcels by spatially enlarging the parcel boundaries of the real estate parcels in the community to create an overlap among the neighboring parcels among the real estate parcels in the community;

finding a union of the spatially enlarged parcels to identify an outward facing boundary of the union of spatially enlarged parcels; and

reducing the outward facing boundary of the union of spatially enlarged parcels to determine the community border for the community;

identifying a group of real estate parcels in the community, wherein each of the real estate parcels in the group intersects the community border;

determining, for each real estate parcel in the group, a border intersection between the real estate parcel and the community border;

finding, for each real estate parcel in the group, a reduced set of neighboring real estate parcels based at least in part on a distance between the border intersection for the real estate parcel and locations of the other real estate parcels in the group;

linking, for each real estate parcel in the group, the real estate parcel to at least one other real estate parcel in the reduced set, wherein a data record associated with the at least one other real estate parcel is missing an address number; and

matching the at least one other real estate parcel in the reduced set to an address number that brackets an address number of the real estate parcel based on the linking.

2. The method of claim 1, wherein each real estate parcel in the community of real estate parcels is represented by a polygon.

3. The method of claim 1, wherein generating spatially enlarged parcels by spatially enlarging the parcel boundaries of the real estate parcels in the community comprises increasing parcel boundaries by an enlargement amount.

4. The method of claim 3, wherein reducing the outward facing boundary of the union of spatially enlarged parcels comprises reducing parcel boundaries by a reduction amount that is greater than the enlargement amount.

5. The method of claim 1, wherein finding the reduced set of neighboring real estate parcels comprises identifying a first real estate parcel in the group that is located the least distance from the border intersection.

6. The method of claim 5, wherein finding the reduced set of neighboring real estate parcels comprises identifying a second real estate parcel in the group that is located the next-to-least distance from the border intersection.

7. The method of claim 6, wherein linking the real estate parcel to at least one other real estate parcel in the reduced set comprises ordering the address numbers of the first real estate parcel and the second real estate parcel.

8. A system for of linking in a database, the system comprising:

non-transitory data storage configured to store parcel data for each of a plurality of parcels, the parcel data associated with each parcel comprising a parcel boundary; 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;

identify a community of parcels, the community comprising a plurality of parcels separated by no more than a threshold distance, at least some of the plurality of parcels having spatially contiguous boundaries;

calculate a community border for the community of parcels by;

determining neighboring parcels for each of the parcels in the community;

generating spatially enlarged parcels so that at least some neighboring parcels overlap;

finding an outer perimeter of a union of the spatially enlarged parcels; and

reducing the outer perimeter of the union of spatially enlarged parcels to provide the community border for the community;

for each parcel in the community of parcels that intersects the community border;

calculate a border intersection between the parcel and the community border;

determine a reduced set of neighboring parcels based at least in part on distances between the border intersection for the parcel and locations of other parcels that intersect the community border;

link the parcel to at least one other parcel in the reduced set of neighboring parcels, wherein a data record associated with the at least one other parcel is missing an address number; and

match the at least one other parcel in the reduced set to an address number that brackets an address number of the parcel based on the linking.

9. The system of claim 8, wherein each parcel in the community of parcels is represented by a polygon.

10. The system of claim 8, wherein to generate spatially enlarged parcels, the computer system is programmed to increase at least some parcel boundaries by an enlargement amount.

11. The system of claim 10, wherein to reduce the outer perimeter, the computer system is programmed to reduce the at least some parcel boundaries by a reduction amount that is greater than the enlargement amount.

12. The system of claim 8, wherein to determine the reduced set of neighboring parcels, the computer system is programmed to identify a first real estate parcel in the group that is located the least distance from the border intersection.

13. The system of claim 12, wherein the computer system is programmed to identify a second real estate parcel in the group that is located the next-to-least distance from the border intersection.

14. The system of claim 13, wherein to link the parcel to at least one other parcel in the reduced set, the computer system is programmed to order the address numbers of the first real estate parcel and the second real estate parcel.

15. Non-transitory computer storage comprising computer-executable instructions that, when executed by a computer, cause the computer to:

identify a community of parcels, the community comprising a plurality of parcels separated by no more than a threshold distance, at least some of the plurality of parcels having spatially contiguous boundaries;

calculate a community border for the community of parcels using spatially enlarged parcels;

for each parcel in the community of parcels that intersects the community border;

calculate a border intersection between the parcel and the community border;

determine a reduced set of neighboring parcels based at least in part on distances between the border intersection for the parcel and locations of other parcels that intersect the community border; and

link the parcel to at least one other parcel in the reduced set of neighboring parcels, wherein a data record associated with the at least one other real estate parcel is missing an address number; and

match the at least one other parcel in the reduced set of neighboring parcels to an address number that brackets an address number of the parcel based on the linking.

16. The non-transitory computer storage of claim 15, wherein to calculate the community border for the community of parcels, the computer-executable instructions comprise instructions to:

determine neighboring parcels for each of the parcels in the community;

generate spatially enlarged parcels so that at least some neighboring parcels overlap;

find an outer perimeter of a union of the spatially enlarged parcels; and

reduce the outer perimeter of the union of spatially enlarged parcels to provide the community border for the community.

17. The non-transitory computer storage of claim 15, wherein to calculate the community border for the community of parcels, the computer-executable instructions comprise instructions to:

calculate a path that surrounds the community of parcels; and

shrink the path so that it intersects at least a portion of the parcels in the community.

18. The non-transitory computer storage of claim 15, wherein to determine the reduced set of neighboring parcels, the computer-executable instructions comprise instructions to identify a first neighboring parcel located the minimum distance from the border intersection.

19. The non-transitory computer storage of claim 15, wherein to link the parcel to at least one other parcel in the reduced set of neighboring parcels, the computer-executable instructions comprise instructions to determine a directionality between the parcel and the at least one other parcel in the reduced set of neighboring parcels.