IP Library Granted Patent US 11,061,985
Granted Patent B2
US 11,061,985 · App. 16/370,686 · Granted Jul 13, 2021

System and method for linking data records for parcels

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,061,985
App. No.
16/370,686
Granted
Jul 13, 2021
Kind
B2
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 (61)

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, 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, wherein calculating the community border comprises enlarging parcel boundaries of the real estate parcels in the community;

identifying a first real estate parcel in the community of real estate parcels that intersects the community border;

determining a border intersection between the first real estate parcel and the community border;

determining a neighboring real estate parcel in the community of real estate parcels that is within a threshold distance of the border intersection;

creating a link between the first real estate parcel and the neighboring real estate parcel; and

validating or correcting address information included in a data record for the first real estate parcel based at least in part on the link and an address number of the neighboring real estate parcel.

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 , further comprising determining a second neighboring real estate parcel in the community of real estate parcels that is within the threshold distance of the border intersection.

4. The method of claim 3 , further comprising linking the first real estate parcel to the second neighboring real estate parcel.

5. The method of claim 4 , wherein linking the first real estate parcel to the neighboring and second neighboring real estate parcels further comprises ordering the neighboring real estate parcel and the second neighboring real estate parcel based on a distance of the neighboring real estate parcel from the border intersection and a distance of the second neighboring real estate parcel from the border intersection.

6. The method of claim 5 , wherein the neighboring real estate parcel is located the least distance from the border intersection.

7. The method of claim 6 , wherein the second neighboring real estate parcel is located the next-to-least distance from the border intersection.

8. The method of claim 7 , wherein validating or correcting the address information comprises:

determining the address number of the neighboring real estate parcel;

determining an address number of the second neighboring real estate parcel; and

matching the first real estate parcel to an address number that is bracketed by the address number of the neighboring real estate parcel and the address number of the second neighboring real estate parcel.

9. The method of claim 1 , wherein the link represents a determination that the first real estate parcel and the neighboring real estate parcel are neighboring in an address number sense, and wherein validating or correcting the address information comprises using an address number of the neighboring real estate parcel to assign an address number to the first real estate parcel.

10. The method of claim 1 , wherein calculating the community border further comprises applying a union operation to the enlarged parcel boundaries to identify an outward facing street boundary of the community.

11. The method of claim 1 , wherein validating or correcting the address information comprises adding a missing address number to a data record corresponding to the first real estate parcel.

12. A system for 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 at least:

identify a community of parcels, at least some of the plurality of parcels having spatially contiguous boundaries;

calculate a community border for the community of parcels, wherein calculating the community border comprises enlarging parcel boundaries of real estate parcels in the community;

identify a first parcel in the community of parcels that intersects the community border;

determine a border intersection between the first parcel and the community border;

determine a neighboring parcel that is within a threshold distance of the border intersection;

create a link between the first parcel and the neighboring parcel; and

validate or correct address information included in a data record for the first real estate parcel based at least in part on the link and an address number of the neighboring parcel.

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

14. The system of claim 12 , wherein the computer system is further programmed with executable instructions determine a second neighboring parcel in the community of parcels that is within the threshold distance of the border intersection.

15. The system of claim 14 , wherein the computer system is further programmed with executable instructions to link the first parcel to the second neighboring parcel.

16. The system of claim 15 , wherein the computer system is further programmed with executable instructions to order the neighboring parcel and the second neighboring parcel based on a distance of the neighboring parcel from the border intersection and a distance of the second neighboring parcel from the border intersection.

17. The system of claim 16 , wherein the neighboring parcel is located the least distance from the border intersection.

18. The system of claim 17 , wherein the second neighboring parcel is located the next-to-least distance from the border intersection.

19. The system of claim 18 , wherein the computer system is further programmed with executable instructions to:

determine the address number of the neighboring parcel;

determine an address number of the second neighboring parcel; and

match the first parcel to an address number that is bracketed by the address number of the neighboring parcel and the address number of the second neighboring parcel.

20. The system of claim 12 , wherein the link represents a determination that the first real estate parcel and the neighboring real estate parcel are neighboring in an address number sense, and wherein the computer system is programmed to use an address number of the neighboring real estate parcel to assign an address number to the first real estate parcel.

21. The system of claim 12 , wherein the computer system is programmed to apply a union operation to the enlarged parcel boundaries to identify an outward facing street boundary of the community.

22. The system of claim 12 , wherein the computer system is programmed to add a missing address number to a data record corresponding to the first real estate parcel.

23. 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;

calculate a border intersection between a first parcel in the community of parcels and a community border associated with the community of parcels, wherein calculating the community border comprises enlarging parcel boundaries of real estate parcels in the community;

determine a neighboring parcel in the community of parcels that is within a threshold distance of the border intersection;

create a link between the first parcel and the neighboring parcel; and

validate or correct address information included in a data record for the first real estate parcel based at least in part on the link and an address number of the neighboring parcel.

24. The non-transitory computer storage of claim 23 , wherein the computer-executable instructions further cause the computer to determine a second neighboring parcel in the community of parcels that is within the threshold distance of the border intersection.

25. The non-transitory computer storage of claim 24 , 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 border intersection and a distance of the second neighboring parcel from the border intersection.

26. The non-transitory computer storage of claim 25 , wherein the computer-executable instructions further cause the computer to:

determine the address number of the neighboring parcel;

determine an address number of the second neighboring parcel; and

match the first parcel to an address number that is bracketed by the address number of the neighboring parcel and the address number of the second neighboring parcel.

27. The non-transitory computer storage of claim 23 , wherein the link represents a determination that the first real estate parcel and the neighboring real estate parcel are neighboring in an address number sense, and the computer-executable instructions direct the computer to use an address number of the neighboring real estate parcel to assign an address number to the first real estate parcel.

28. The non-transitory computer storage of claim 23 , wherein the computer-executable instructions direct the computer to apply a union operation to the enlarged parcel boundaries to identify an outward facing street boundary of the community.

29. The non-transitory computer storage of claim 23 , wherein the computer-executable instructions direct the computer to add a missing address number to a data record corresponding to the first real estate parcel.

Assignments (3)
SECURITY INTEREST Recorded Jun 10, 2021
From: CDS BUSINESS MAPPING, LLC; CLAREITY SECURITY, LLC; CORELOGIC CREDCO, LLC; CORELOGIC DORADO, LLC; CORELOGIC SOLUTIONS, LLC; CORELOGIC TAX SERVICES, LLC; CORELOGIC, INC.; FNC, INC.; LOCATION INC. GROUP CORPORATION
To: U.S. BANK NATIONAL ASSOCIATION
Reel/Frame 056539/0146 →
SECOND LIEN PATENT SECURITY AGREEMENT Recorded Jun 10, 2021
From: CDS BUSINESS MAPPING, LLC; CLAREITY SECURITY, LLC; CORELOGIC CREDCO, LLC; CORELOGIC DORADO, LLC; CORELOGIC SOLUTIONS, LLC; CORELOGIC TAX SERVICES, LLC; CORELOGIC, INC.; FNC, INC.; LOCATION INC. GROUP CORPORATION
To: ARES CAPITAL CORPORATION
Reel/Frame 056539/0227 →
FIRST LIEN PATENT SECURITY AGREEMENT Recorded Jun 10, 2021
From: CDS BUSINESS MAPPING, LLC; CLAREITY SECURITY, LLC; CORELOGIC CREDCO, LLC; CORELOGIC DORADO, LLC; CORELOGIC SOLUTIONS, LLC; CORELOGIC TAX SERVICES, LLC; CORELOGIC, INC.; FNC, INC.; LOCATION INC. GROUP CORPORATION
To: JPMORGAN CHASE BANK, N.A.
Reel/Frame 056539/0241 →