Data object identifiers

• US 20080281855A1
• Filed: 05/07/2007
• Published: 11/13/2008
• Est. Priority Date: 05/07/2007
• Status: Active Grant

• Current Assignee: SAP SE
• Original Assignee: SAP AG (SAP SE)
• Inventors: Batzdorf, Stefan, Forstmann, Gerd G., Lange, Stephan J.
• Granted Patent: US 7,860,835 B2
• Time in Patent Office: Days
• US Class Current: 707/102
• CPC Class Codes: G06F 16/221 Column-oriented storage; Management thereof
• CPC Class Codes: G06F 16/289 Object oriented databases
• CPC Class Codes: G06F 9/4493 Object persistence

Abstract

A short identifier can be generated for each of a plurality of data objects. Each short identifier can include a first portion characterizing a sort order and a second portion characterizing a composite component identifier associated with the corresponding data object. The sort order can characterize a relationship (e.g., grouping, etc.) among at least a subset of the plurality of data objects. After the short identifiers have been generated, they can be stored in a database to enable queries of the database containing a short identifier to return data contained within the corresponding data objects. Related systems, apparatus, methods, and/or articles are also described.

Claims

1. An article comprising a tangibly-embodied machine-readable medium operable to cause one or more machines to result in operations comprising:

generating a short identifier for each of a plurality of data objects, each short identifier comprising a first portion characterizing a sort order and a second portion characterizing a composite component identifier associated with the corresponding data object, the sort order characterizing a relationship among at least a subset of the plurality of data objects; and

storing the generated short identifiers in a database to enable queries of the database containing a short identifier to return data contained within the corresponding data objects.

2. An article as in claim 1, wherein the second portion comprises a hash of at least a portion of the composite component identifier.

3. An article as in claim 1, wherein the second portion comprises at least a portion of the composite component identifier.

4. An article as in claim 1, wherein the sort order is arranged so that adjacent objects are adjacent in the sort order.

5. An article as in claim 1, wherein the short identifier is a fixed length byte array.

6. An article as in claim 1, wherein the composite component identifier characterizes a plurality of components within the corresponding data object.

7. An article as in claim 6, wherein two or more of the plurality of components characterized by the composite component identifier are mapped to bytes of the first portion of the short identifier in order ranging from most significant to least significant sort criterion.

8. An article as in claim 6, wherein two or more of the plurality of components characterized by the composite component identifier are mapped to bytes of the first portion of the short identifier according to a hierarchy of the components.

9. An article as in claim 1, wherein each of the data objects include a counter designation, and wherein the sort order is arranged so that data objects having adjacent counter designations are adjacent in the sort order.

10. An article as in claim 1, wherein the first portion comprises at least a portion of sort criteria.

11. An article as in claim 1, wherein the first portion comprises a hash of at least a portion of sort criteria.

12. An article as in claim 1, wherein the first portion comprises a concatenation of hashes for components defined by the corresponding data object.

13. A computer-implemented method comprising:

generating a short identifier for each of a plurality of data objects, each short identifier comprising a first portion characterizing a sort order and a second portion characterizing a composite component identifier associated with the corresponding data object, the sort order characterizing a relationship among at least a subset of the plurality of data objects; and

storing the generated short identifiers in a database to enable queries of the database containing a short identifier to return data contained within the corresponding data objects.

14. A method as in claim 13, wherein the second portion comprises a hash of at least a portion of the composite component identifier.

15. A method as in claim 13, wherein the second portion comprises at least a portion of the composite component identifier.

16. A method as in claim 13, wherein the sort order is arranged so that adjacent objects are adjacent in the sort order.

17. A method as in claim 13, further comprising mapping two or more components characterized by the composite component identifier to bytes of the first portion of the short identifier in order ranging from most significant to least significant sort criterion.

18. A method as in claim 13, further comprising mapping two or more of the plurality of components characterized by the composite component identifier to bytes of the first portion of the short identifier according to a hierarchy of the components.

19. An article comprising a tangibly-embodied machine-readable medium operable to cause one or more machines to result in operations comprising:

generating a short identifier for each of a plurality of data objects, each short identifier comprising a first portion that identifies a grouping for each object and a second portion including a hash of a composite component identifier associated with the corresponding data object, the sort order characterizing a relationship among at least a subset of the plurality of data objects; and

storing the generated short identifiers in a database according to the corresponding groupings to enable queries of the database containing a short identifier to return data contained within the corresponding data objects.

20. An article as in claim 19, wherein the first portion comprises a hash characterizing the grouping.