The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Aug. 27, 2013

Filed:

Dec. 30, 2011
Applicants:

Konstantin Tretjakov, Tallinn, EE;

Luciano García-bañuelos, Tartu, EE;

Abel Armas-cervantes, Tartu, EE;

Jaak Vilo, Tartu, EE;

Marlon G. Dumas, Tartu, EE;

Inventors:

Konstantin Tretjakov, Tallinn, EE;

Luciano García-Bañuelos, Tartu, EE;

Abel Armas-Cervantes, Tartu, EE;

Jaak Vilo, Tartu, EE;

Marlon G. Dumas, Tartu, EE;

Assignee:

Skype, Dublin, IE;

Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G06F 7/00 (2006.01);
U.S. Cl.
CPC ...
Abstract

According to an embodiment, there is provided a method of generating a data structure stored in computer memory for processing a search query in a network of interconnected nodes, wherein the method comprises selecting landmark nodes by the following steps and storing the selected landmark nodes in the data structure: sampling from the network nodes a first sample of vertex pairs, computing the shortest path for each vertex pair, each shortest path comprising a set of vertices between each vertex in the vertex pair; identifying a first landmark node which occurs in more of the shortest paths more often than any other vertex; removing from the network vertices shortest paths including the first landmark node and identifying a second landmark node which occurs in more of the remaining shortest paths than any other remaining vertex.


Find Patent Forward Citations

Loading…