System for dynamic segmentation analysis using conversion of relational data into object-oriented data

• US 5,426,780 A
• Filed: 02/28/1992
• Issued: 06/20/1995
• Est. Priority Date: 02/28/1992
• Status: Expired due to Term

• Current Assignee: Intergraph Software Technologies Company
• Original Assignee: Intergraph Corporation (Hexagon AB)
• Inventors: Gerull, Douglas B., Glenn, David M.
• Primary Examiner(s): Black, Thomas G.
• Assistant Examiner(s): Lintz, Paul R.
• Application Number:
  US07/845,337
• Time in Patent Office: 1,208 Days
• Field of Search: 358/261.1, 358/261.3, 382/133, 382/56, 395/600, 395/425
• US Class Current: 707/748
• CPC Class Codes: G06F 16/289 Object oriented databases
• CPC Class Codes: Y10S 707/919 Geographic
• CPC Class Codes: Y10S 707/954 Relational
• CPC Class Codes: Y10S 707/955 Object-oriented
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99942 Manipulating data structure, e.g. compression, compaction, compilation

Abstract

Dynamic segmentation of Geographical Information System (GIS) map data, stored in a relational database, converts linear-feature fixed-length attribute arrays, stored as columns in a relational table, into variable length attribute and location arrays for inclusion into an object-oriented map database which can be scanned for candidate values in the attribute and location arrays meeting certain search criteria. Selection of the scanned values is provided for. The object-oriented database may be queried to return the regions, specified in region coordinates, in each of the variable length location arrays, corresponding to the selected attribute values. The intersection of found regions with the selected values from the value arrays can be thereby determined.

Claims

1. A system for performing dynamic segmentation analysis of attributes of a linear network, such attributes stored in a computer-readable relational database, the system comprising:

(a) conversion means for converting the data in the relational database to resulting computer-readable data in object-oriented form, the object-oriented form including;

a plurality of attribute value arrays of variable length implemented in storage in a digital computer, each consecutive value in the array associated with a value of an attribute at a consecutive region of a feature; and

a plurality of corresponding location arrays of variable length, implemented in storage in a digital computer, each location array associated with a given attribute value array and providing region coordinates for each successive value in the corresponding value array;

(b) processing means for analyzing the resulting data in the object-oriented form; and

(c) output means for providing an output of the analysis performed by the processing means.

2. A system according to claim 1, wherein the processing means includes:

(a) scanning means for (i) scanning the value arrays for candidate values meeting a specified first set of search criteria and (ii) selecting such values;

(b) locating means for finding the regions, specified in region coordinates, in each of the related location arrays corresponding to the values selected; and

(c) intersecting means for determining the intersection of the found regions associated with the selected values from each value array, and thereby identifying regions of the feature in which the specified first set of criteria are satisfied.

3. A system according to claim 1, wherein each region is described by a segment along the feature and the coordinates identifying the segment are normalized.

4. A system according to claim 2, wherein each region is described by a segment along the feature and the coordinates identifying the segment are normalized, so that the intersecting means identifies segments of the feature in which the specified first set of criteria are satisfied.

5. A system according to claim 2, for performing dynamic segmentation analysis on an identified region of a feature, wherein the scanning means includes means for scanning a portion of the value arrays, corresponding to the identified region in which the first set of search criteria are satisfied, for candidate values meeting a second set of search criteria, and the locating means and intersecting means include means for acting interactively to permit identifying regions of the feature in which the specified first and second sets of search criteria are both satisfied.

6. A system for performing dynamic segmentation analysis of attributes of a linear network, the system including:

(a) a plurality of attribute value arrays of variable length implemented in storage in a digital computer, each consecutive value in the array associated with a value of an attribute at a consecutive region of a feature; and

(b) a plurality of corresponding location arrays of variable length, implemented in storage in a digital computer, each location array associated with a given attribute value array and providing region coordinates for each successive value in the corresponding value array;

(c) scanning means for (i) scanning the value arrays for candidate values meeting a specific first set of search criteria and (ii) selecting such values;

(d) locating means for finding the regions, specified in region coordinates, in each of the related location arrays corresponding to the values selected; and

(e) intersecting means for determining the intersection of the found regions associated with the selected values from each value array, and thereby identifying regions of the feature in which the specified first set of criteria are satisfied.

7. A system according to claim 6, wherein each region is described by a segment along the feature and the coordinates identifying the segment are normalized, so that the intersecting means identifies segments of the feature in which the specified first set of criteria are satisfied.

8. A system according to claim 6, for performing dynamic segmentation analysis on an identified region of a feature, wherein the scanning means includes means for scanning a portion of the value arrays, corresponding to the identified region in which the first set of search criteria are satisfied, for candidate values meeting a second set of search criteria, and the locating means and intersecting means include means for acting interactively to permit identifying regions of the feature in which the specified first and second sets of search criteria are both satisfied.

9. A computer-implemented method for performing dynamic segmentation analysis of attributes of a linear network, such method comprising:

(a) converting the data in the relational database to resulting computer-readable data in object-oriented form by the steps of;

(i) providing a plurality of attribute value arrays of variable length implemented in storage in a digital computer each consecutive value in the array associated with a value of an attribute at a consecutive region of a feature; and

(ii) providing a plurality of corresponding location arrays of variable length, implemented in storage in a digital computer, each location array associated with a given attribute value array and providing region coordinates for each successive value in the corresponding value array; and

(iii) filling the arrays based on data in relational database;

(b) processing the resulting data in a digital computer to perform the analysis; and

(c) providing an output of the analysis in step (b).

10. A method according to claim 9, wherein step (b) includes:

(i) scanning the value arrays for candidate values meeting a specified first set of search criteria and selecting such values;

(ii) finding the regions, specified in region coordinates in each of the related location arrays corresponding to the values selected; and

(iii) determining the intersection of the found regions associated with the selected values from each value array, and thereby identifying regions of the feature in which the specified first set of criteria are satisfied.

11. A method according to claim 10, for performing dynamic segmentation analysis on an identified region of a feature, wherein step (b) includes the step of repeating step (b)(i) by scanning a portion of the value arrays corresponding to the identified region in which the first set of search criteria are satisfied, for candidate values meeting a second set of search criteria, and repeating steps (b)(ii) and (b)(iii) to permit identifying regions of the feature in which the specified first and second sets of search criteria are both satisfied.

12. A method according to claim 9, wherein each region is described by a segment along the feature and the coordinates identifying the segment are normalized.

13. A method according to claim 10, wherein each region is described by a segment along the feature and the coordinates identifying the segment are normalized.

14. A computer-implemented method for performing dynamic segmentation analysis of a linear network, the method comprising:

(a) providing a plurality of attribute value arrays of variable length, implemented in storage in a digital computer, each consecutive value in the array associated with a value of an attribute at a consecutive region of a feature;

(b) providing a plurality of corresponding location arrays of variable lengths, implemented in storage in a digital computer, each location array associated with a given attribute value array and providing region coordinates for each successive value in the corresponding value array;

(c) filling the arrays with data;

(d) scanning the value arrays for candidate values meeting a specified first set of search criteria and selecting such values;

(e) finding the regions, specified in region coordinates in each of the related location arrays corresponding to the values selected;

(f) determining the intersection of the found regions associated with the selected values from each value array, and thereby identifying regions of the feature in which the specified first set of criteria are satisfied; and

(g) providing an output of the determination in step (f).

15. A method according to claim 21, for performing dynamic segmentation analysis on an identified region of a feature, further comprising:

(h) repeating step (d) by scanning a portion of the value arrays corresponding to the identified region in which the first set of search criteria are satisfied, for candidate values meeting a second set of search criteria, and repeating steps (e) and (f) to permit identifying regions of the feature in which the specified first and second sets of search criteria are both satisfied.

16. A method according to claim 15, wherein each region is described by a segment along the feature and the coordinates identifying the segment are normalized.