Method for creating an information closure model
First Claim
1. A method of forming an information closure of a plurality of information units, dividable into a first unit and a plurality of remaining units, each unit having at least one of a plurality of fields, for accessing semistructured information, comprising the steps:
- computing a cross product of the fields in a first unit;
adding said cross product to a list of accepted units;
for each remaining unit r in said plurality of remaining units, computing a selective cross product from said remaining unit r and said list of accepted units; and
removing from the list of accepted units at least one of a plurality of units having identical fields, wherein said information units are derived from a source of semistructured information, and wherein said computing a selective cross product step further comprises the steps;
initializing a result to empty;
for each accepted unit r″
in said list of accepted units, determining a unit r′
containing accepted unit r″ and
at least one of a plurality of non-empty fields in remaining unit r;
determining a new unit n′
containing remaining unit r and at least one of a plurality of non-empty fields in accepted unit r″
;
adding r′ and
n′
to result; and
repeating the two determining steps and adding step above for all accepted units r″
in said list of accepted units.
2 Assignments
0 Petitions
Accused Products
Abstract
According to the invention, a method is provided for forming an information closure of a plurality of rows in a listing stack built by a wrapper program for accessing semistructured information. This method includes removing a first row from the listing stack and computing a cross product of the fields in the first row. A step of adding this cross product to a list of accepted rows can also be part of the method. For each remaining row in the listing stack, the method includes a step of computing a selective cross product according to a plurality of steps. In one step, a result is initialized to empty. Then, for each row in the list of accepted rows, a step of determining for a first new row from the accepted row, extended with the non-empty fields of the remaining row is performed. The method can also include a step of determining a second new row from the remaining row, extended with the non-empty fields in the accepted row. Thereupon, a step of adding the two new rows to the result can be performed. Repeating the determining steps and the adding step for all rows in the list of accepted rows, and removing from the result any identical rows can provide an information closure.
62 Citations
24 Claims
-
1. A method of forming an information closure of a plurality of information units, dividable into a first unit and a plurality of remaining units, each unit having at least one of a plurality of fields, for accessing semistructured information, comprising the steps:
-
computing a cross product of the fields in a first unit;
adding said cross product to a list of accepted units;
for each remaining unit r in said plurality of remaining units, computing a selective cross product from said remaining unit r and said list of accepted units; and
removing from the list of accepted units at least one of a plurality of units having identical fields, wherein said information units are derived from a source of semistructured information, and wherein said computing a selective cross product step further comprises the steps;
initializing a result to empty;
for each accepted unit r″
in said list of accepted units, determining a unit r′
containing accepted unit r″ and
at least one of a plurality of non-empty fields in remaining unit r;
determining a new unit n′
containing remaining unit r and at least one of a plurality of non-empty fields in accepted unit r″
;
adding r′ and
n′
to result; and
repeating the two determining steps and adding step above for all accepted units r″
in said list of accepted units.- View Dependent Claims (2, 3, 4, 5, 6)
-
-
7. A method of forming an information closure of a plurality of rows, having at least one of a plurality fields, in a listing stack of a wrapper program for accessing semistructured information, comprising the steps:
-
removing a first row from said listing stack, leaving a plurality of remaining rows in said listing stack;
computing a cross product of the fields in the first row from said listing stack;
adding said cross product of said fields in said first row to a list of accepted rows;
for each remaining row r in said plurality of remaining rows in said listing stack, computing a selective cross product from said remaining row r and said list of accepted rows, comprising the steps;
initializing a result to empty;
for each accepted row r″
in said list of accepted rows,determining a row r′
containing accepted row r″ and
at least one of a plurality non-empty fields in remaining row r;
determining a new row n′
containing remaining row r and at least one of a plurality non-empty fields in accepted row r″
;
adding rows r′ and
n′
to result;
repeating the two determining steps and adding step above for all accepted rows r″
in said list of accepted rows;
repeating the computing a selective cross product step above for all remaining rows r in said listing stack;
removing from the list of accepted rows at least one of a plurality rows having identical fields; and
providing the result as the information closure, wherein said rows are derived from a source of semistructured information. - View Dependent Claims (8, 9, 10, 11, 12)
-
-
13. A system for computing an information closure of a plurality of information units, dividable into a first unit and a plurality of remaining units, each unit having at least one of a plurality of fields, for accessing semistructured information, comprising:
-
a computer readable medium for containing said plurality of information; and
a processor means operatively disposed to;
compute a cross product of the fields in a first unit;
add said cross product to a list of accepted units;
for each remaining unit r in said plurality of remaining units, compute a selective cross product from said remaining unit r and said list of accepted units; and
remove from the list of accepted units at least one of a plurality of units having identical fields;
wherein said processor means is further operatively disposed to perform the computing of the selective cross product, which further comprises;
initializing a result to empty;
for each accepted unit r″
in said list of accepted units, determining a unit r′
containing accepted unit r″ and
at least one of a plurality of non-empty fields in remaining unit r;
determining a new unit n′
containing remaining unit r and at least one of a plurality of non-empty fields in accepted unit r″
;
adding r′ and
n′
to result; and
repeating the two determining operations and adding operation for all accepted units r″
in said list of accepted units.- View Dependent Claims (14, 15, 16, 17, 18)
-
-
19. A computer programming product for computing an information closure of a plurality of information units, dividable into a first unit and a plurality of remaining units, each unit having at least one of a plurality of fields, for accessing semistructured information, comprising:
-
code for computing a cross product of the fields in a first unit;
code for adding said cross product to a list of accepted units;
code for computing a selective cross product from said remaining unit r and said list of accepted units for each remaining unit r in said plurality of remaining units;
code for removing from the list of accepted units at least one of a plurality of units having identical fields; and
a computer readable medium for containing said codes, wherein said code for computing a selective cross product further comprises;
code for initializing a result to empty;
code for determining a unit r′
containing accepted unit r″ and
at least one of a plurality of non-empty fields in remaining unit r, for each accepted unit r″
in said list of accepted units;
code for determining a new unit n′
containing remaining unit r and at least one of a plurality of non-empty fields in accepted unit r″
;
code for adding r′ and
n′
to result; and
code for repeatedly invoking the two codes for determining and code for adding above for all accepted units r″
in said list of accepted units.- View Dependent Claims (20, 21, 22, 23, 24)
-
Specification