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

Claim 3

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.

Claim 4

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.

Claim 5

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.

Claim 6

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.

Claim 9

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.

Claim 10

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.

Claim 11

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).

Claim 12

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).

Claim 13

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.

Claim 14

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.

Claim 15

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.

Claim 16

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.

Claim 17

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).

Claim 18

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).

Claim 19

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.

Claim 20

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.