Data structure for information systems

• US 20040088307A1
• Filed: 12/18/2003
• Published: 05/06/2004
• Est. Priority Date: 02/01/2001
• Status: Abandoned Application

• Current Assignee: SAP SE
• Original Assignee: SAP SE
• Inventors: Sauermann, Volker, Von Bergen, Axel, Schwarz, Arne
• Application Number:
  US10/470,720
• Publication Number:
  US 20040088307A1
• Time in Patent Office: Days
• US Class Current: 707/100
• CPC Class Codes: G06F 16/2246 Trees, e.g. B+trees
• CPC Class Codes: G06F 16/24545 Selectivity estimation or determination
• 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
• CPC Class Codes: Y10S 707/99943 Generating database or data structure, e.g. via user interface

Abstract

Database structure for storage of data within a computer system, with at least one data element of a first type associated with data elements of a second type, representing database entries, and data elements of a third type, associated with the data elements of the second type, wherein the data elements of the second type are arranged in a first tree structure, and wherein the data elements of the third type are arranged in a second tree structure.

Claims

1. Database structure for storage of data within a computer system, with at least one data element of a first type (InfoCluster) associated with:

data elements of a second type (InfoTypes), representing database entries, and

data elements of a third type (InfoCourse), associated with said data elements of the second type (InfoType),

wherein the data elements of the second type (InfoType) are arranged in a first tree structure, and

wherein the data elements of the third type (InfoCourse) are arranged in a second tree structure.

2. Data structure according to claim 1, wherein end sections of the tree structures are connected via linking elements to a start section of at least the respective tree structure.

3. Data structure according to claim 1 or 2, wherein multiple occurrences of similar data elements of the second type (InfoType) are arranged in a self-ring comprising a set of data elements that are mutually connected through linking elements, and wherein one data element of the set is directly part of the respective tree structure.

4. Data structure according to any of the preceding claims, wherein data elements of a tree are provided with a number representative of the number of data elements arranged in the tree structure under said respective data element.

5. Data structure according to any of the preceding claims, wherein node between the data elements of the first and second type are formed by elements of a third type (InfoCell).

6. Data element for a database structure according to any of the preceding claims, comprising

a first pointer pair (LSR, RSR),

a second pointer pair (LHR, RHR), and

a third pointer pair (LVR, RVR).

7. Data element according to claim 4, further comprising an IF pointer (IF).

8. Method for optimising a database query, comprising the steps of

decomposing a search criterion in sections,

determining for each section a number of hits on the actual database structure,

selecting a database query path according to the determined number of hits for each section.