Patentable/Patents/US-9213716
US-9213716

Hierarchical indicies

PublishedDecember 15, 2015
Assigneenot available in USPTO data we have
Inventorsnot available in USPTO data we have
Technical Abstract

Data records of a data set can be stored in multiple main part fragments, each of which includes a subset of the set of data records. A relative age can be assigned to each main part fragment, and a fragment-specific index segment can be created for a newest of the main part fragments. The fragment-specific index segment can provide a lookup ability for logical identifiers of data records in just the newest of the main part fragments. A multi-fragment index segment can span two or more older main fragments. The multi-fragment index segment can provide a lookup ability for logical identifiers of data records in the two or more older main part fragments.

Patent Claims
19 claims

Legal claims defining the scope of protection, as filed with the USPTO.

1

1. A computer program product comprising a machine-readable medium storing instructions that, when executed by at least one programmable processor, cause the at least one programmable processor to perform operations comprising: storing, in a plurality of main part fragments, a plurality of data records that comprise a data set, each main part fragment comprising a subset of the set of data records; assigning a relative age to each main part fragment of the plurality of main part fragments; creating, for a newest of the main part fragments, a fragment-specific index segment, the fragment-specific index segment providing a lookup ability for logical identifiers of data records in just the newest of the main part fragments; and providing, for two or more older main fragments, a multi-fragment index segment that spans the two or more older main fragments, the multi-fragment index segment providing a lookup ability for logical identifiers of data records in the two or more older main part fragments.

2

2. The computer program product as in claim 1 , wherein at least one of the two or more older main fragments is a closed main fragment.

3

3. The computer program product as in claim 2 , wherein operations further comprise: reorganizing the closed main fragment; and updating the multi-fragment index segment in response to the reorganizing.

4

4. The computer program product as in claim 3 , wherein the operations further comprise: updating row indices in leaf nodes of the multi-fragment index segment to point to new row indices after the reorganizing.

5

5. The computer program product as in claim 1 , wherein the logical identifiers comprise globally unique RowID values for each data record in each main part fragment.

6

6. The computer program product as in claim 1 , wherein the operations further comprise providing for three or more additional main fragments, an additional multi-fragment index segment that spans the three or more additional main fragments, the additional multi-fragment index segment providing a lookup ability for logical identifiers of data records in the three or more additional main part fragments, the three or more additional main part fragments being older than the two or more older main fragments.

7

7. A system comprising: at least one programmable processor; and a machine-readable medium storing instructions that, when executed by at least one programmable processor, cause the at least one programmable processor to perform operations comprising: storing, in a plurality of main part fragments, a plurality of data records that comprise a data set, each main part fragment comprising a subset of the set of data records; assigning a relative age to each main part fragment of the plurality of main part fragments; creating, for a newest of the main part fragments, a fragment-specific index segment, the fragment-specific index segment providing a lookup ability for logical identifiers of data records in just the newest of the main part fragments; and providing, for two or more older main fragments, a multi-fragment index segment that spans the two or more older main fragments, the multi-fragment index segment providing a lookup ability for logical identifiers of data records in the two or more older main part fragments.

8

8. The system as in claim 7 , wherein at least one of the two or more older main fragments is a closed main fragment.

9

9. The system as in claim 8 , wherein operations further comprise: reorganizing the closed main fragment; and updating the multi-fragment index segment in response to the reorganizing.

10

10. The system as in claim 9 , wherein the operations further comprise: updating row indices in leaf nodes of the multi-fragment index segment to point to new row indices after the reorganizing.

11

11. The system as in claim 7 , wherein the logical identifiers comprise globally unique RowID values for each data record in each main part fragment.

12

12. The system as in claim 7 , wherein the operations further comprise providing for three or more additional main fragments, an additional multi-fragment index segment that spans the three or more additional main fragments, the additional multi-fragment index segment providing a lookup ability for logical identifiers of data records in the three or more additional main part fragments, the three or more additional main part fragments being older than the two or more older main fragments.

13

13. computer-implemented method comprising: storing, in a plurality of main part fragments, a plurality of data records that comprise a data set, each main part fragment comprising a subset of the set of data records; assigning a relative age to each main part fragment of the plurality of main part fragments; creating, for a newest of the main part fragments, a fragment-specific index segment, the fragment-specific index segment providing a lookup ability for logical identifiers of data records in just the newest of the main part fragments; and providing, for two or more older main fragments, a multi-fragment index segment that spans the two or more older main fragments, the multi-fragment index segment providing a lookup ability for logical identifiers of data records in the two or more older main part fragments.

14

14. The computer-implemented method as in claim 13 , wherein at least one of the two or more older main fragments is a closed main fragment.

15

15. The computer-implemented method as in claim 14 , further comprising: reorganizing the closed main fragment; and updating the multi-fragment index segment in response to the reorganizing.

16

16. The computer-implemented method as in claim 15 , further comprising: updating row indices in leaf nodes of the multi-fragment index segment to point to new row indices after the reorganizing.

17

17. The computer-implemented method as in claim 13 , wherein the logical identifiers comprise globally unique RowID values for each data record in each main part fragment.

18

18. The computer-implemented method as in claim 13 , further comprising: providing for three or more additional main fragments, an additional multi-fragment index segment that spans the three or more additional main fragments, the additional multi-fragment index segment providing a lookup ability for logical identifiers of data records in the three or more additional main part fragments, the three or more additional main part fragments being older than the two or more older main fragments.

19

19. The computer-implemented method as in claim 13 , wherein at least one of the storing, the assigning, the creating, and the providing is performed by a system comprising one or more programmable processors.

Classification Codes (CPC)

Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.

Patent Metadata

Filing Date

March 12, 2013

Publication Date

December 15, 2015

Want to explore more patents?

Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.

Citation & reuse

Analysis on this page is generated by Patentable — an AI-powered patent intelligence platform. AI-generated summaries, explanations, and analysis may be reused with attribution and a visible link back to the canonical URL below. Patent abstracts and claims are USPTO public domain.

Cite as: Patentable. “Hierarchical indicies” (US-9213716). https://patentable.app/patents/US-9213716

© 2026 Patentable. All rights reserved.

Patentable is a research and drafting-assistant tool, not a law firm, and does not provide legal advice. Documents we generate are drafts for review by a licensed patent attorney.