Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Processing search queries using a data structure

A data structure, search query technology, applied in the field of data structure

Active Publication Date: 2013-03-27
SKYPE
View PDF2 Cites 8 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] Although landmark-based algorithms do not provide strong theoretical guarantees about the quality of the approximation, they have been shown to perform well in practice scaling up to graphs with millions or even billions of edges with acceptable accuracy and Response times are under one second per query

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Processing search queries using a data structure
  • Processing search queries using a data structure
  • Processing search queries using a data structure

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0026] figure 2 is a schematic block diagram of a system for processing search queries. The system includes computer equipment 20 implementing two components. The first component 22 is a data structure, which is a memory or other form of computer storage that holds data in graphical form as further described herein. The second component is a processing function 24 that accesses the data structure 22 and uses it to process the search query. In operation, computer device 20 receives a query 26 in the form of a digital message, and computer device 20 operates to generate results 28 . The results can be utilized by the user results function 30 in a number of different ways. For example, user results function 30 may be a search function that receives other input along with results 28 and generates search results to the user. Alternatively, the user results function 30 may be a display that displays the results 28 directly to the user.

[0027] Each component 22, 24 may be imp...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

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.

Description

technical field [0001] The present invention relates to processing search queries, and in particular to generating data structures for processing queries in a network of interconnected nodes. Background technique [0002] There are many situations in which computer networks typically include a very large number of interconnected nodes. A communication network such as Skype represents a large social network for peer-to-peer communication. figure 1 is a schematic diagram of a small portion of a typical computer network. The network shown includes a number of nodes Ni. Each node may be associated with one or more physical computer devices as shown, for example in the case of node Ni the node is shown associated with a mobile device 2 , a PC 4 and a tablet 6 . Each node is associated with a single user, who in this case may use any of these computer devices to register or log in to a particular network. The nodes are shown interconnected by connections Ci. In the context of...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): G06F17/30
Inventor K.特雷特贾科夫L.加西亚-巴吕洛斯A.阿马斯-切尔文特斯J.维洛M.G.杜马斯
Owner SKYPE
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com