Computer implemented method and according computer program product for storing data sets in and retrieving data sets from a data storage system

• US 20050060302A1
• Filed: 08/27/2004
• Published: 03/17/2005
• Est. Priority Date: 08/27/2003
• Status: Active Grant

• Current Assignee: SAP SE
• Original Assignee: SAP AG (SAP SE)
• Inventors: Sauermann, Volker, Von Bergen, Axel, Schwarz, Arne
• Granted Patent: US 7,373,340 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/2237 Vectors, bitmaps or matrices
• CPC Class Codes: G06F 16/2246 Trees, e.g. B+trees
• CPC Class Codes: Y10S 707/99931 Database or file accessing
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching

Abstract

A computer implemented method for storing data sets in and retrieving data sets from a data storage system in a given number and sorted by a data attribute of the data set comprises

• • storing data sets each including one or more attributes in a plurality of binary tree structures (1), each of said binary tree structures (1) with their nodes (2) representing the entity of one of the data attributes of the data sets in a sorted manner, receiving a query for searching and returning data sets according to query conditions in said given number and sorted by a sort attribute,
  • accessing the binary tree structure (1) of said sort attribute,
  • serially traversing the nodes (2) of said binary tree structure (1) according to the sort attribute,
  • at each node (2) checking whether the data set associated to said node meets the query conditions and, if true, returning said data set, terminating said traversing when said given number of data sets is reached.

Claims

1. A computer implemented method for storing data sets in and retrieving data sets from a data storage system in a given number and sorted by a data attribute of the data set, comprising

storing data sets each including one or more attributes in a plurality of binary tree structures (1), each of said binary tree structures (1) with their nodes (2) representing the entity of one of the data attributes of the data sets in a sorted manner,

receiving a query for searching and returning data sets according to query conditions in said given number and sorted by a sort attribute,

accessing the binary tree structure (1) of said sort attribute,

serially traversing the nodes (2) of said binary tree structure (1) according to the sort attribute,

at each node (2) checking whether the data set associated to said node meets the query conditions and, if true, returning said data set,

terminating said traversing when said given number of data sets is reached.

2. A method according to claim 1, wherein for an ascendingly sorted return of data sets the accessed binary tree structure (1) is traversed beginning from the lowest-level node (21).

3. A method according to claim 1, wherein for an descendingly sorted return of data sets the accessed binary tree structure (1) is traversed beginning from the highest-level node (2h).

4. A method according to claim 1, wherein, in case that the sort attribute is part of the query conditions only these nodes (2) of the binary tree structure (1) representing the sort attribute are accessed which meet the query condition.

5. A method according to claim 1, wherein, in case that the sort attribute is not part of the query conditions nodes of the binary tree structure representing the sort attribute are accessed and checked as to whether or not their associated data sets meet the query conditions.

6. A method according to claim 1, wherein said checking whether the data set associated to said node (2eg) meets the query conditions is realized by executing the according logical operations.

7. A method according to claim 1, wherein said checking whether the data set associated to said node (2eg) meets the query conditions is realized by accessing an available result bitmap (7R) and looking up whether the according data set of said node (2eg) belongs to the hit list.

8. A method according to claim 1, wherein data sets to be returned are intermediately stored in a send buffer storage (10) until being returned in said given number to an interface means (11) of said data storage system.

9. A computer program product for storing data sets in and retrieving data sets from a data storage system in a given number and sorted by a data attribute of the data set, comprising a plurality of instructions that when loaded into a memory of the data storage system cause at least one processor of the data storage system to execute the steps of claim 1.

10. A computer program product for storing data sets in and retrieving data sets from a data storage system in a given number and sorted by a data attribute of the data set, comprising a plurality of instructions that when loaded into a memory of the data storage system cause at least one processor of the data storage system to execute the steps of claim 2.

11. A computer program product for storing data sets in and retrieving data sets from a data storage system in a given number and sorted by a data attribute of the data set, comprising a plurality of instructions that when loaded into a memory of the data storage system cause at least one processor of the data storage system to execute the steps of claim 3.

12. A computer program product for storing data sets in and retrieving data sets from a data storage system in a given number and sorted by a data attribute of the data set, comprising a plurality of instructions that when loaded into a memory of the data storage system cause at least one processor of the data storage system to execute the steps of claim 4.

13. A computer program product for storing data sets in and retrieving data sets from a data storage system in a given number and sorted by a data attribute of the data set, comprising a plurality of instructions that when loaded into a memory of the data storage system cause at least one processor of the data storage system to execute the steps of claim 5.

14. A computer program product for storing data sets in and retrieving data sets from a data storage system in a given number and sorted by a data attribute of the data set, comprising a plurality of instructions that when loaded into a memory of the data storage system cause at least one processor of the data storage system to execute the steps of claim 6.

15. A computer program product for storing data sets in and retrieving data sets from a data storage system in a given number and sorted by a data attribute of the data set, comprising a plurality of instructions that when loaded into a memory of the data storage system cause at least one processor of the data storage system to execute the steps of claim 7.

16. A computer program product for storing data sets in and retrieving data sets from a data storage system in a given number and sorted by a data attribute of the data set, comprising a plurality of instructions that when loaded into a memory of the data storage system cause at least one processor of the data storage system to execute the steps of claim 8.