GEOCODING BASED ON NEIGHBORHOODS AND OTHER UNIQUELY DEFINED INFORMAL SPACES OR GEOGRAPHICAL REGIONS

• US 20090132469A1
• Filed: 11/16/2007
• Published: 05/21/2009
• Est. Priority Date: 11/16/2007
• Status: Abandoned Application

• Current Assignee: Urban Mapping, Inc.
• Original Assignee: Urban Mapping, Inc.
• Inventors: FAZAL, RIYAZ, WHITE, IAN H.
• Application Number:
  US11/941,698
• Publication Number:
  US 20090132469A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06Q 10/00 Administration; Management

Abstract

A computer-based method for creating a data structure for informal geographic spaces for use with geocoded databases. A set of data is stored in memory for a geographic region, and a plurality of neighborhoods is identified in the geographic region based on processing of the stored set of data. The method includes generating a boundary definition for each of the neighborhoods by processing neighborhood definition information. A data structure is created in the memory for containing neighborhood data content with at least one record for each of the neighborhoods. The data structure is populated by storing, for each neighborhood, the generated boundary definition along with a neighborhood name and identifier in the records of data structure. The boundary definition may be created by combining two or more definitions identified for a single neighborhood to provide a more inclusive geometry such as by aligning the geometries and performing an additive algorithm.

Claims

1. A computer-based method for creating a data structure for informal geographic:

spaces for use in geographically-based searching, comprising;

operating a processor to store in memory a set of data for a geographic region;

identifying a plurality of neighborhoods in the geographic region based on the stored set of data including determining a name for each of the neighborhoods;

generating a boundary definition for each of the neighborhoods by processing neighborhood definition information in the stored set of data;

operating the processor to assign an identifier to each of the neighborhoods;

creating a data structure in the memory for containing neighborhood data content with at least one record for each of the neighborhoods; and

operating the processor to populate the data structure by storing the boundary definition along with the associated one of the names and the associated one of the identifiers in the records of the data structure

2. The method of claim 1, wherein the neighborhood definition information comprises at least two boundary geometries for at least one of the neighborhoods and wherein the generating of the boundary definition for the at least one of the neighborhoods comprises combining the at least two boundary geometries to define a new boundary geometry.

3. The method of claim 2, wherein the new boundary geometry is defined with geographical coordinates defining sides of a polygon and wherein the polygon is configured to include at least area enclosed by the at least two boundary geometries.

4. The method of claim 2, wherein the new boundary geometry includes at least some space found in only one of the at least two boundary geometries.

5. The method of claim 1, wherein the neighborhood definition information comprises a boundary geometry for each of the neighborhoods and wherein the generating of the boundary definition for at least one of the neighborhoods comprises modifying the boundary geometry to define a new boundary geometry for the at least one of the neighborhoods.

6. The method of claim 5, wherein the modifying comprises increasing a size of the boundary geometry of the at least one of the neighborhoods, whereby an area enclosed within the new boundary geometry is greater than an area enclosed within the boundary geometry.

7. The method of claim 1, wherein the boundary definitions of at least two of the neighborhoods are generated such that an overlapping area is enclosed by a boundary geometry of each of the at least two neighborhoods.

8. The method of claim 7, further including operating the processor to designate one of the at least two neighborhoods as dominant and updating the data structure by including data indicating the dominance of the designated one, whereby a geographic coordinate located in both of the as least two neighborhoods can be determined to be in both with one being a primary result.

9. The method of claim 1, further comprising creating a geocoded database by associating each of the neighborhoods with a set of digital content.

10. The method of claim 9, further comprising responding to a search request including a geographic term and a content term by associating the geographic term with one of the neighborhoods and returning a portion of the set of digital content associated with the one of the neighborhoods as a search result.

11. The method of claim 10, wherein the geographic term comprises a neighborhood name corresponding to the name of the one of the neighborhoods or a geographic location corresponding to the boundary definition of the one of the neighborhoods.

12. A method generating informal space definitions for use in spatial indexing, comprising:

operating a computer to access informal space data including geographic coordinates that define boundary geometries for a plurality of informal spaces;

with the computer, identifying a set of the informal spaces that are each associated with at least two of the boundary geometries;

applying an additive algorithm to define a single boundary definition for each of the informal spaces in the identified set, wherein the single boundary definition is inclusive of area enclosed with the at least two associated boundary geometries;

operating the computer to store the single boundary definitions digitally in a data store along with a name and a unique identifier for each of the informal spaces in the identified set; and

with the computer, generating an output including the single boundary definitions, the names, and the unique identifiers.

13. The method of claim 12, further comprising modifying the boundary geometries for a subset of the informal spaces such that a greater area is included within each of the modified boundary geometries.

14. The method of claim 12, wherein the informal spaces comprises neighborhoods and the names comprise neighborhood names.

15. The method of claim 14, further comprising operating the computer to identify pairs of neighborhoods with differing ones of the neighborhood names and substantially similar ones of the boundary geometries and to store an alias relationship for each of the pairs of the neighborhoods in the data store.

16. The method of claim 12, wherein at the single boundary definitions are not exclusive, whereby a geographic location can be within two or more of the single boundary definitions.

17. A memory for storing data for access by an application program being executed on a data processing system, comprising:

a data structure stored in the memory, the data structure including information resident in a database used by said application program and including;

a neighborhood geometry record comprising a plurality of attribute data objects including an identifier for a neighborhood, a name for the neighborhood, and a polygon geometry defining a geographic boundary for the neighborhood; and

a neighborhood relationship record comprising a plurality of attribute data objects including the identifier for the neighborhood and a relationship attribute defining a relationship between the neighborhood associated with the identifier and another neighborhood,

wherein the polygon geometries of at least some of the neighborhoods overlap to include common geographic areas.

18. The memory of claim 17, wherein at least one of the polygonal geometries is configured to include a first area defined by a first boundary definition with a second area defined by a second, differing boundary definition.

19. The memory of claim 17, wherein the relationship determines which of the associated neighborhoods is dominant with regard to one of the common geographic areas.

20. The memory of claim 17, wherein the database is geocoded such that a set of digital content is associated with each of the neighborhoods.