METHOD AND APPARATUS FOR PROVIDING A RANGE ORDERED TREE STRUCTURE

• US 20120117067A1
• Filed: 10/31/2011
• Published: 05/10/2012
• Est. Priority Date: 10/29/2010
• Status: Abandoned Application

• Current Assignee: Navteq B.V.
• Original Assignee: Navteq North America LLC (Nokia Corporation), Nokia Corporation
• Inventors: Yakubovich, Alexey, Kosuru, Yekesa
• Application Number:
  US13/285,818
• Publication Number:
  US 20120117067A1
• Time in Patent Office: Days
• US Class Current: 707/737
• CPC Class Codes: G06F 16/2246 Trees, e.g. B+trees

Abstract

An approach is provided for creating a range ordered tree structure. A tree index platform determines one or more ranges for grouping one or more data objects of a key-value store. Next, the tree index platform determines to specify the one or more ranges in one or more respective index objects of a data structure. Then, the tree index platform determines to associate the data structure with the key-value store.

Claims

1. A method comprising facilitating a processing of and/or processing (1) data and/or (2) information and/or (3) at least one signal, the (1) data and/or (2) information and/or (3) at least one signal based, at least in part, on the following:

one or more ranges for grouping one or more data objects of a data store;

at least one determination to specify the one or more ranges in one or more respective index objects of an index structure; and

at least one determination to associate the index structure with the data store.

2. A method of claim 1, wherein the (1) data and/or (2) information and/or (3) at least one signal are further based, at least in part, on the following:

at least one determination to order the one or respective index objects based, at least in part, on the one or more ranges,

wherein the one or more ranges are described with respect to one or more parameters associated with the one or more data objects.

3. A method of claim 2, wherein the index structure is a tree structure and the one or more respective index objects are nodes of the tree structure.

4. A method of claim 2, wherein the one or more parameters are associated with respective levels of the tree structure.

5. A method of claim 1, wherein the (1) data and/or (2) information and/or (3) at least one signal are further based, at least in part, on the following:

a request for performing a query of the data store, the query specifying at least in part one or more target ranges; and

in response to the request, at least one determination to traverse the index structure to determine at least one of the one or more respective index objects based, at least in part, on the one or more ranges associated with the at least one respective index objects and the one or more target ranges.

6. A method of claim 5, wherein the (1) data and/or (2) information and/or (3) at least one signal are further based, at least in part, on the following:

at least one determination of a group of the one or more data objects based, at least in part, on the at least one respective index object; and

at least one determination to provide the group as a result of the query.

7. A method of claim 5, wherein the (1) data and/or (2) information and/or (3) at least one signal are further based, at least in part, on the following:

at least one determination to present the result in a user interface.

8. A method of claim 5, wherein the (1) data and/or (2) information and/or (3) at least one signal are further based, at least in part, on the following:

one or more keys associated with the at least one respective index object;

wherein the at least one determination of the group of the one or more data objects is based, at least in part, on the one or more keys.

9. A method of claim 8, wherein the one or more keys include one or more primary keys, one or more secondary keys, or a combination thereof

10. A method of claim 9, wherein one or more secondary keys are generated by applying a hash function on the one or more primary keys, one or more parameters associated with the one or more objects, or a combination thereof.

11. A method of claim 1, further comprising:

determining a distribution of the one or more data objects in relation to the one or more respective index objects;

determining a comparison of the distribution against predetermined criteria;

determining to rebalance at least one of the one or more respective index objects based at least in part the distribution, the comparison, or a combination thereof.

12. A method of claim 11, wherein the rebalancing of the at least one of the one or more respective index objects occurs in substantially real-time without user intervention.

13. A method of claim 11, wherein the determining to redefine the at least one respective index object comprises at least one of:

determining to join a plurality of the one or more respective index objects into the at least one respective index object; and

determining to split the at least one respective index object.

14. An apparatus comprising:

at least one processor; and

at least one memory including computer program code for one or more programs, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus to perform at least the following,

determine one or more ranges for grouping one or more data objects of a data store;

determine to specify the one or more ranges in one or more respective index objects of an index structure; and

determine to associate the index structure with the data store.

15. An apparatus of claim 14, wherein the apparatus is further caused to:

determine to order the one or respective index objects based, at least in part, on the one or more ranges,

wherein the one or more ranges are described with respect to one or more parameters associated with the one or more data objects.

16. An apparatus of claim 14, wherein the apparatus is further caused to:

receive a request for performing a query of the data store, the query specifying at least in part one or more target ranges; and

in response to the request, determine to traverse the index structure to determine at least one of the one or more respective index objects based, at least in part, on the one or more ranges associated with the at least one respective index objects and the one or more target ranges.

17. An apparatus of claim 16, wherein the apparatus is further caused to:

determining a group of the one or more data objects based, at least in part, on the at least one respective index object; and

determining to provide the group as a result of the query.

18. A method comprising facilitating access to at least one interface configured to allow access to at least one service, the at least one service configured to perform at least the following:

determining one or more ranges for grouping one or more data objects of a data store;

determining to specify the one or more ranges in one or more respective index objects of an index structure; and

determining to associate the index structure with the data store.

19. A method of claim 18, wherein the at least one service is configured to further perform:

determining to order the one or respective index objects based, at least in part, on the one or more ranges,

wherein the one or more ranges are described with respect to one or more parameters associated with the one or more data objects.

20. A method of claim 18, wherein the at least one service is configured to further perform:

receiving a request for performing a query of the data store, the query specifying at least in part one or more target ranges; and

in response to the request, determining to traverse the index structure to determine at least one of the one or more respective index objects based, at least in part, on the one or more ranges associated with the at least one respective index objects and the one or more target ranges.