METHOD AND APPARATUS FOR MULTIDIMENSIONAL DATA STORAGE AND FILE SYSTEM WITH A DYNAMIC ORDERED TREE STRUCTURE

• US 20140006411A1
• Filed: 06/29/2012
• Published: 01/02/2014
• Est. Priority Date: 06/29/2012
• Status: Active Grant

• Current Assignee: Nokia Technologies Oy (Nokia Corporation)
• Original Assignee: Nokia Corporation
• Inventors: Boldyrev, Sergey, Kalra, Pavandeep
• Granted Patent: US 8,930,374 B2
• Time in Patent Office: Days
• US Class Current: 707/741
• CPC Class Codes: G06F 16/2264 Multidimensional index structures
• CPC Class Codes: G06F 16/2272 Management thereof
• CPC Class Codes: G06F 16/2455 Query execution
• CPC Class Codes: G06F 16/29 Geographical information databases

Abstract

An approach is provided to determine one or more dynamic ordered tree structures and transition tree structures (e.g., based on one or more transitions of a device) to facilitate querying and/or accessing data stores. An apparatus and method determines to generate at least one index structure, determines to associate index objects of the generated index structure with one or more data objects of at least one data store, determines to generate at least one transition index structure based on the at least one generated index structure, and determines to associate the transition index structure with index objects corresponding to one or more data objects of at least one data store based on a transition of a device. Also, the method and apparatus determines to generate at least one query, and determines to generate at least one transition index structure where a current index structure to resolve the query is absent.

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:

at least one determination to generate at least one index structure;

at least one determination to associate index objects of the generated index structure with one or more data objects of at least one data store;

at least one determination to generate at least one transition index structure based on the at least one generated index structure; and

at least one determination to associate the transition index structure with index objects corresponding to one or more data objects of at least one data store based on a transition of a device.

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 generate at least one query for one or more data objects; and

at least one determination to generate the at least one transition index structure where a current index structure to resolve the query is absent.

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

4. A method of claim 3, wherein the tree structure is an R-tree and the index objects comprise map tiles.

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:

at least one determination to generate one or more state trajectories for the transition index structure.

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 to reduce states of the one or more state trajectories for the transition index structure.

7. A method of claim 6, 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 observe a history of index objects for one or more generated index structures to determine the transition index structure.

8. A method of claim 7, 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 extract at least one pattern of index objects, at least one sequence of index objects, or a combination thereof, to determine the transition index structure.

9. 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 store at least one index structure, at least one transition index structure, or a combination thereof, to generate a further transition index structure based on a further transition.

10. A method of claim 1, wherein the transition or further transition is triggered by a change in a status, a location, a criteria of a user of the device or a service provider for the device, or a combination thereof.

11. 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 to generate at least one index structure;

determine to associate index objects of the generated index structure with one or more data objects of at least one data store;

determine to generate at least one transition index structure based on the at least one generated index structure; and

determine to associate the transition index structure with index objects corresponding to one or more data objects of at least one data store based on a transition of a device.

12. An apparatus of claim 11, wherein the apparatus is further caused to:

determine to generate at least one query for one or more data objects; and

determine to generate the at least one transition index structure where a current index structure to resolve the query is absent.

13. An apparatus of claim 12, wherein the index structure and the transition index structure are each a tree structure and the one or more respective index objects are nodes of the tree structure.

14. An apparatus of claim 13, wherein the tree structure is an R-tree and the index objects comprise map tiles.

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

determine to generate one or more state trajectories for the transition index structure.

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

determine to reduce states of the one or more state trajectories for the transition index structure.

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

determine to observe a history of index objects for one or more generated index structures to determine the transition index structure.

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

determine to extract at least one pattern of index objects, at least one sequence of index objects, or a combination thereof, to determine the transition index structure.

19. An apparatus of claim 11, wherein the apparatus is further caused to:

determine to store at least one index structure, at least one transition index structure, or a combination thereof, to generate a further transition index structure based on a further transition.

20. An apparatus of claim 11, wherein the transition or further transition is triggered by a change in a status, a location, a criteria of a user of the device or a service provider for the device, or a combination thereof.

21-48. -48. (canceled)