Data processing apparatus and method including proportional updating of data

Claim 3

The method of claim 1 wherein said first dimension is the row dimension and said second dimension is the column dimension.

Claim 4

The method of claim 1 further comprising the steps of: a user specifying selection criteria; and excluding from the display screen representation data records which do not satisfy said selection criteria.

Claim 5

The method of claim 3 wherein said selection criteria comprises values of said key fields.

Claim 6

The system of claim 1 further comprising the steps of: specifying key fields to be excluded from representation on the display screen; and omitting said user specified key fields from said representation of said first and second hierarchical relationships on said display screen.

Claim 7

The method of claim 1 further comprising the steps of: adding a value to a cell which is blank, wherein said blank cell does not represent any data records; and creating a plurality of new data records which represent all possible combinations of data records at the intersection of hierarchies associated with the cell; distributing said added value among the quantity fields of said plurality of new data records; and storing said new data records in said memory unit.

Claim 10

The method of claim 7 wherein each of said bit vectors has the same number of bits as the number of data records, and wherein each bit positionally represents one data record.

Claim 11

The method of claim 7 further comprising the steps of: identifying a first bit vector associated with a first node in a first data hierarchy; identifying a second bit vector associated with a second node in a second data hierarchy; and performing a boolean AND operation on said first and second bit vectors, wherein the resulting bit vector represents all data records associated with said first node and said second node.

Claim 12

The method of claim 7 further comprising the steps of: specifying a plurality of values for a first key field; identifying the bit vectors associated with the nodes representative of said values; and performing a boolean OR operation on said bit vectors, wherein the resulting bit vector represents all data records which contain said specified values.

Claim 13

The method of claim 7 further comprising the steps of: specifying a plurality of values for a first key field; specifying a plurality of values for a second key field; identifying the bit vectors associated with the nodes representative of said values specified for the first key field; identifying the bit vectors associated with the nodes representative of said values specified for the second key field; performing a boolean OR operation on said bit vectors associated with the nodes representative of said values specified for the first key field, wherein the resulting bit vector defines a first intermediate bit vector; performing a boolean OR operation on said bit vectors associated with the nodes representative of said values specified for the second key field, wherein the resulting bit vector defines a second intermediate bit vector; and performing a boolean AND operation on said first and second intermediate bit vectors, wherein the resulting bit vector represents all data records which contain said specified values for the first and second key fields.

Claim 16

The method of claim 12 wherein said graphical representation is a bar chart.

Claim 17

A database reporting method comprising the steps of: storing data records in a memory unit, each of said data records comprising a plurality of key fields and at least one quantity field and having a bit vector, wherein a first set of said key fields defines a first hierarchical relationship, a second set of said key fields defines a second hierarchical relationship, and a third set of said key fields defines a third hierarchical relationship; identifying all unique combinations of values in said third set of key fields; and generating a plurality of reports using said bit vectors, each of said reports associated with one of said unique combinations of values, wherein each report display said first hierarchical relationship on a first dimension and said second hierarchical relationship on a second dimension, and wherein each report displays values at the intersections of said first and second dimensions, wherein said values represent the contents of the quantity fields of the data records which are represented by said intersections and which contain the unique combination of values associated with the report and are obtained using said bit vectors.

Claim 18

A database reporting method comprising the steps of: storing data records in a memory unit, each of said data records comprising a plurality of key fields and at least one quantity field and having a bit vector, wherein a first set of said key fields defines a first hierarchical relationship, a second set of said key fields defines a second hierarchical relationship, and a third set of said key fields defines a third hierarchical relationship; identifying all unique combinations of values in said third set of key fields; and generating a plurality of reports using said bit vectors, each of said reports associated with one of said unique combinations of values, wherein each report display said first hierarchical relationship on a first dimension and said second hierarchical relationship on a second dimension, and wherein each report displays values at the intersections of said first and second dimensions, wherein said values represent the contents of the quantity fields of the data records which are represented by said intersections and which contain the unique combination of values associated with the report and are obtained using said bit vectors.

Claim 19

The method of claim 14 further comprising the step of: generating a plurality of summary level reports, each of said summary level reports associated with a summary level in said third hierarchical relationship, wherein each of said reports displays said first hierarchical relationship on a first dimension and said second hierarchical relationship on a second dimension, and wherein each report displays values at the intersections of said first and second dimensions, wherein said values represent the contents of the quantity fields of the data records which are represented by said intersections and which are included in the associated summary level.

Claim 20

The method of claim 14 further comprising the steps of: specifying selection criteria; and suppressing generation of reports which do not satisfy said selection criteria.

Claim 21

The method of claim 16 wherein said selection criteria comprises values of key fields in said third set of key fields.

Claim 24

The system of claim 18 wherein said first dimension is the row dimension and said second dimension is the column dimension.

Claim 25

The system of claim 18 further comprising: means for allowing a user to specify selection criteria; and means for excluding from the display screen representation data records which do not satisfy said selection criteria.

Claim 26

The system of claim 20 wherein said selection criteria comprises values of said key fields.

Claim 27

The system of claim 18 further comprising: means for allowing a user to specify key fields to be excluded from representation on the display screen; and means for omitting said user specified key fields from said representation of said first and second hierarchical relationships on said display screen.

Claim 28

The system of claim 18 further comprising: means for adding a value to a cell which is blank, wherein said blank cell does not represent any data records; and means for creating a plurality of new data records which represent all possible combinations of data records at the intersection of hierarchies associated with the cell; means for distributing said added value among the quantity fields of said plurality of new data records; and means for storing said new data records in said memory unit.

Claim 29

A hierarchical database system comprising: a computer processor; a memory unit connected to said computer processor for the storage of a plurality of data records, each of said data records comprising a plurality of key fields and at least one quantity field, wherein each unique combination of values of said key fields defines a unique record; a plurality of sets of said key fields defining a plurality of data hierarchies, each of said data hierarchies comprising: a plurality of levels, said number of levels being equal to the number of key fields in the set of key fields defining the hierarchy, wherein each key field in said set of key fields is associated with one level, wherein each of said plurality of levels comprises a plurality of nodes, said number of nodes being equal to the number of unique values present in the data records in the key field associated with that level, wherein each of said nodes represents one of said unique values; at least one node list associated with each level of each of said data hierarchies, each of said node lists comprising: a bit vector associated with a node of the associated level, said bit vector representing the data records which contain the unique value represented by the associated node; and a pointer associated with a node of the associated level, said pointer pointing to the lower level node list associated with the nodes which subordinate the associated node, if such subordinate nodes exist; and means for storing said at least one node in said memory unit.

Claim 30

A hierarchical database system comprising: a computer processor; a memory unit connected to said computer processor for the storage of a plurality of data records, each of said data records comprising a plurality of key fields and at least one quantity field, wherein each unique combination of values of said key fields defines a unique record; a plurality of sets of said key fields defining a plurality of data hierarchies, each of said data hierarchies comprising: a plurality of levels, said number of levels being equal to the number of key fields in the set of key fields defining the hierarchy, wherein each key field in said set of key fields is associated with one level, wherein each of said plurality of levels comprises a plurality of nodes, said number of nodes being equal to the number of unique values present in the data records in the key field associated with that level, wherein each of said nodes represents one of said unique values; at least one node list associated with each level of each of said data hierarchies, each of said node lists comprising: a bit vector associated with a node of the associated level, said bit vector representing the data records which contain the unique value represented by the associated node; and a pointer associated with a node of the associated level, said pointer pointing to the lower level node list associated with the nodes which subordinate the associated node, if such subordinate nodes exist; and means for storing said at least one node in said memory unit.

Claim 31

The system of claim 24 wherein each of said bit vectors has the same number of bits as the number of data records, and wherein each bit positionally represents one data record.

Claim 32

The system of claim 24 further comprising: means for identifying a first bit vector associated with a first node in a first data hierarchy; means for identifying a second bit vector associated with a second node in a second data hierarchy; and means for performing a boolean AND operation on said first and second bit vectors, wherein the resulting bit vector represents all data records associated with said first node and said second node.

Claim 33

The system of claim 24 further comprising: means for specifying a plurality of values for a first key field; means for identifying the bit vectors associated with the nodes representative of said values; and means for performing a boolean OR operation on said associated bit vectors, wherein the resulting bit vector represents all data records which contain said specified values.

Claim 34

The system of claim 24 further comprising: means for specifying a plurality of values for a first key field; means for specifying a plurality of values for a second key field; means for identifying the bit vectors associated with the nodes representative of said values specified for the first key field; means for identifying the bit vectors associated with the nodes representative of said values specified for the second key field; means for performing a boolean OR operation on said bit vectors associated with the nodes representative of said values specified for the first key field, wherein the resulting bit vector defines a first intermediate bit vector; means for performing a boolean OR operation on said bit vectors associated with the nodes representative of said values specified for said the second key field, wherein the resulting bit vector defines a second intermediate bit vector; means for performing a boolean AND operation on said first and second intermediate bit vectors, wherein the resulting bit vector represents all data records which contain said specified values for the first and second key fields.

Claim 37

The system of claim 29 wherein said graphical representation is a bar chart.

Claim 38

A database reporting system comprising: a computer processor; a display device connected to the computer processor for the display of graphical and textual information; a memory unit connected to the computer processor for the storage of data records, each of said data records comprising a plurality of key fields and at least one quantity field and having a bit vector, wherein a first set of said key fields defines a first hierarchical relationship, a second set of said key fields defines a second hierarchical relationship, and a third set of said key fields defines a third hierarchical relationship; means for identifying all unique combinations of values in said third set of key fields; and means for generating a plurality of reports using said bit vectors, each of said reports associated with one of said unique combinations of values, wherein each report displays said first hierarchical relationship on a first dimension and said second hierarchical relationship on a second dimension, and wherein each report displays values at the intersections of said first and second dimensions, wherein said values represent the contents of the quantity fields of the data records which are represented by said intersections and which contain the unique combination of values associated with the report and are obtained using said bit vectors.

Claim 39

A database reporting system comprising: a computer processor; a display device connected to the computer processor for the display of graphical and textual information; a memory unit connected to the computer processor for the storage of data records, each of said data records comprising a plurality of key fields and at least one quantity field and having a bit vector, wherein a first set of said key fields defines a first hierarchical relationship, a second set of said key fields defines a second hierarchical relationship, and a third set of said key fields defines a third hierarchical relationship; means for identifying all unique combinations of values in said third set of key fields; and means for generating a plurality of reports using said bit vectors, each of said reports associated with one of said unique combinations of values, wherein each report displays said first hierarchical relationship on a first dimension and said second hierarchical relationship on a second dimension, and wherein each report displays values at the intersections of said first and second dimensions, wherein said values represent the contents of the quantity fields of the data records which are represented by said intersections and which contain the unique combination of values associated with the report and are obtained using said bit vectors.

Claim 40

The system of claim 31 further comprising: means for generating a plurality of summary level reports, each of said summary level reports associated with a summary level in said third hierarchical relationship, wherein each of said reports displays said first hierarchical relationship on a first dimension and said second hierarchical relationship on a second dimension, and wherein each report displays values at the intersections of said first and second dimensions, wherein said values represent the contents of the quantity fields of the data records which are represented by said intersections and which are included in the associated summary level.

Claim 41

The system of claim 21 further comprising: means for specifying selection criteria; and means for suppressing generation of reports which do not satisfy said selection criteria.

Claim 42

The system of claim 33 wherein said selection criteria comprises values of key fields in said third set of key fields.