Patent Grant
10102245
This disclosure generally relates to social graphs and performing searches for objects within a social-networking environment.
A social-networking system, which may include a social-networking website, may enable its users (such as persons or organizations) to interact with it and with each other through it. The social-networking system may, with input from a user, create and store in the social-networking system a user profile associated with the user. The user profile may include demographic information, communication-channel information, and information on personal interests of the user. The social-networking system may also, with input from a user, create and store a record of relationships of the user with other users of the social-networking system, as well as provide services (e.g. wall posts, photo-sharing, event organization, messaging, games, or advertisements) to facilitate social interaction between or among users.
The social-networking system may send over one or more networks content or messages related to its services to a mobile or other computing device of a user. A user may also install software applications on a mobile or other computing device of the user for accessing a user profile of the user and other data within the social-networking system. The social-networking system may generate a personalized set of content objects to display to a user, such as a newsfeed of aggregated stories of other users connected to the user.
Social-graph analysis views social relationships in terms of network theory consisting of nodes and edges. Nodes represent the individual actors within the networks, and edges represent the relationships between the actors. The resulting graph-based structures are often very complex. There can be many types of nodes and many types of edges for connecting nodes. In its simplest form, a social graph is a map of all of the relevant edges between all the nodes being studied.
In particular embodiments, a user of a social-networking system may search for objects associated with the system using a search queries.
In particular embodiments, in response to a search query input received from a user, the social-networking system may accessing one or more verticals to search for objects that match the character string of the search query input. The number of verticals accessed in response to the search query input may vary based on the length of the character string. For shorter character strings, the character string may match a large number of objects. Consequently, processing a relatively short character string may be an inefficient. In order to improve the efficiency of the query process, only a limited number of verticals may be searched for matches to shorter character strings. However, as the user inputs additional characters, additional verticals may be searched. As the search query increases in length, fewer objects will match the query, and thus it may become more efficient to search a larger number of verticals for matches to the longer character string. Based on the identified objects, the social-networking system may then send references to those objects for display to the user, for example in a drop-down menu associated with the query field. The querying user may then select among the references to indicate that the object corresponding to the reference should be retrieved by the social-networking system. By accessing a variable number of verticals as described herein, the efficiency of the query process may be improved by limiting the number of verticals that are search in response to relatively short search queries that may match a large number of objects, and by expanding the number and type of verticals searches as the query becomes more refined.
System Overview
This disclosure contemplates any suitable network 110. As an example and not by way of limitation, one or more portions of network 110 may include an ad hoc network, an intranet, an extranet, a virtual private network (VPN), a local area network (LAN), a wireless LAN (WLAN), a wide area network (WAN), a wireless WAN (WWAN), a metropolitan area network (MAN), a portion of the Internet, a portion of the Public Switched Telephone Network (PSTN), a cellular telephone network, or a combination of two or more of these. Network 110 may include one or more networks 110.
Links 150 may connect client system 130, social-networking system 160, and third-party system 170 to communication network 110 or to each other. This disclosure contemplates any suitable links 150. In particular embodiments, one or more links 150 include one or more wireline (such as for example Digital Subscriber Line (DSL) or Data Over Cable Service Interface Specification (DOCSIS)), wireless (such as for example Wi-Fi or Worldwide Interoperability for Microwave Access (WiMAX)), or optical (such as for example Synchronous Optical Network (SONET) or Synchronous Digital Hierarchy (SDH)) links. In particular embodiments, one or more links 150 each include an ad hoc network, an intranet, an extranet, a VPN, a LAN, a WLAN, a WAN, a WWAN, a MAN, a portion of the Internet, a portion of the PSTN, a cellular technology-based network, a satellite communications technology-based network, another link 150, or a combination of two or more such links 150. Links 150 need not necessarily be the same throughout network environment 100. One or more first links 150 may differ in one or more respects from one or more second links 150.
In particular embodiments, client system 130 may be an electronic device including hardware, software, or embedded logic components or a combination of two or more such components and capable of carrying out the appropriate functionalities implemented or supported by client system 130. As an example and not by way of limitation, client system 130 may include a computer system such as a desktop computer, notebook or laptop computer, netbook, a tablet computer, e-book reader, GPS device, camera, personal digital assistant (PDA), handheld electronic device, cellular telephone, smartphone, other suitable electronic device, or any suitable combination thereof. This disclosure contemplates any suitable client systems 130. Client system 130 may enable a network user at client system 130 to access network 110. Client system 130 may enable its user to communicate with other users at other client systems 130.
In particular embodiments, client system 130 may include a web browser 132, such as MICROSOFT INTERNET EXPLORER, GOOGLE CHROME or MOZILLA FIREFOX, and may have one or more add-ons, plug-ins, or other extensions, such as TOOLBAR or YAHOO TOOLBAR. A user at client system 130 may enter a Uniform Resource Locator (URL) or other address directing the web browser 132 to a particular server (such as server 162, or a server associated with third-party system 170), and the web browser 132 may generate a Hyper Text Transfer Protocol (HTTP) request and communicate the HTTP request to server. The server may accept the HTTP request and communicate to client system 130 one or more Hyper Text Markup Language (HTML) files responsive to the HTTP request. Client system 130 may render a webpage based on the HTML files from the server for presentation to the user. This disclosure contemplates any suitable webpage files. As an example and not by way of limitation, webpages may render from HTML files, Extensible Hyper Text Markup Language (XHTML) files, or Extensible Markup Language (XML) files, according to particular needs. Such pages may also execute scripts such as, for example and without limitation, those written in JAVASCRIPT, JAVA, MICROSOFT SILVERLIGHT, combinations of markup language and scripts such as AJAX (Asynchronous JAVASCRIPT and XML), and the like. Herein, reference to a webpage encompasses one or more corresponding webpage files (which a browser may use to render the webpage) and vice versa, where appropriate.
In particular embodiments, social-networking system 160 may be a network-addressable computing system that can host an online social network. Social-networking system 160 may generate, store, receive, and send social-networking data, such as, for example, user-profile data, concept-profile data, social-graph information, or other suitable data related to the online social network. Social-networking system 160 may be accessed by the other components of network environment 100 either directly or via network 110. In particular embodiments, social-networking system 160 may include one or more servers 162. Each server 162 may be a unitary server or a distributed server spanning multiple computers or multiple datacenters. Servers 162 may be of various types, such as, for example and without limitation, web server, news server, mail server, message server, advertising server, file server, application server, exchange server, database server, proxy server, another server suitable for performing functions or processes described herein, or any combination thereof. In particular embodiments, each server 162 may include hardware, software, or embedded logic components or a combination of two or more such components for carrying out the appropriate functionalities implemented or supported by server 162. In particular embodiments, social-networking system 164 may include one or more data stores 164. Data stores 164 may be used to store various types of information. In particular embodiments, the information stored in data stores 164 may be organized according to specific data structures. In particular embodiments, each data store 164 may be a relational, columnar, correlation, or other suitable database. Although this disclosure describes or illustrates particular types of databases, this disclosure contemplates any suitable types of databases. Particular embodiments may provide interfaces that enable client system 130, social-networking system 160, or third-party system 170 to manage, retrieve, modify, add, or delete, the information stored in data store 164.
In particular embodiments, social-networking system 160 may store one or more social graphs in one or more data stores 164. In particular embodiments, a social graph may include multiple nodes—which may include multiple user nodes (each corresponding to a particular user) or multiple concept nodes (each corresponding to a particular concept)—and multiple edges connecting the nodes. Social-networking system 160 may provide users of the online social network the ability to communicate and interact with other users. In particular embodiments, users may join the online social network via social-networking system 160 and then add connections (i.e., relationships) to a number of other users of social-networking system 160 whom they want to be connected to. Herein, the term “friend” may refer to any other user of social-networking system 160 with whom a user has formed a connection, association, or relationship via social-networking system 160.
In particular embodiments, social-networking system 160 may provide users with the ability to take actions on various types of items or objects, supported by social-networking system 160. As an example and not by way of limitation, the items and objects may include groups or social networks to which users of social-networking system 160 may belong, events or calendar entries in which a user might be interested, computer-based applications that a user may use, transactions that allow users to buy or sell items via the service, interactions with advertisements that a user may perform, or other suitable items or objects. A user may interact with anything that is capable of being represented in social-networking system 160 or by an external system of third-party system 170, which is separate from social-networking system 160 and coupled to social-networking system 160 via a network 110.
In particular embodiments, social-networking system 160 may be capable of linking a variety of entities. As an example and not by way of limitation, social-networking system 160 may enable users to interact with each other as well as receive content from third-party systems 170 or other entities, or to allow users to interact with these entities through an application programming interfaces (API) or other communication channels.
In particular embodiments, third-party system 170 may include one or more types of servers, one or more data stores, one or more interfaces, including but not limited to APIs, one or more web services, one or more content sources, one or more networks, or any other suitable components, e.g., that servers may communicate with. A third-party system 170 may be operated by a different entity from an entity operating social-networking system 160. In particular embodiments, however, social-networking system 160 and third-party systems 170 may operate in conjunction with each other to provide social-networking services to users of social-networking system 160 or third-party systems 170. In this sense, social-networking system 160 may provide a platform, or backbone, which other systems, such as third-party systems 170, may use to provide social-networking services and functionality to users across the Internet.
In particular embodiments, third-party system 170 may include a third-party content object provider. A third-party content object provider may include one or more sources of content objects, which may be communicated to client system 130. As an example and not by way of limitation, content objects may include information regarding things or activities of interest to the user, such as, for example, movie show times, movie reviews, restaurant reviews, restaurant menus, product information and reviews, or other suitable information. As another example and not by way of limitation, content objects may include incentive content objects, such as coupons, discount tickets, gift certificates, or other suitable incentive objects.
In particular embodiments, social-networking system 160 also includes user-generated content objects, which may enhance a user's interactions with social-networking system 160. User-generated content may include anything a user can add, upload, send, or “post” to social-networking system 160. As an example and not by way of limitation, a user communicates posts to social-networking system 160 from client system 130. Posts may include data such as status updates or other textual data, location information, photos, videos, links, music or other similar data or media. Content may also be added to social-networking system 160 by a third-party through a “communication channel,” such as a newsfeed or stream.
In particular embodiments, social-networking system 160 may include a variety of servers, sub-systems, programs, modules, logs, and data stores. In particular embodiments, social-networking system 160 may include one or more of the following: a web server, action logger, API-request server, relevance-and-ranking engine, content-object classifier, notification controller, action log, third-party-content-object-exposure log, inference module, authorization/privacy server, search module, ad-targeting module, user-interface module, user-profile store, connection store, third-party content store, or location store. Social-networking system 160 may also include suitable components such as network interfaces, security mechanisms, load balancers, failover servers, management-and-network-operations consoles, other suitable components, or any suitable combination thereof. In particular embodiments, social-networking system 160 may include one or more user-profile stores for storing user profiles. A user profile may include, for example, biographic information, demographic information, behavioral information, social information, or other types of descriptive information, such as work experience, educational history, hobbies or preferences, interests, affinities, or location. Interest information may include interests related to one or more categories. Categories may be general or specific. As an example and not by way of limitation, if a user “likes” an article about a brand of shoes the category may be the brand, or the general category of “shoes” or “clothing.” A connection store may be used for storing connection information about users. The connection information may indicate users who have similar or common work experience, group memberships, hobbies, educational history, or are in any way related or share common attributes. The connection information may also include user-defined connections between different users and content objects (both internal and external). A web server may be used for linking social-networking system 160 to one or more client systems 130 or one or more third-party system 170 via network 110. The web server may include a mail server or other messaging functionality for receiving and routing messages between social-networking system 160 and one or more client systems 130. An API-request server may allow third-party system 170 to access information from social-networking system 160 by calling one or more APIs. An action logger may be used to receive communications from a web server about a user's actions on or off social-networking system 160. In conjunction with the action log, a third-party-content-object log may be maintained of user exposures to third-party-content objects. A notification controller may provide information regarding content objects to client system 130. Information may be pushed to client system 130 as notifications, or information may be pulled from client system 130 responsive to a request received from client system 130. Authorization servers may be used to enforce one or more privacy settings of the users of social-networking system 160. A privacy setting of a user determines how particular information associated with a user can be shared. The authorization server may allow users to opt in or opt out of having their actions logged by social-networking system 160 or shared with other systems (e.g., third-party system 170), such as, for example, by setting appropriate privacy settings. Third-party-content-object stores may be used to store content objects received from third parties, such as third-party system 170. Location stores may be used for storing location information received from client systems 130 associated with users. Advertisement-pricing modules may combine social information, the current time, location information, or other suitable information to provide relevant advertisements, in the form of notifications, to a user.
Social Graphs
In particular embodiments, a user node 202 may correspond to a user of social-networking system 160. As an example and not by way of limitation, a user may be an individual (human user), an entity (e.g., an enterprise, business, or third-party application), or a group (e.g., of individuals or entities) that interacts or communicates with or over social-networking system 160. In particular embodiments, when a user registers for an account with social-networking system 160, social-networking system 160 may create a user node 202 corresponding to the user, and store the user node 202 in one or more data stores. Users and user nodes 202 described herein may, where appropriate, refer to registered users and user nodes 202 associated with registered users. In addition or as an alternative, users and user nodes 202 described herein may, where appropriate, refer to users that have not registered with social-networking system 160. In particular embodiments, a user node 202 may be associated with information provided by a user or information gathered by various systems, including social-networking system 160. As an example and not by way of limitation, a user may provide his or her name, profile picture, contact information, birth date, sex, marital status, family status, employment, education background, preferences, interests, or other demographic information. In particular embodiments, a user node 202 may be associated with one or more data objects corresponding to information associated with a user. In particular embodiments, a user node 202 may correspond to one or more webpages.
In particular embodiments, a concept node 204 may correspond to a concept. As an example and not by way of limitation, a concept may correspond to a place (such as, for example, a movie theater, restaurant, landmark, or city); a website (such as, for example, a website associated with social-network system 160 or a third-party website associated with a web-application server); an entity (such as, for example, a person, business, group, sports team, or celebrity); a resource (such as, for example, an audio file, video file, digital photo, text file, structured document, or application) which may be located within social-networking system 160 or on an external server, such as a web-application server; real or intellectual property (such as, for example, a sculpture, painting, movie, game, song, idea, photograph, or written work); a game; an activity; an idea or theory; another suitable concept; or two or more such concepts. A concept node 204 may be associated with information of a concept provided by a user or information gathered by various systems, including social-networking system 160. As an example and not by way of limitation, information of a concept may include a name or a title; one or more images (e.g., an image of the cover page of a book); a location (e.g., an address or a geographical location); a website (which may be associated with a URL); contact information (e.g., a phone number or an email address); other suitable concept information; or any suitable combination of such information. In particular embodiments, a concept node 204 may be associated with one or more data objects corresponding to information associated with concept node 204. In particular embodiments, a concept node 204 may correspond to one or more webpages.
In particular embodiments, a node in social graph 200 may represent or be represented by a webpage (which may be referred to as a “profile page”). Profile pages may be hosted by or accessible to social-networking system 160. Profile pages may also be hosted on third-party websites associated with a third-party server 170. As an example and not by way of limitation, a profile page corresponding to a particular external webpage may be the particular external webpage and the profile page may correspond to a particular concept node 204. Profile pages may be viewable by all or a selected subset of other users. As an example and not by way of limitation, a user node 202 may have a corresponding user-profile page in which the corresponding user may add content, make declarations, or otherwise express himself or herself. As another example and not by way of limitation, a concept node 204 may have a corresponding concept-profile page in which one or more users may add content, make declarations, or express themselves, particularly in relation to the concept corresponding to concept node 204.
In particular embodiments, a concept node 204 may represent a third-party webpage or resource hosted by third-party system 170. The third-party webpage or resource may include, among other elements, content, a selectable or other icon, or other inter-actable object (which may be implemented, for example, in JavaScript, AJAX, or PHP codes) representing an action or activity. As an example and not by way of limitation, a third-party webpage may include a selectable icon such as “like,” “check in,” “eat,” “recommend,” or another suitable action or activity. A user viewing the third-party webpage may perform an action by selecting one of the icons (e.g., “eat”), causing client system 130 to send to social-networking system 160 a message indicating the user's action. In response to the message, social-networking system 160 may create an edge (e.g., an “eat” edge) between a user node 202 corresponding to the user and a concept node 204 corresponding to the third-party webpage or resource and store edge 206 in one or more data stores.
In particular embodiments, a pair of nodes in social graph 200 may be connected to each other by one or more edges 206. An edge 206 connecting a pair of nodes may represent a relationship between the pair of nodes. In particular embodiments, an edge 206 may include or represent one or more data objects or attributes corresponding to the relationship between a pair of nodes. As an example and not by way of limitation, a first user may indicate that a second user is a “friend” of the first user. In response to this indication, social-networking system 160 may send a “friend request” to the second user. If the second user confirms the “friend request,” social-networking system 160 may create an edge 206 connecting the first user's user node 202 to the second user's user node 202 in social graph 200 and store edge 206 as social-graph information in one or more of data stores 24. In the example of
In particular embodiments, an edge 206 between a user node 202 and a concept node 204 may represent a particular action or activity performed by a user associated with user node 202 toward a concept associated with a concept node 204. As an example and not by way of limitation, as illustrated in
In particular embodiments, social-networking system 160 may create an edge 206 between a user node 202 and a concept node 204 in social graph 200. As an example and not by way of limitation, a user viewing a concept-profile page (such as, for example, by using a web browser or a special-purpose application hosted by the user's client system 130) may indicate that he or she likes the concept represented by the concept node 204 by clicking or selecting a “Like” icon, which may cause the user's client system 130 to send to social-networking system 160 a message indicating the user's liking of the concept associated with the concept-profile page. In response to the message, social-networking system 160 may create an edge 206 between user node 202 associated with the user and concept node 204, as illustrated by “like” edge 206 between the user and concept node 204. In particular embodiments, social-networking system 160 may store an edge 206 in one or more data stores. In particular embodiments, an edge 206 may be automatically formed by social-networking system 160 in response to a particular user action. As an example and not by way of limitation, if a first user uploads a picture, watches a movie, or listens to a song, an edge 206 may be formed between user node 202 corresponding to the first user and concept nodes 204 corresponding to those concepts. Although this disclosure describes forming particular edges 206 in particular manners, this disclosure contemplates forming any suitable edges 206 in any suitable manner.
Indexing Based on Object-type
In particular embodiments, each object may correspond to a particular node of a social graph 200. An edge 206 connecting the particular node and another node may indicate a relationship between objects corresponding to these nodes. In addition to storing objects, a particular data store may also store social-graph information relating to the object. Alternatively, social-graph information about particular objects may be stored in a different data store from the objects. Social-networking system 160 may update the search index of the data store based on newly received objects, and relationships associated with the received objects.
In particular embodiments, each data store 164 may be configured to store objects of a particular one of a plurality of object-types in respective data storage devices 340. An object-type may be, for example, a user, a photo, a post, a comment, a message, an event listing, a webpage, an application, a location, a user-profile page, a concept-profile page, a user group, an audio file, a video, an offer/coupon, or another suitable type of object. Although this disclosure describes particular types of objects, this disclosure contemplates any suitable types of objects. As an example and not by way of limitation, a user vertical P1 illustrated in
In particular embodiments, objects stored in each vertical 164 may be indexed by one or more search indices. The search indices may be hosted by respective index server 330 comprising one or more computing devices (e.g., servers). The index server 330 may update the search indices based on data (e.g., a photo and information associated with a photo) submitted to social-networking system 160 by users or other processes of social-networking system 160 (or a third-party system). The index server 330 may also update the search indices periodically (e.g., every 24 hours). The index server 330 may receive a query comprising a search term, and access and retrieve search results from one or more search indices corresponding to the search term. In some embodiments, a vertical corresponding to a particular object-type may comprise a plurality of physical or logical partitions, each comprising respective search indices.
In particular embodiments, social-networking system 160 may receive a search query from a PHP (Hypertext Preprocessor) process 310. The PHP process 310 may comprise one or more computing processes hosted by one or more servers 162 of social-networking system 160. The search query may be a text string or a search query submitted to the PHP process by a user or another process of social-networking system 160 (or third-party system 170).
More information on indexes and search queries may be found in U.S. patent application Ser. No. 13/560,212, filed 27 Jul. 2012, U.S. patent application Ser. No. 13/560,901, filed 27 Jul. 2012, and U.S. patent application Ser. No. 13/723,861, filed 21 Dec. 2012, each of which is incorporated by reference.
Typeahead Processes
In particular embodiments, one or more client-side and/or backend (server-side) processes may implement and utilize a “typeahead” feature that may automatically attempt to match social-graph elements (e.g., user nodes 202, concept nodes 204, or edges 206) to information currently being entered by a user in an input form rendered in conjunction with a requested webpage (such as, for example, a user-profile page, a concept-profile page, a search-results webpage, or another suitable page of the online social network), which may be hosted by or accessible in social-networking system 160. In particular embodiments, as a user is entering text to make a declaration, the typeahead feature may attempt to match the string of textual characters being entered in the declaration to strings of characters (e.g., names, descriptions) corresponding to user, concepts, or edges and their corresponding elements in the social graph 200. In particular embodiments, when a match is found, the typeahead feature may automatically populate the form with a reference to the social-graph element (such as, for example, the node name/type, node ID, edge name/type, edge ID, or another suitable reference or identifier) of the existing social-graph element.
In particular embodiments, as a user types or otherwise enters text into a form used to add content or make declarations in various sections of the user's profile page, home page, or other page, the typeahead process may work in conjunction with one or more frontend (client-side) and/or backend (server-side) typeahead processes (hereinafter referred to simply as “typeahead process”) executing at (or within) social-networking system 160 (e.g., within servers 162), to interactively and virtually instantaneously (as appearing to the user) attempt to auto-populate the form with a term or terms corresponding to names of existing social-graph elements, or terms associated with existing social-graph elements, determined to be the most relevant or best match to the characters of text entered by the user as the user enters the characters of text. Utilizing the social-graph information in a social-graph database or information extracted and indexed from the social-graph database, including information associated with nodes and edges, the typeahead processes, in conjunction with the information from the social-graph database, as well as potentially in conjunction with various others processes, applications, or databases located within or executing within social-networking system 160, may be able to predict a user's intended declaration with a high degree of precision. However, social-networking system 160 can also provides user's with the freedom to enter essentially any declaration they wish, enabling users to express themselves freely.
In particular embodiments, as a user enters text characters into a form box or other field, the typeahead processes may attempt to identify existing social-graph elements (e.g., user nodes 202, concept nodes 204, or edges 206) that match the string of characters entered in the user's declaration as the user is entering the characters. In particular embodiments, as the user enters characters into a form box, the typeahead process may read the string of entered textual characters. As each keystroke is made, the frontend-typeahead process may send the entered character string as a request (or call) to the backend-typeahead process executing within social-networking system 160. In particular embodiments, the typeahead processes may communicate via AJAX (Asynchronous JavaScript and XML) or other suitable techniques, and particularly, asynchronous techniques. In particular embodiments, the request may be, or comprise, an XMLHTTPRequest (XHR) enabling quick and dynamic sending and fetching of results. In particular embodiments, the typeahead process may also send before, after, or with the request a section identifier (section ID) that identifies the particular section of the particular page in which the user is making the declaration. In particular embodiments, a user ID parameter may also be sent, but this may be unnecessary in some embodiments, as the user may already be “known” based on the user having logged into (or otherwise been authenticated by) social-networking system 160.
In particular embodiments, the typeahead process may use one or more matching algorithms to attempt to identify matching social-graph elements. In particular embodiments, when a match or matches are found, the typeahead process may send a response (which may utilize AJAX or other suitable techniques) to the user's client system 130 that may include, for example, the names (name strings) or descriptions of the matching social-graph elements as well as, potentially, other metadata associated with the matching social-graph elements. As an example and not by way of limitation, if a user entering the characters “pok” into a query field, the typeahead process may display a drop-down menu that displays names of matching existing profile pages and respective user nodes 202 or concept nodes 204, such as a profile page named or devoted to “poker” or “pokemon”, which the user can then click on or otherwise select thereby confirming the desire to declare the matched user or concept name corresponding to the selected node. As another example and not by way of limitation, upon clicking “poker,” the typeahead process may auto-populate, or causes the web browser 132 to auto-populate, the query field with the declaration “poker”. In particular embodiments, the typeahead process may simply auto-populate the field with the name or other identifier of the top-ranked match rather than display a drop-down menu. The user may then confirm the auto-populated declaration simply by keying “enter” on his or her keyboard or by clicking on the auto-populated declaration.
More information on typeahead processes may be found in U.S. patent application Ser. No. 12/763,162, filed 19 Apr. 2010, and U.S. patent application Ser. No. 13/556,072, filed 23 Jul. 2012, each of which is incorporated by reference.
Variable Indexing with Typeahead Search Queries
In particular embodiments, the typeahead processes described herein may be applied to search queries entered by a user. As an example and not by way of limitation, as a user enters text characters into a query filed 450, a typeahead process may attempt to identify one or more user nodes 202, concept nodes 204, or edges 206 that match the string of characters entered into the query filed 450 as the user is entering the characters. As the typeahead process receives requests or calls including a string or n-gram from the text query, the typeahead process may perform or causes to be performed a search to identify existing social-graph elements (i.e., user nodes 202, concept nodes 204, edges 206) having respective names, types, categories, or other identifiers matching the entered text. The typeahead process may use one or more matching algorithms to attempt to identify matching nodes or edges. When a match or matches are found, the typeahead process may send a response to the user's client system 130 that may include, for example, the names (name strings) of the matching nodes as well as, potentially, other metadata associated with the matching nodes. The typeahead process may then display a drop-down menu 400 that displays references to the matching profile pages (e.g., a name or photo associated with the page) of the respective user nodes 202 or concept nodes 204, and displays names of matching edges 206 that may connect to the matching user nodes 202 or concept nodes 204, which the user can then click on or otherwise select, thereby confirming the desire to search for the matched user or concept name corresponding to the selected node, or to search for users or concepts connected to the matched users or concepts by the matching edges. Alternatively, the typeahead process may simply auto-populate the form with the name or other identifier of the top-ranked match rather than display a drop-down menu 400. The user may then confirm the auto-populated declaration simply by keying “enter” on a keyboard or by clicking on the auto-populated declaration. Upon user confirmation of the matching nodes and/or edges, the typeahead process may send a request that informs social-networking system 160 of the user's confirmation of a query containing the matching social-graph elements. In response to the sent request, social-networking system 160 may automatically (or alternately based on an instruction in the request) call or otherwise search a social-graph database for the matching social-graph elements, or for social-graph elements connected to the matching social-graph elements as appropriate. Although this disclosure describes applying the typeahead processes to search queries in a particular manner, this disclosure contemplates applying the typeahead processes to search queries in any suitable manner.
In connection with search queries and search results, particular embodiments may utilize one or more systems, components, elements, functions, methods, operations, or steps disclosed in U.S. patent application Ser. No. 11/503,093, filed 11 Aug. 2006, U.S. patent application Ser. No. 12/977,027, filed 22 Dec. 2010, U.S. patent application Ser. No. 12/978,265, filed 23 Dec. 2010, and U.S. patent application Ser. No. 13/732,101, filed 31 Dec. 2012, each of which is incorporated by reference.
In particular embodiments, social-networking system 160 may receive from a querying/first user (corresponding to a first user node 202) a search query input. The search query input may be received in any suitable manner, such as, for example, by having the user input the character string into a query field 450 on a webpage of the online social network. The search query input may comprise a character string having a first number of characters. As an example and not by way of limitation, a user may want to search for a user named “Catie Kaiser”, who is a 2nd-degree connection of the querying user. The querying user may begin by entering characters from the user's surname, “ka”, as illustrated in
In particular embodiments, social-networking system 160 may parse the search query received from the first user (i.e., the querying user) to identify one or more n-grams. In general, an n-gram is a contiguous sequence of n items from a given sequence of text or speech. The items may be characters, phonemes, syllables, letters, words, base pairs, prefixes, or other identifiable items from the sequence of text or speech. The n-gram may comprise one or more characters of text (letters, numbers, punctuation, etc.) entered by the querying user. An n-gram of size one can be referred to as a “unigram,” of size two can be referred to as a “bigram” or “digram,” of size three can be referred to as a “trigram,” and so on. Each n-gram may include one or more parts from the search query received from the querying user. In particular embodiments, each n-gram may comprise a character string (e.g., one or more characters of text) entered by the first user. As an example and not by way of limitation, social-networking system 160 may parse the search query “all about recipes” to identify the following n-grams: all; about; recipes; all about; about recipes; all about recipes. In particular embodiments, each n-gram may comprise a contiguous sequence of n items from the search query. Although this disclosure describes parsing particular queries in a particular manner, this disclosure contemplates parsing any suitable queries in any suitable manner. In connection with element detection and parsing search queries, particular embodiments may utilize one or more systems, components, elements, functions, methods, operations, or steps disclosed in U.S. patent application Ser. No. 13/556,072, filed 23 Jul. 2012, U.S. patent application Ser. No. 13/732,101, filed 31 Dec. 2012, each of which is incorporated by reference.
In particular embodiments, social-networking system 160 may access one or more verticals 164 in response to a search query received from a user. Each vertical 164 may store one or more objects associated with the online social network. The number of verticals 164 accessed in response to the search query may be based on the length of the search query. As the search query length (i.e., the number of characters in the character string comprising the search query input) increases, additional verticals 164 may be accessed. Each additional set of verticals 164 accessed may be of a different object-type, such that as more characters are added to the character string, more object-types may be searched. In particular embodiments, if the search query length is less than or equal to a threshold number, then social-networking system 160 may access one or more first verticals, but if the search query length is greater than the threshold number, then social-networking system 160 may access the first verticals and one or more second verticals. This threshold number may be any suitable number of characters, such as, for example, one, two, three, four, or five characters. The first verticals and the second verticals may store objects of the same object-type or of different object-types. As an example and not by way of limitation, if search query length is less than a threshold number, then social-networking system 160 may search the users verticals 164 to identify only 1st-degree friends of the querying user that substantially match the character string of the search query input. In other words, social-networking system 160 may identify one or more user nodes 202 within one degree of separation of the user node 202 of the querying user. But if the search query length is greater than the threshold number, then social-networking system 160 may search the users verticals 164 to identify 1st-degree or 2nd-degree friends of the querying user that substantially match the character string of the search query input. In other words, social-networking system may identify one or more user nodes 202 within two degrees-of-separation of the user node 202 of the querying user. In particular embodiments, if the search query length is greater than both a first threshold number and a second threshold number, then social-networking system 160 may access the first verticals, the second verticals, and one or more third verticals. The second threshold number must be at least one character greater in length than the first threshold number. In other words, there may be multiple threshold numbers delimiting access to particular verticals 164. As subsequent threshold are crossed, social-networking system 160 may access one or more additional verticals 164. Any suitable number of threshold numbers for search query length may be specified. As an example and not by way of limitation, social-networking system 160 may access a cache associated with a web browser or one or more verticals 164 of the social-networking system 160 in the following manner:
In this example, a first, second, third, fourth, and fifth threshold number are specified at 1, 2, 3, 5, and 7 characters, respectively. As the search query length crosses each threshold, the scope of the search is expanded. In other words, as the search query length increase to 2, 3, 4, 6, and 8 characters, additional verticals 164 (or portions of verticals 164) are added to the scope of the search. Although this disclosure describes accessing particular verticals 164 in a particular manner, this disclosure contemplates accessing any suitable verticals 164 in any suitable manner.
In particular embodiments, social-networking system 160 may access a cache associated with a web browser 132 of a client system 130 associated with the querying user. The cache may store information about one or more cached objects associated with the online social network. If the search query length is less than a threshold number, then social-networking system 160 may access the cache to search for matching objects (via, for example, a client-side search process). Any suitable objects (or portions of objects) associated with the online social network may be cached on the client system 130 of the querying user. Cached object (or information about such objects) may include, for example, pages associated with nodes having a high social-graph affinity with respect to the querying user (e.g., user-profile pages of close friends or family), friends of the querying user, frequently accessed pages, recently accessed pages, other suitable objects, or any combination thereof. As an example and not by way of limitation, as described in the table above, when the search query length is less than or equal to 1 character, social-networking system 160 may access a cache associated with a web browser 132 of the querying user to identify objects that substantially match the character string of the search query input. In this example, the cache may only store information associated with close friends and family of the querying user. However, as the search query length increases beyond this threshold, social-networking system 160 may search one or more verticals 164 instead of (or possibly in addition to) the cache. In particular embodiments, social-networking system 160 may search the cache to identify one or more cached objects that substantially match the character string of the search query input. Cached objects may be search and identified analogously to objects stored in verticals 164, as described previously. In particular embodiments, social-networking system 160 may send to the querying user one or more references to one or more of the identified cached objects, respectively. Where the identified object is stored in the cache of the client system 130 of the querying user, social-networking system 160 may simply instruct the web browser 132 to retrieve the cached object from the cache. Alternatively, the identified cached object may be retrieved from the social-networking system 160. Although this disclosure describes accessing particular cached objects in a particular manner, this disclosure contemplates accessing any suitable cached objects in any suitable manner.
In particular embodiments, social-networking system 160 may search each accessed verticals 164 to identify one or more objects that substantially match the character string of the search query input. Social-networking system 160 may identify matching objects in any suitable manner, such as, for example, by using one or more string matching algorithms to match the character string with a string of characters associated with each of one or more of the objects. As an example and not by way of limitation, in response to a search query input “kais”, as illustrated in
(AND (name: “kais”)
In particular embodiments, when searching verticals 164 to identify matching objects, social-networking system 160 may only identify and score up to a threshold number of matching nodes in a particular vertical 164. This threshold number of matching objects may then be scored and ranked by the social-networking system 160. The threshold number may be chosen to enhance search quality or to optimize the processing of search results. As an example and not by way of limitation, social-networking system 160 may only identify the top N matching objects (i.e., the number to score) in a users vertical 164 in response to a query command requesting users. The top N objects may be determined by a static ranking (e.g., ranking based on the current social-graph affinity of the user with respect to the querying user) of the objects in a search index corresponding to the users vertical 164. In particular embodiments, the top N identified object may be re-ranked based on the search query itself. As an example and not by way of limitation, if the number to score is 500, the top 500 objects may be identified. These 500 objects may then be ranked based on one or more factors (e.g., match to the search query or other query constraints, social-graph affinity, search history, etc.), and the top M results may then be generated as typeahead suggestions for display to the querying user (for example, the top 6 results may be displayed in a drop-down menu 400, as illustrated in
In particular embodiments, social-networking system 160 may generate one or more references to the identified objects. These references may be generated as typeahead suggestions to be displayed to the user in response to the search query input from the querying user. The typeahead suggestions (e.g., the reference to the identified nodes or their corresponding profile pages) may be scored (or ranked) and presented to the user according to their relative degrees of relevance to the search query input, as determined by the particular search algorithm used to generate the typeahead suggestions. The typeahead suggestions may also be scored and presented to the user according to their relative degree of relevance to the user. In particular embodiments, the typeahead suggestions may be scored or ranked by a particular scoring/ranking algorithm implemented by the search engine. As an example and not by way of limitation, typeahead suggestions that are more relevant to the search query or to the user may be scored higher than the resources that are less relevant. The way relevance is determined may be modified based on the search intent identified by social-networking system 160. In particular embodiments, social-networking system 160 may rank the one or more typeahead suggestions. Typeahead suggestions may be ranked, for example, based on the score determined for the typeahead suggestion. The most relevant result (e.g., highest/best scoring) may be ranked highest, with the remaining results having lower ranks commensurate with their score/relevance, such that the least relevant result is ranked lowest. Although this disclosure describes generating particular reference to identified objects in a particular manner, this disclosure contemplates generating any suitable references to identified object in any suitable manner.
In particular embodiments, social-networking system 160 may send to the querying user one or more references to one or more of the identified objects, respectively. As the user enters the search query input as a character string into a query field 450, the typeahead processes described previously may automatically send the references to the identified objects as typeahead suggestions. The typeahead suggestions may be sent to the user, for example, in the form of a list of links displayed in a drop-down menu 400 (which may be associated with the query field 450), each link being associated with a different webpage comprising the identified objects. In particular embodiments, each link in the typeahead suggestions may comprise a Uniform Resource Locator (URL) that specifies where the corresponding webpage comprising the referenced content object is located and the mechanism for retrieving it. Social-networking system 160 may then send the typeahead suggestions to the web browser 132 on the user's client system 130. The user may then click on the URL links or otherwise select the object from the drop-down menu 400 to access the object from social-networking system 160 or from an external system (such as, for example, third-party system 170), as appropriate. In particular embodiments, each typeahead suggestion may include link to a profile page and a description or summary of the profile page (or the node corresponding to that page). When generating the typeahead suggestions, social-networking system 160 may generate one or more snippets for each typeahead suggestion, where the snippets are contextual information about the target of the typeahead suggestion (i.e., contextual information about the social-graph entity, profile page, or other objects corresponding to the particular typeahead suggestion). In particular embodiments, social-networking system 160 may only send typeahead suggestions having a score/rank over a particular threshold score/rank. As an example and not by way of limitation, social-networking system 160 may only send the top ten suggestions back to the querying user in response to a particular search query input. Although this disclosure describes sending particular references to identified objects in a particular manner, this disclosure contemplates sending any suitable references to identified objects in any suitable manner.
Systems and Methods
This disclosure contemplates any suitable number of computer systems 700. This disclosure contemplates computer system 700 taking any suitable physical form. As example and not by way of limitation, computer system 700 may be an embedded computer system, a system-on-chip (SOC), a single-board computer system (SBC) (such as, for example, a computer-on-module (COM) or system-on-module (SOM)), a desktop computer system, a laptop or notebook computer system, an interactive kiosk, a mainframe, a mesh of computer systems, a mobile telephone, a personal digital assistant (PDA), a server, a tablet computer system, or a combination of two or more of these. Where appropriate, computer system 700 may include one or more computer systems 700; be unitary or distributed; span multiple locations; span multiple machines; span multiple data centers; or reside in a cloud, which may include one or more cloud components in one or more networks. Where appropriate, one or more computer systems 700 may perform without substantial spatial or temporal limitation one or more steps of one or more methods described or illustrated herein. As an example and not by way of limitation, one or more computer systems 700 may perform in real time or in batch mode one or more steps of one or more methods described or illustrated herein. One or more computer systems 700 may perform at different times or at different locations one or more steps of one or more methods described or illustrated herein, where appropriate.
In particular embodiments, computer system 700 includes a processor 702, memory 704, storage 706, an input/output (I/O) interface 708, a communication interface 710, and a bus 712. Although this disclosure describes and illustrates a particular computer system having a particular number of particular components in a particular arrangement, this disclosure contemplates any suitable computer system having any suitable number of any suitable components in any suitable arrangement.
In particular embodiments, processor 702 includes hardware for executing instructions, such as those making up a computer program. As an example and not by way of limitation, to execute instructions, processor 702 may retrieve (or fetch) the instructions from an internal register, an internal cache, memory 704, or storage 706; decode and execute them; and then write one or more results to an internal register, an internal cache, memory 704, or storage 706. In particular embodiments, processor 702 may include one or more internal caches for data, instructions, or addresses. This disclosure contemplates processor 702 including any suitable number of any suitable internal caches, where appropriate. As an example and not by way of limitation, processor 702 may include one or more instruction caches, one or more data caches, and one or more translation lookaside buffers (TLBs). Instructions in the instruction caches may be copies of instructions in memory 704 or storage 706, and the instruction caches may speed up retrieval of those instructions by processor 702. Data in the data caches may be copies of data in memory 704 or storage 706 for instructions executing at processor 702 to operate on; the results of previous instructions executed at processor 702 for access by subsequent instructions executing at processor 702 or for writing to memory 704 or storage 706; or other suitable data. The data caches may speed up read or write operations by processor 702. The TLBs may speed up virtual-address translation for processor 702. In particular embodiments, processor 702 may include one or more internal registers for data, instructions, or addresses. This disclosure contemplates processor 702 including any suitable number of any suitable internal registers, where appropriate. Where appropriate, processor 702 may include one or more arithmetic logic units (ALUs); be a multi-core processor; or include one or more processors 702. Although this disclosure describes and illustrates a particular processor, this disclosure contemplates any suitable processor.
In particular embodiments, memory 704 includes main memory for storing instructions for processor 702 to execute or data for processor 702 to operate on. As an example and not by way of limitation, computer system 700 may load instructions from storage 706 or another source (such as, for example, another computer system 700) to memory 704. Processor 702 may then load the instructions from memory 704 to an internal register or internal cache. To execute the instructions, processor 702 may retrieve the instructions from the internal register or internal cache and decode them. During or after execution of the instructions, processor 702 may write one or more results (which may be intermediate or final results) to the internal register or internal cache. Processor 702 may then write one or more of those results to memory 704. In particular embodiments, processor 702 executes only instructions in one or more internal registers or internal caches or in memory 704 (as opposed to storage 706 or elsewhere) and operates only on data in one or more internal registers or internal caches or in memory 704 (as opposed to storage 706 or elsewhere). One or more memory buses (which may each include an address bus and a data bus) may couple processor 702 to memory 704. Bus 712 may include one or more memory buses, as described below. In particular embodiments, one or more memory management units (MMUs) reside between processor 702 and memory 704 and facilitate accesses to memory 704 requested by processor 702. In particular embodiments, memory 704 includes random access memory (RAM). This RAM may be volatile memory, where appropriate Where appropriate, this RAM may be dynamic RAM (DRAM) or static RAM (SRAM). Moreover, where appropriate, this RAM may be single-ported or multi-ported RAM. This disclosure contemplates any suitable RAM. Memory 704 may include one or more memories 704, where appropriate. Although this disclosure describes and illustrates particular memory, this disclosure contemplates any suitable memory.
In particular embodiments, storage 706 includes mass storage for data or instructions. As an example and not by way of limitation, storage 706 may include a hard disk drive (HDD), a floppy disk drive, flash memory, an optical disc, a magneto-optical disc, magnetic tape, or a Universal Serial Bus (USB) drive or a combination of two or more of these. Storage 706 may include removable or non-removable (or fixed) media, where appropriate. Storage 706 may be internal or external to computer system 700, where appropriate. In particular embodiments, storage 706 is non-volatile, solid-state memory. In particular embodiments, storage 706 includes read-only memory (ROM). Where appropriate, this ROM may be mask-programmed ROM, programmable ROM (PROM), erasable PROM (EPROM), electrically erasable PROM (EEPROM), electrically alterable ROM (EAROM), or flash memory or a combination of two or more of these. This disclosure contemplates mass storage 706 taking any suitable physical form. Storage 706 may include one or more storage control units facilitating communication between processor 702 and storage 706, where appropriate. Where appropriate, storage 706 may include one or more storages 706. Although this disclosure describes and illustrates particular storage, this disclosure contemplates any suitable storage.
In particular embodiments, I/O interface 708 includes hardware, software, or both, providing one or more interfaces for communication between computer system 700 and one or more I/O devices. Computer system 700 may include one or more of these I/O devices, where appropriate. One or more of these I/O devices may enable communication between a person and computer system 700. As an example and not by way of limitation, an I/O device may include a keyboard, keypad, microphone, monitor, mouse, printer, scanner, speaker, still camera, stylus, tablet, touch screen, trackball, video camera, another suitable I/O device or a combination of two or more of these. An I/O device may include one or more sensors. This disclosure contemplates any suitable I/O devices and any suitable I/O interfaces 708 for them. Where appropriate, I/O interface 708 may include one or more device or software drivers enabling processor 702 to drive one or more of these I/O devices. I/O interface 708 may include one or more I/O interfaces 708, where appropriate. Although this disclosure describes and illustrates a particular I/O interface, this disclosure contemplates any suitable I/O interface.
In particular embodiments, communication interface 710 includes hardware, software, or both providing one or more interfaces for communication (such as, for example, packet-based communication) between computer system 700 and one or more other computer systems 700 or one or more networks. As an example and not by way of limitation, communication interface 710 may include a network interface controller (NIC) or network adapter for communicating with an Ethernet or other wire-based network or a wireless NIC (WNIC) or wireless adapter for communicating with a wireless network, such as a WI-FI network. This disclosure contemplates any suitable network and any suitable communication interface 710 for it. As an example and not by way of limitation, computer system 700 may communicate with an ad hoc network, a personal area network (PAN), a local area network (LAN), a wide area network (WAN), a metropolitan area network (MAN), or one or more portions of the Internet or a combination of two or more of these. One or more portions of one or more of these networks may be wired or wireless. As an example, computer system 700 may communicate with a wireless PAN (WPAN) (such as, for example, a BLUETOOTH WPAN), a WI-FI network, a WI-MAX network, a cellular telephone network (such as, for example, a Global System for Mobile Communications (GSM) network), or other suitable wireless network or a combination of two or more of these. Computer system 700 may include any suitable communication interface 710 for any of these networks, where appropriate. Communication interface 710 may include one or more communication interfaces 710, where appropriate. Although this disclosure describes and illustrates a particular communication interface, this disclosure contemplates any suitable communication interface.
In particular embodiments, bus 712 includes hardware, software, or both coupling components of computer system 700 to each other. As an example and not by way of limitation, bus 712 may include an Accelerated Graphics Port (AGP) or other graphics bus, an Enhanced Industry Standard Architecture (EISA) bus, a front-side bus (FSB), a HYPERTRANSPORT (HT) interconnect, an Industry Standard Architecture (ISA) bus, an INFINIBAND interconnect, a low-pin-count (LPC) bus, a memory bus, a Micro Channel Architecture (MCA) bus, a Peripheral Component Interconnect (PCI) bus, a PCI-Express (PCIe) bus, a serial advanced technology attachment (SATA) bus, a Video Electronics Standards Association local (VLB) bus, or another suitable bus or a combination of two or more of these. Bus 712 may include one or more buses 712, where appropriate. Although this disclosure describes and illustrates a particular bus, this disclosure contemplates any suitable bus or interconnect.
Herein, a computer-readable non-transitory storage medium or media may include one or more semiconductor-based or other integrated circuits (ICs) (such, as for example, field-programmable gate arrays (FPGAs) or application-specific ICs (ASICs)), hard disk drives (HDDs), hybrid hard drives (HHDs), optical discs, optical disc drives (ODDs), magneto-optical discs, magneto-optical drives, floppy diskettes, floppy disk drives (FDDs), magnetic tapes, solid-state drives (SSDs), RAM-drives, SECURE DIGITAL cards or drives, any other suitable computer-readable non-transitory storage media, or any suitable combination of two or more of these, where appropriate. A computer-readable non-transitory storage medium may be volatile, non-volatile, or a combination of volatile and non-volatile, where appropriate.
Miscellaneous
Herein, “or” is inclusive and not exclusive, unless expressly indicated otherwise or indicated otherwise by context. Therefore, herein, “A or B” means “A, B, or both,” unless expressly indicated otherwise or indicated otherwise by context. Moreover, “and” is both joint and several, unless expressly indicated otherwise or indicated otherwise by context. Therefore, herein, “A and B” means “A and B, jointly or severally,” unless expressly indicated otherwise or indicated otherwise by context.
The scope of this disclosure encompasses all changes, substitutions, variations, alterations, and modifications to the example embodiments described or illustrated herein that a person having ordinary skill in the art would comprehend. The scope of this disclosure is not limited to the example embodiments described or illustrated herein. Moreover, although this disclosure describes and illustrates respective embodiments herein as including particular components, elements, functions, operations, or steps, any of these embodiments may include any combination or permutation of any of the components, elements, functions, operations, or steps described or illustrated anywhere herein that a person having ordinary skill in the art would comprehend. Furthermore, reference in the appended claims to an apparatus or system or a component of an apparatus or system being adapted to, arranged to, capable of, configured to, enabled to, operable to, or operative to perform a particular function encompasses that apparatus, system, component, whether or not it or that particular function is activated, turned on, or unlocked, as long as that apparatus, system, or component is so adapted, arranged, capable, configured, enabled, operable, or operative.
This application is a continuation under 35 U.S.C. § 120 of U.S. patent application Ser. No. 13/870,113, filed 25 Apr. 2013.
| Number | Name | Date | Kind |
|---|---|---|---|
| 5918014 | Robinson | Jun 1999 | A |
| 6470336 | Matsukawa | Oct 2002 | B1 |
| 6539232 | Hendrey | Mar 2003 | B2 |
| 6957184 | Schmid | Oct 2005 | B2 |
| 7069308 | Abrams | Jun 2006 | B2 |
| 7379811 | Rasmussen | May 2008 | B2 |
| 7461059 | Richardson | Dec 2008 | B2 |
| 7539697 | Akella | May 2009 | B1 |
| 7752326 | Smit | Jul 2010 | B2 |
| 7783630 | Chevalier | Aug 2010 | B1 |
| 7797635 | Denise | Sep 2010 | B1 |
| 7836044 | Kamvar | Nov 2010 | B2 |
| 7840589 | Holt | Nov 2010 | B1 |
| 8024328 | Dolin | Sep 2011 | B2 |
| 8027990 | Mysen | Sep 2011 | B1 |
| 8055673 | Churchill | Nov 2011 | B2 |
| 8060639 | Smit | Nov 2011 | B2 |
| 8082278 | Agrawal | Dec 2011 | B2 |
| 8112529 | Van Den Oord | Feb 2012 | B2 |
| 8135721 | Joshi | Mar 2012 | B2 |
| 8145636 | Jeh | Mar 2012 | B1 |
| 8180804 | Narayanan | May 2012 | B1 |
| 8185558 | Narayanan | May 2012 | B1 |
| 8209330 | Covell | Jun 2012 | B1 |
| 8239364 | Wable | Aug 2012 | B2 |
| 8244661 | Komissarchik | Aug 2012 | B1 |
| 8244848 | Narayanan | Aug 2012 | B1 |
| 8271471 | Kamvar | Sep 2012 | B1 |
| 8271546 | Gibbs | Sep 2012 | B2 |
| 8301639 | Myllymaki | Oct 2012 | B1 |
| 8306922 | Kunal | Nov 2012 | B1 |
| 8312056 | Peng | Nov 2012 | B1 |
| 8321364 | Gharpure | Nov 2012 | B1 |
| 8364709 | Das | Jan 2013 | B1 |
| 8386465 | Ansari | Feb 2013 | B2 |
| 8407200 | Wable | Mar 2013 | B2 |
| 8412749 | Fortuna | Apr 2013 | B2 |
| 8538960 | Wong | Sep 2013 | B2 |
| 8572129 | Lee | Oct 2013 | B1 |
| 8578274 | Druzgalski | Nov 2013 | B2 |
| 8595297 | Marcucci | Nov 2013 | B2 |
| 8601027 | Behforooz | Dec 2013 | B2 |
| 8606721 | Dicker | Dec 2013 | B1 |
| 8639725 | Udeshi | Jan 2014 | B1 |
| 8732208 | Lee | May 2014 | B2 |
| 8751521 | Lee | Jun 2014 | B2 |
| 8775324 | Zhu | Jul 2014 | B2 |
| 8782080 | Lee | Jul 2014 | B2 |
| 8782753 | Lunt | Jul 2014 | B2 |
| 8832111 | Venkataramani | Sep 2014 | B2 |
| 8868590 | Donneau-Golencer | Oct 2014 | B1 |
| 8868603 | Lee | Oct 2014 | B2 |
| 8898226 | Tiu | Nov 2014 | B2 |
| 8909637 | Patterson | Dec 2014 | B2 |
| 8914392 | Lunt | Dec 2014 | B2 |
| 8918418 | Lee | Dec 2014 | B2 |
| 8924406 | Lunt | Dec 2014 | B2 |
| 8935255 | Sankar | Jan 2015 | B2 |
| 8935261 | Pipegrass | Jan 2015 | B2 |
| 8935271 | Lassen | Jan 2015 | B2 |
| 8949232 | Harrington | Feb 2015 | B2 |
| 8949250 | Garg | Feb 2015 | B1 |
| 8949261 | Lunt | Feb 2015 | B2 |
| 8954675 | Venkataramani | Feb 2015 | B2 |
| 8983991 | Sankar | Mar 2015 | B2 |
| 9015733 | Schrock | Apr 2015 | B2 |
| 9223899 | Singh | Dec 2015 | B2 |
| 9342605 | Richter | May 2016 | B2 |
| 9400822 | Schrock | Jul 2016 | B2 |
| 9576060 | Singh | Feb 2017 | B2 |
| 9646028 | Schrock | May 2017 | B2 |
| 20020059199 | Harvey | May 2002 | A1 |
| 20020086676 | Hendrey et al. | Jul 2002 | A1 |
| 20020196273 | Krause | Dec 2002 | A1 |
| 20030101163 | Lui | May 2003 | A1 |
| 20030154194 | Jonas | Aug 2003 | A1 |
| 20030208474 | Soulanille | Nov 2003 | A1 |
| 20040088325 | Elder | May 2004 | A1 |
| 20040172237 | Saldanha | Sep 2004 | A1 |
| 20040215793 | Ryan | Oct 2004 | A1 |
| 20040243568 | Wang | Dec 2004 | A1 |
| 20040255237 | Tong | Dec 2004 | A1 |
| 20050091202 | Thomas | Apr 2005 | A1 |
| 20050125408 | Somaroo | Jun 2005 | A1 |
| 20050131872 | Calbucci | Jun 2005 | A1 |
| 20050171955 | Hull | Aug 2005 | A1 |
| 20050256756 | Lam | Nov 2005 | A1 |
| 20060041597 | Conrad | Feb 2006 | A1 |
| 20060117378 | Tam | Jun 2006 | A1 |
| 20060136419 | Brydon | Jun 2006 | A1 |
| 20060190436 | Richardson | Aug 2006 | A1 |
| 20060218111 | Cohen | Sep 2006 | A1 |
| 20070019864 | Koyama | Jan 2007 | A1 |
| 20070174304 | Shrufi | Jul 2007 | A1 |
| 20070192293 | Swen | Aug 2007 | A1 |
| 20070277100 | Sheha | Nov 2007 | A1 |
| 20080005064 | Sarukkai | Jan 2008 | A1 |
| 20080033926 | Matthews | Feb 2008 | A1 |
| 20080065617 | Burke | Mar 2008 | A1 |
| 20080072180 | Chevalier | Mar 2008 | A1 |
| 20080114730 | Larimore | May 2008 | A1 |
| 20080183694 | Cane | Jul 2008 | A1 |
| 20080183695 | Jadhav | Jul 2008 | A1 |
| 20080270615 | Centola | Oct 2008 | A1 |
| 20090006543 | Smit | Jan 2009 | A1 |
| 20090054043 | Hamilton | Feb 2009 | A1 |
| 20090094200 | Baeza-Yates | Apr 2009 | A1 |
| 20090164408 | Grigorik | Jun 2009 | A1 |
| 20090164431 | Zivkovic | Jun 2009 | A1 |
| 20090164929 | Chen | Jun 2009 | A1 |
| 20090197681 | Krishnamoorthy | Aug 2009 | A1 |
| 20090222348 | Ransom | Sep 2009 | A1 |
| 20090228296 | Ismalon | Sep 2009 | A1 |
| 20090259624 | DeMaris | Oct 2009 | A1 |
| 20090259646 | Fujita | Oct 2009 | A1 |
| 20090265326 | Lehrman | Oct 2009 | A1 |
| 20090271370 | Jagadish | Oct 2009 | A1 |
| 20090271374 | Korn | Oct 2009 | A1 |
| 20090276414 | Gao | Nov 2009 | A1 |
| 20090281988 | Yoo | Nov 2009 | A1 |
| 20090299963 | Pippori | Dec 2009 | A1 |
| 20100049802 | Raman | Feb 2010 | A1 |
| 20100057723 | Rajaram | Mar 2010 | A1 |
| 20100082695 | Hardt | Apr 2010 | A1 |
| 20100125562 | Nair | May 2010 | A1 |
| 20100145771 | Fligler | Jun 2010 | A1 |
| 20100179929 | Yin | Jul 2010 | A1 |
| 20100197318 | Petersen | Aug 2010 | A1 |
| 20100228744 | Craswell | Sep 2010 | A1 |
| 20100235354 | Gargaro | Sep 2010 | A1 |
| 20100250526 | Prochazka | Sep 2010 | A1 |
| 20100306191 | LeBeau | Dec 2010 | A1 |
| 20100321399 | Ellren | Dec 2010 | A1 |
| 20110004609 | Chitiveli | Jan 2011 | A1 |
| 20110022602 | Luo | Jan 2011 | A1 |
| 20110078166 | Oliver | Mar 2011 | A1 |
| 20110087534 | Strebinger | Apr 2011 | A1 |
| 20110137902 | Wable | Jun 2011 | A1 |
| 20110184981 | Lu | Jul 2011 | A1 |
| 20110191371 | Elliott | Aug 2011 | A1 |
| 20110196855 | Wable | Aug 2011 | A1 |
| 20110231296 | Gross | Sep 2011 | A1 |
| 20110276396 | Rathod | Nov 2011 | A1 |
| 20110313992 | Groeneveld | Dec 2011 | A1 |
| 20110320470 | Williams | Dec 2011 | A1 |
| 20120023085 | Bellerive | Jan 2012 | A1 |
| 20120042020 | Kolari | Feb 2012 | A1 |
| 20120047147 | Redstone | Feb 2012 | A1 |
| 20120059708 | Galas | Mar 2012 | A1 |
| 20120110080 | Panyam | May 2012 | A1 |
| 20120136852 | Geller | May 2012 | A1 |
| 20120166432 | Tseng | Jun 2012 | A1 |
| 20120166433 | Tseng | Jun 2012 | A1 |
| 20120179637 | Juan | Jul 2012 | A1 |
| 20120185472 | Ahmed | Jul 2012 | A1 |
| 20120185486 | Voigt | Jul 2012 | A1 |
| 20120209832 | Neystadt | Aug 2012 | A1 |
| 20120221581 | Narayanan | Aug 2012 | A1 |
| 20120271831 | Narayanan | Oct 2012 | A1 |
| 20120278127 | Kirakosyan | Nov 2012 | A1 |
| 20120284329 | Van Den Oord | Nov 2012 | A1 |
| 20120290950 | Rapaport | Nov 2012 | A1 |
| 20120310922 | Johnson | Dec 2012 | A1 |
| 20120311034 | Goldband | Dec 2012 | A1 |
| 20120317088 | Pantel | Dec 2012 | A1 |
| 20120317097 | Tseng | Dec 2012 | A1 |
| 20120331063 | Rajaram | Dec 2012 | A1 |
| 20130031106 | Schechter | Jan 2013 | A1 |
| 20130031113 | Feng | Jan 2013 | A1 |
| 20130041876 | Dow | Feb 2013 | A1 |
| 20130066876 | Raskino | Mar 2013 | A1 |
| 20130073400 | Heath | Mar 2013 | A1 |
| 20130085970 | Karnik | Apr 2013 | A1 |
| 20130086024 | Liu | Apr 2013 | A1 |
| 20130086057 | Harrington | Apr 2013 | A1 |
| 20130097140 | Scheel | Apr 2013 | A1 |
| 20130124538 | Lee | May 2013 | A1 |
| 20130124542 | Lee | May 2013 | A1 |
| 20130144899 | Lee | Jun 2013 | A1 |
| 20130191372 | Lee | Jul 2013 | A1 |
| 20130191416 | Lee | Jul 2013 | A1 |
| 20130198219 | Cohen | Aug 2013 | A1 |
| 20130204737 | Agarwal | Aug 2013 | A1 |
| 20130226918 | Berkhim | Aug 2013 | A1 |
| 20130227011 | Sharma | Aug 2013 | A1 |
| 20130246404 | Annau | Sep 2013 | A1 |
| 20130254155 | Thollot | Sep 2013 | A1 |
| 20130254305 | Cheng | Sep 2013 | A1 |
| 20140006416 | Leslie | Jan 2014 | A1 |
| 20140032563 | Lassen | Jan 2014 | A1 |
| 20140067535 | Rezaei | Mar 2014 | A1 |
| 20140122465 | Bilinski | May 2014 | A1 |
| 20140280080 | Solheim | Sep 2014 | A1 |
| 20140280115 | Collin | Sep 2014 | A1 |
| 20140304429 | Softky | Oct 2014 | A1 |
| 20140324963 | Sankar | Oct 2014 | A1 |
| 20140330809 | Raina | Nov 2014 | A1 |
| 20140330818 | Raina | Nov 2014 | A1 |
| 20150074289 | Hyman | Mar 2015 | A1 |
| 20150161519 | Zhong | Jun 2015 | A1 |
| 20150286643 | Kumar | Oct 2015 | A1 |
| 20150363402 | Jackson | Dec 2015 | A1 |
| 20160026727 | Bar-Yossef | Jan 2016 | A1 |
| 20160041982 | He | Feb 2016 | A1 |
| 20160042067 | Weng | Feb 2016 | A1 |
| 20160063093 | Boucher | Mar 2016 | A1 |
| 20160063115 | Ayan | Mar 2016 | A1 |
| 20160070790 | Bhat | Mar 2016 | A1 |
| 20160148264 | Winstanley | May 2016 | A1 |
| 20160162502 | Zhou | Jun 2016 | A1 |
| 20160203238 | Cherniavskii | Jul 2016 | A1 |
| 20170046390 | Jain | Feb 2017 | A1 |
| 20170083523 | Philip | Mar 2017 | A1 |
| 20170103110 | Winstanley | Apr 2017 | A1 |
| 20170139920 | Ball | May 2017 | A1 |
| 20170147696 | Evnine | May 2017 | A1 |
| 20170185603 | Dentel | Jun 2017 | A1 |
| 20170199905 | Ott | Jul 2017 | A1 |
| 20170199927 | Moore | Jul 2017 | A1 |
| 20170201851 | Huang | Jul 2017 | A1 |
| 20170206250 | Loomans | Jul 2017 | A1 |
| 20170206271 | Jain | Jul 2017 | A1 |
| 20170262481 | Ploshykhyn | Sep 2017 | A1 |
| 20170308583 | Husain | Oct 2017 | A1 |
| 20180150559 | Ahuja | May 2018 | A1 |
| Number | Date | Country |
|---|---|---|
| 102811179 | Dec 2012 | CN |
| 102945258 | Feb 2013 | CN |
| 103002410 | Mar 2013 | CN |
| 2007-148775 | Jun 2007 | JP |
| 2009-530708 | Aug 2009 | JP |
| WO 2011105607 | Jan 2011 | WO |
| Entry |
|---|
| Examination Report No. 1 for Standard Patent Application from Australian Government IP Australia, dated Mar. 29, 2018. |
| International Search Report and Written Opinion for International Application PCT/US2014/035219, dated Aug. 25, 2014. |
| Extended European Search Report for EP Application No. 14787386.3-1952, dated Oct. 27, 2016. |
| Notification of Reason for Rejection regarding Application No. PCT/US2014/035219 from Japan Patent Office, dated May 8, 2018. |
| CN Office Action for Patent Application No. 2014800363380. (with English Translation), dated May 28, 2018. |
| AU Office Action received for Patent Application No. 2014257044, dated Jul. 12, 2018. |
| Number | Date | Country | |
|---|---|---|---|
| 20180150509 A1 | May 2018 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 13870113 | Apr 2013 | US |
| Child | 15877946 | US |
