Updates for Navigational Map Data Organized in Lists

• US 20160188641A1
• Filed: 12/29/2014
• Published: 06/30/2016
• Est. Priority Date: 12/29/2014
• Status: Active Grant

• Current Assignee: HERE Global B.V. (Nokia Corporation)
• Original Assignee: HERE Global B.V. (Nokia Corporation)
• Inventors: Pfeifle, Martin
• Granted Patent: US 9,798,740 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/2219 Large Object storage; Management thereof
• CPC Class Codes: G06F 16/2372 Updates performed during offline database operations
• CPC Class Codes: G06F 16/2379 Updates performed during online database operations; commit processing
• CPC Class Codes: G06F 16/29 Geographical information databases
• CPC Class Codes: G06F 8/658 Incremental updates; Differential updates

Abstract

A geographic database may include binary data including list portions and/or non-list portions. A computing device may identify a list in a first binary large object (BLOB) for navigation data including road segments and road attributes. The first BLOB is segmented based on the byte list portion into a plurality of elements each having a predetermined size. The computing device may define a series of operations for the multiple elements to transform the first BLOB to a second BLOB.

Claims

1. A method comprising:

identifying, using a processor, a list portion in a first binary large object (BLOB) for navigation data including road segments, road attributes, or map polygons;

segmenting, in response to the list portion, the first BLOB into a plurality of elements each having a predetermined size; and

defining a series of operations for the plurality of elements to transform the first BLOB to a second BLOB.

2. The method of claim 1, wherein the list portion includes a byte misalignment caused by a nonstandard number of bits.

3. The method of claim 2, wherein the nonstandard number of bits is indivisible by 8.

4. The method of claim 1, wherein the series of operations includes an insert operation, a delete operation, and a move operation.

5. The method of claim 1, further comprising:

storing the series of operations along with a complex data structure in a datascript.

6. The method of claim 5, wherein the datascript is stored in a navigation patch file.

7. The method of claim 5, wherein the datascript includes an add command that adds dummy bits to the datascript.

8. The method of claim 1, further comprising:

dividing the first BLOB into a first portion including the byte misalignment and a second portion having byte aligned data; and

performing a binary different calculation on the second portion having byte aligned data.

9. The method of claim 8, further comprising:

sending an update for a navigation database include a result of the binary difference and the series of operations for the plurality of elements.

10. 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 at least perform;

identify a list portion in a first binary large object (BLOB) for navigation data include road segments and road attributes;

divide the first BLOB into a plurality of elements each having a predetermined size; and

define a series of operations for the plurality of elements to transform the first BLOB to a second BLOB.

11. The apparatus of claim 10, wherein the list portion includes a byte misalignment caused by a nonstandard number of bits.

12. The apparatus of claim 11, wherein the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus to at least perform:

divide the first BLOB into the list portion including the byte misalignment and a second portion having byte aligned data; and

perform a binary different calculation on the second portion having byte aligned data.

13. The apparatus of claim 11, wherein the nonstandard number of bits is a number not divisible by 8.

14. The apparatus of claim 10, wherein the series of operations includes an insert operation, a delete operation, and a move operation.

15. The apparatus of claim 10, wherein the series of operations are stored along with a complex data structure including geographic data in a datascript.

16. The apparatus of claim 15, wherein the datascript includes an add command that adds dummy bits to the datascript.

17. A non-transitory computer readable medium including instructions that when executed are operable to:

identify one or more lists in a first portion of a binary large object (BLOB) for navigation data including, map polygons, road segments or road attributes;

identify a second portion of the BLOB;

divide the first portion of the BLOB into a plurality of elements each having a predetermined size;

perform a binary difference operation on the second portion of the BLOB;

define a series of operations for the plurality of elements to update the BLOB; and

generate an update script including a result of the binary difference operation and the series of operations.

18. The non-transitory computer readable medium of claim 17, wherein the first portion is caused by a number of bits that is not divisible by 8, and the second portion is caused by a number of bits that is divisible by 8.

19. The non-transitory computer readable medium of claim 17, wherein the series of operations includes an insert operation, a delete operation, and a move operation.

20. The non-transitory computer readable medium of claim 17, the instructions when executed are operable to:

determining a quantity of dummy bits to add to the update script.