Classifications

• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06F—ELECTRIC DIGITAL DATA PROCESSING
  • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
  • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
  • G06F16/28—Databases characterised by their database models, e.g. relational or object models
  • G06F16/283—Multi-dimensional databases or data warehouses, e.g. MOLAP or ROLAP
• • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
  • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
  • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
  • Y10S707/00—Data processing: database and file management or data structures
  • Y10S707/953—Organization of data
  • Y10S707/957—Multidimensional
• • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
  • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
  • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
  • Y10S707/00—Data processing: database and file management or data structures
  • Y10S707/99941—Database schema or data structure
  • Y10S707/99943—Generating database or data structure, e.g. via user interface

Definitions

• the present invention generally concerns database management systems performed by computers, in particular to corresponding OLAP (OnLine Analytical Processing) and Data Warehouse applications. More specifically, the invention relates to a method and system for generating user-defined presentations or views of data records contained in such a database management system. Even more specifically, the invention is related to database management systems with very large number of data records .
• OLAP OnLine Analytical Processing
• OLAP is computer processing that enables a user to easily and selectively extract and view data from different points-of- view. For example, a user can request that data be analyzed to display a spreadsheet showing all of a telecommunication company's mobile phone products sold in a country in a specific month of the year, compare revenue figures with those for the same products in the preceding month, and then see a comparison of other product sales in that country in the same time period.
• OLAP data is stored in a multidimensional database.
• a relational database can be thought of as two-dimensional
• a multidimensional database considers each data attribute, often called “data key”, such as product, geographic sales region, and time period as a separate "dimension.”
• OLAP software can locate the intersection of dimensions, e.g. 'all products sold in the Eastern region above a certain price during a certain time period', and display them. Attributes such as time periods can be broken down into sub-attributes .
• OLAP can be used for data mining or the discovery of previously un-discerned relationships between data items.
• An OLAP database does not need to be as large as a data warehouse, since not all transactional data is needed for trend analysis.
• ODBC Open Database Connectivity
• data records to be presented in a single cell of an underlying matrix presentation are continuously arranged in a subsequence comprising respective of said placeholder values.
• These single cells of said pivot presentation thus are generated using corresponding of said subsequences.
• a data subsequence of the whole sequence of data records can be used.
• Each of these cells needed for the user-specified pivot presentation is particularly defined a starting point in the sequence by which the required data of the facts table to be presented are accessed.
• a particular data record dimension of the database can be used more times in different aggregation stages of a pivot presentation without any runtime problems. Due to use of only vector operations for subsequent different pivot views of a given database, preceding generated sequences of data records for providing a user-defined pivot view are kept valid for the following pivot views and thus subsequently following pivot views are always deduced from an existing pivot view thus not destructing an already existing pivot view.
• pivot presentation mechanism is not limited to 2-dimensional but can also be applied to n-dimensional pivot presentations. In the n-dimensional case, however, the above mentioned sequence vector is (n-1) -dimensional .
• Fig. 4a-c illustrate typical vector operations for generating a sequence vector in accordance with the present invention
• Fig. 5-6g show overview table diagrams for illustrating how real facts data are sorted in order to obtain a desired pivot view in accordance with the present invention
• FIG. 2c and consists of two columns 260, 270, the left column 260 containing continuous numbers from again ,1' to ,20' in the present example and the right column 270 containing the pre-mentioned index values 275 depicted in Fig. 2a in an ordered arrangement that enables sequentially building-up the pivot view of Fig. 2b.
• a first integer vector 410 provides the sorting order of the facts of the underlying facts column, in relation to the respective key dimension and the occurrence of the elements (reference values) within the key dimensions.
• a second integer vector 400 provides a First Block Element (FBE) indicating, for each occurrence of a key dimension element (e.g. 'Brown'), the first element of its corresponding block within the sorting sequence 410.
• FBE First Block Element
• the 'Fact#' column of the 'Sorted Sequence' tabled is filled with the 'Fact' column of the 'Sorted Sequence' table of the corresponding dimension 410, i.e. a right-hand dimension in the corresponding sorting sequence step.
• the contents of 'Result Permutation' are erased after the two pre-mentioned initialization steps so that these fields can be newly filled in during the next sorting step.
• the number of lines in that table equals the number of facts contained in the real facts table.
• the processing steps conducted in the following are determined by the sorting order related to the key dimension 'Article' which is designated 'Sorted Sequence' in the Figures .
• the sorting mechanism itself is illustrated in more detail in the picture sequence shown in Figures 6a - 6g.
• Each of these pictures shows a single sorting step, the whole sequence of sorting steps shown in that sequence thus depicting only part of the entire sorting procedure.
• the whole procedure is based on inter-linkage of the shown four tables.
• the table for the key dimension 'Article' being designated 'Sorted Sequence' resulting from the previous sorting step for the key dimension 'Customer' is processed in the order of the parameter 'Pseq' from '1' to '20'.
• a corresponding index designated 'TmpGrp' is determined for each of the fact numbers contained in column 'Fact#'.
• the overall procedure is to determine a separate sorting sequence for each pivot dimension.
• the overall sequence is generated by applying the sorting procedure on the separately generated sequences starting with the result of the first and taking the next as the input for the "Mapping' table and "Sort position pointer' table as described above.

Landscapes

• Engineering & Computer Science (AREA)
• Databases & Information Systems (AREA)
• Theoretical Computer Science (AREA)
• Data Mining & Analysis (AREA)
• Physics & Mathematics (AREA)
• General Engineering & Computer Science (AREA)
• General Physics & Mathematics (AREA)
• Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
• Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Priority Applications (5)

Applications Claiming Priority (2)

Related Child Applications (1)

Publications (2)

Family

ID=32103886

Family Applications (1)

Country Status (6)

Cited By (1)

Families Citing this family (25)

Family Cites Families (21)

• 2003
  • 2003-09-11 WO PCT/EP2003/050620 patent/WO2004036456A2/en not_active Ceased
  • 2003-09-11 AU AU2003286187A patent/AU2003286187A1/en not_active Abandoned
  • 2003-09-11 US US10/530,936 patent/US7340476B2/en not_active Expired - Fee Related
  • 2003-09-11 JP JP2004544289A patent/JP4609995B2/ja not_active Expired - Fee Related
  • 2003-09-11 CN CNA038242834A patent/CN1688998A/zh active Pending
  • 2003-10-15 TW TW092128546A patent/TWI230344B/zh not_active IP Right Cessation
• 2007
  • 2007-11-30 US US11/948,033 patent/US7774302B2/en not_active Expired - Fee Related
• 2008
  • 2008-01-17 US US12/015,551 patent/US7856458B2/en not_active Expired - Fee Related

Also Published As

Similar Documents

Legal Events