Systems and methods for optimization of transmission of real-time data via network labeling
US-2016315993-A1 · Oct 27, 2016 · US
US9689690B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9689690-B2 |
| Application number | US-201514797794-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jul 13, 2015 |
| Priority date | Jul 13, 2015 |
| Publication date | Jun 27, 2017 |
| Grant date | Jun 27, 2017 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A method and apparatus for indexing routes using similarity hashing. In an embodiment, a processor identifies a route wherein the route includes one or more links. The processor identifies a route attribute wherein the route attribute describes the route. The processor hashes the one or more links to determine a minimum link with a minimum hash value. The processor assigns the route attribute to the minimum link.
Opening claim text (preview).
I claim: 1. A method comprising: identifying a route, wherein the route includes one or more links; identifying a route attribute, wherein the route attribute describes the route; generating a hash value for each of the one or more links; identifying a minimum link of the one or more links with a minimum hash value; assigning the route attribute to the minimum link in an index containing a plurality of links for a roadway network; wherein the index is configured to provide a requested route that is described as the route attribute to a navigation device. 2. The method of claim 1 , further comprising: receiving a second route, wherein the second route includes one or more second links; generating hash values for each of the one or more second links; identifying a minimum second link which corresponds to a minimum second link hash value for the second route; and assigning the route attribute to the second route when the minimum second link is the minimum link. 3. The method of claim 1 , wherein the route attribute is a popularity of the route. 4. The method of claim 1 , wherein the route attribute is a scenic value of the route. 5. The method of claim 1 , wherein the route attribute is received from a user profile. 6. The method of claim 1 , wherein the route attribute is received from a social media application. 7. The method of claim 1 , wherein the index aggregates how often the route attribute is assigned to the minimum link as a route attribute value. 8. The method of claim 7 , further comprising: receiving a route attribute request regarding a third route; wherein the third route includes one or more third links; generating hash values for each of the third links; identifying a minimum third link hash value; matching the minimum third link hash value to a minimum third link; and transmitting the route attribute value that corresponds to the minimum third link in the index. 9. The method of claim 7 , further comprising: generating more than one indices by using more than one different hash functions to generate more than one minimum link hash value. 10. The method of claim 9 , further comprising: averaging a route attribute value from the more than one indices. 11. The method of claim 7 , further comprising: receiving a request including a route attribute, a starting point, and a destination; generating one or more candidate route; wherein the one or more candidate routes include the starting point and the destination; wherein the candidate routes include one or more candidate links; generating a hash value for each of the one or more candidate links; identifying a minimum candidate link with a minimum hash value for each candidate route; and transmitting a chosen candidate route that is the candidate route which has the minimum candidate link with a highest route attribute value found in the index. 12. The method of claim 11 , wherein the chosen candidate route is the candidate route which has the minimum candidate link with the second highest route attribute value found in the index. 13. The method of claim 11 , wherein each candidate route of the one or more candidate routes differ by one candidate link. 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 at least perform: identify a route including one or more links; identify a route attribute that describes the route; generate a hash value for each of the one or more links; identify a minimum link with a minimum hash value; and assign the route attribute to the minimum link in an index containing a plurality of links for a roadway network; wherein the index is configured to provide a requested route that is described as the route attribute to a navigation device. 15. The apparatus of claim 14 , wherein the index aggregates how often the route attribute was assigned to the minimum link as the route attribute value. 16. The apparatus of claim 14 , wherein the route attribute is a popularity of the route. 17. The apparatus of claim 15 , wherein the at least one memory and computer program code are configured to cause the apparatus to further perform: generate more than one indices by using more than one hash function to generate more than one minimum link hash value for each of the one or more links. 18. The apparatus of claim 17 , wherein the at least one memory and computer program code are configured to cause the apparatus to further perform: average a route attribute value from the more than one indices. 19. A non-transitory computer readable medium including instructions that when executed are operable to: receive a traveled route, wherein the traveled route includes one or more links; receive a route attribute from a navigation device that traveled the traveled route, wherein the route attribute describes the traveled route; generate a hash value for each of the one or more links; identify a minimum link with a minimum hash value; and assign the route attribute to the minimum link in an index containing a plurality of links for a roadway network; wherein the index is configured to provide a requested route that is described as the route attribute to a navigation device. 20. The non-transitory computer readable medium of claim 19 , wherein the route attribute is a popularity of the traveled route.
Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 (measuring distance traversed on the ground by a vehicle G01C22/00; control of position, course, altitude or attitude of vehicles G05D1/00; traffic control systems for road vehicles involving transmission of navigation instructions to the vehicle G08G1/0968) · CPC title
Physics · mapped topic
Physics · mapped topic
Fuel consumption; Energy use; Emission aspects · CPC title
Personalized, e.g. from learned user behaviour or user-defined profiles · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.