Abstract: The embodiments herein provide a system and method for compact representation of graphs of regular degree. The graphs of regular degree are represented in a compact manner using a plurality of representation methods. The compact representation of the graphs of regular degree allows ease of understanding, storage and transmission of the graphs. The compact representation of graphs is a method for compression of graphs and representation of graphs with the minimum number of variables thereby enabling the storage and transmission of data in graph format efficiently. Further, the compact representation of graphs allows presentation of infinite family representation of Hamiltonian bipartite graphs of regular degree.

Abstract: An online system utilizing a social graph allows users to establish an account with the system and establish connections to nodes in the system. The social graph uses system-provided nodes that are created and maintained by the system, so that users cannot edit the system-provided nodes. The system aggregates and analyzes the social graph to present information in ways useful to its users. For example, the system reveals connections between persons in the system, with a corresponding strength of each connection.

Abstract: A method for generating a context graph is presented. The method may include extracting a plurality of message details from a message. The method may further include determining a message subject based on the plurality of extracted message details. The method may also include identifying a seed graph based on the determined message subject. The method may further include retrieving a plurality of addressee data based on the plurality of extracted message details. The method may also include creating a context graph using the identified seed graph and the plurality of retrieved addressee data.

Abstract: A method for generating a context graph is presented. The method may include extracting a plurality of message details from a message. The method may further include determining a message subject based on the plurality of extracted message details. The method may also include identifying a seed graph based on the determined message subject. The method may further include retrieving a plurality of addressee data based on the plurality of extracted message details. The method may also include creating a context graph using the identified seed graph and the plurality of retrieved addressee data.

Abstract: Example resource provisioning systems and methods are described. In one implementation, an execution platform accesses multiple remote storage devices. The execution platform includes multiple virtual warehouses, each of which includes a cache to store data retrieved from the remote storage devices and a processor that is independent of the remote storage devices. A resource manager is coupled to the execution platform and monitors received data processing requests and resource utilization. The resource manager also determines whether additional virtual warehouses are needed based on the data processing requests and the resource utilization. If additional virtual warehouses are needed, the resource manager provisions a new virtual warehouse.

Abstract: A method of generating graph data components stored in a graph database is provided. The method is implemented using a graph component generator computing device in communication with a memory. The method comprises receiving transaction data from a relational database, wherein transaction data is derived from transactions, processed by a payment processor, between a first merchant of a plurality of merchants and a first cardholder of a plurality of cardholders, defining a graph including creating at least a first node representing at least the first merchant and a second node representing the first cardholder, identifying at least one relationship between at least two nodes including the first node and the second node in the graph based, at least in part, on transaction data common to the at least two nodes, and generating at least one edge between the at least two nodes, representing a new relationship between the at least two nodes.

Abstract: A system for storing graph data as a multi-dimensional cluster having a database with a graph dataset containing data and relationships between data pairs and a schema list of storage methods that use a table with columns and rows associated with data or relationships. An analyzer module to collect statistics of a graph dataset and a dimension identification module to identify a plurality of dimensions that each represent a column in the table. A schema creation and loading module creates a modified storage method and having a plurality of distinct table blocks and a plurality of table block indexes, one index for each table block and arranges the data and relationships in the given graph dataset in accordance with the modified storage method to create the multi-dimensional cluster.

Abstract: A system and method for providing content for broadcast by a messaging platform, including: receiving an identifier selected by a user of a client computing device during composition of a message; identifying a content provider associated with the identifier; providing, by a computer processor, a set of content items of the content provider for presentation by the client computing device, wherein the user of the client computing device selects a content item from the presented set of content items; and broadcasting the message with a reference to the selected content item to a plurality of accounts of the messaging platform.

Abstract: Techniques herein decouple available results, from graph analysis execution, to adapt to various deployment configurations. In an embodiment, a graph engine is deployed that has multiple mutually-exclusive configuration modes that include being embedded within a software application, centrally serving software applications, or distributed amongst a cluster of computers. Based on a current configuration mode of the graph engine, a software application receives or generates an analysis request to process a graph. The software application provides the analysis request to the graph engine in exchange for access to a computational future, of the graph engine, that is based on the analysis request and the graph. Based on a proxy of said computational future, the software application accesses a result of the analysis request. In an embodiment, a remote proxy exchanges representational state transfer (REST) messages.

Abstract: Disclosed in some examples are methods, systems, and machine-readable mediums which automatically determine network-based data sources for information ingestion and profile data completion. This method can be applied to automatically increase the library of network-based data sources utilized by the system to ingest profile information. This allows for more a complete tracking of member accomplishments and attributes and ultimately, allows for more complete member profiles. Before specific methods and systems for automatically determining network-based data sources are discussed, an overview of the process of ingesting information from network-based data sources and matching that information to members of the social networking service will be described.

Abstract: In one embodiment, a method includes receiving a text post from a client system of a first user of an online social network and parsing the text post to identify a query associated with the post. The method includes receiving one or more comments responsive to the text post from one or more second users of the online social network and determining, for each of the comments, whether the comment includes a recommendation responsive to the query. Moreover, the method includes identifying, for each comment with a responsive recommendation, one or more objects of the online social network associated with the recommendation and generating an aggregated recommendation list responsive to the query, where the list includes references to one or more of the identified objects.

Abstract: The disclosed embodiments provide a system for performing multi-tenancy distribution of a graph database cache. During operation, the system obtains a cache of a set of records in a graph database storing a graph, wherein the graph includes a set of nodes, a set of edges between pairs of nodes in the set of nodes, and a set of predicates. Next, the system identifies one or more records in the cache that fail a validation test. The system then merges a remainder of the cache with online updates to the subset of records to produce a merged version of the cache. Finally, the system distributes the merged version to one or more instances of the graph database for use in processing queries of the graph database.

Abstract: In one embodiment, a method including maintaining an index of a plurality of nodes of a social graph, each node being associated with an assigned value, wherein the value for each node is calculated based at least in part on one or more factors. The method further includes receiving, from a client device of a first user, a query from the first user, searching the index to identify a top N nodes having the highest assigned values that match the query, ranking the identified nodes based at least in part on the query, and sending, to the client device of the first user for display, a search-results interface responsive to the received query, the search-results interface comprising M search results corresponding to the top M ranked nodes, respectively.

Abstract: A computer-implemented method for supplying a recommendation for an item. The method is performed by at least one processor. The method comprises a step of, upon receiving user information, providing user nodes, each representing one of a plurality of users of a social network.

Abstract: Techniques herein accelerate graph querying by caching neighbor vertices (NVs) of super-node vertices. In an embodiment, a computer receives a graph query (GQ) to extract result paths from a graph in a database. The GQ has a sequence of query vertices (QVs) and a sequence of query edges (QEs). The computer successively traverses each QE and QV to detect paths of the graph that match the GQ. Traversing each QE and QV entails retrieving NVs of a current graph vertex (CGV) of a current traversal path. If the CGV is a key in a cache whose keys are graph vertices having an excessive degree, then the computer retrieves NVs from the cache. Otherwise, the computer retrieves NVs from the database. If the degree is excessive, and the CGV is not a key in the cache, then the computer stores, into the cache, the CGV as a key for the NVs.

Abstract: A tool for processing a multi-modal network to reduce modality. The tool converts the multi-modal network into a modelled network based, at least in part, on the weighted value assigned to each of the plurality of links. The tool eliminates one or more of the plurality of entities not designated as an entity of interest from the modelled network. The tool converts the modelled network into a uni-modal network.

Abstract: A system and method includes providing a graph having a plurality of paths from data. Each of the paths is classified into one of a plurality of classes based upon a criterion. Each of the paths are associated with indicia for representing paths of a class on the graph as being visually distinct from paths of another class on the graph.

Abstract: A memory device having a memory array with a plurality of memory addresses and a controller operably coupled to the memory array is described. The controller is configured to store a sketch comprising d rows and w columns, wherein d and w are positive integers. Each of the d rows corresponds to a different one of d hash functions. The controller is also configured to detect an event associated with a first memory address of the plurality of memory addresses and to hash the first memory address with each of the d hash functions to generate a corresponding d sketch locations. The controller is further configured to adjust, for each of the d sketch locations, a stored sketch value by a first amount corresponding to the event.

Abstract: Embodiments of the present invention relate generally to marketing products through a social networking system. More specifically, one or more embodiments of the present invention relate to allowing social networking users to purchase products through the social networking system and to add products to shopping carts associated with third-party merchants.

Abstract: Dataflow optimization is described for extractions from a data depository. In one example an object-relationship graph of a data extraction definition is traversed in a first pass. The object-relationship graph has a node for each object. The steps from each node of the graph in the first pass is determined. It is determined if any of the determined steps are repeated. A single instance of each repeated step is placed before other steps in a query plan. Data is then extracted in a second pass from the object-oriented database system according to the object-relationship graph by performing the repeated steps first and then reusing the repeated steps in other determined steps.

Abstract: Some embodiments provide a program that receives from a client device a dimension value for a first dimension in a plurality of dimensions of a data model and a measure in a set of measures of the data model. The program further determines a cardinality of dimension values for each dimension in the plurality of dimensions. The program also selects a subset of dimensions in the plurality of dimensions based on the cardinalities of dimension values for the plurality of dimensions. The program further sends the subset of dimensions in the plurality of dimensions to the client device. The program also receives from the client device a request for a chart visualization comprising data values associated with the measure and categorized according to a second dimension in the subset of dimensions. In response to the request, the program further sends the chart visualization to the client device.

Abstract: A method can include comparing a first feature vector detailing features of an image of a newsfeed of a user of users of a social network to a subset of second feature vectors detailing features of newsfeeds presented to the users of the social network; and in response to determining the first feature vector matches a second feature vector of the subset of second feature vectors, providing a name, profile data, and profile picture of a user associated with the newsfeed.

Abstract: A memory device having a memory array and a controller operably coupled to the memory array is described. The controller is configured to store a sketch comprising d rows and w columns, wherein d and w are positive integers. Each row corresponds to a different one of d hash functions. The controller is also configured to detect an event associated with a memory address and to hash the memory address with each of the d hash functions to generate a corresponding d sketch locations. The controller is further configured, for each of the d sketch locations, to set a detection window flag, if it is not already set, and to adjust a stored sketch value by an amount corresponding to the event. The controller is also configured to evaluate a summary metric corresponding to the stored sketch value in each of the d sketch locations to determine if a threshold value has been reached.

Abstract: There are provided means for implementing an interface to view and explore socially relevant concepts of an entity graph including, for example, means of a social network system to perform operations including retrieving contextually relevant data for a plurality of concepts within an entity graph of the social network system; retrieving socially relevant data for a user's node within a social graph of the social network system; identifying intersects between the plurality of concepts within the entity graph and the social relevant data for the user's node within the social graph; selecting one of the plurality of concepts within the entity graph based on the intersects identified; and displaying the one of the plurality of concepts within the entity graph at a user interface associated with the user's node.

Abstract: A method, system and computer-usable medium are disclosed for using travel-related cognitive graph vectors.

Abstract: In particular embodiments, a method by a social-networking system comprises receiving, from a client device, a search query from a first user of an online social network, determining, by the social-networking system, one or more network resources that match the search query, accessing a data store of social-graph information to determine one or more second users of the online social network having an association with the first user that have interacted with any of the matching network resources within a particular period of time, ranking the network resources based on a degree of relevance associated with each of the network resources with respect to the search query, and sending, to the client device in response to the search query, one or more search results corresponding to one or more of the matching network resources.

Abstract: A method, apparatus and computer program product are provided for serializing and de-serializing objects such that data may be transmitted between disparate systems otherwise having incompatible object definitions. The disparate systems may include different versions of the same system or completely different systems. Object graphs may be recursively broken down into primitive components, and the data may be reformatted as maps of primitive data chained together. The data may be transmitted to a disparate recipient system and reassembled into objects recognizable by the disparate recipient system. Various systems can then communicate with each other regardless of underlying data formats.

Abstract: Disclosed is a multi-dimensional decomposition computing method and system, related to the field of multi-dimensional decomposition computing technique, applicable to performing multi-dimensional decomposition on big data to reduce computation complexity. The method executes: generating an recursion topology based on pre-processed big data; the recursion topology comprising dimension combination and recursion path among the dimension combinations; based on default fixed strategy, defining a fixed dimension combination and defining a computation path forming an optimized fixed dimension combination; based on the recursion topology, generating computation tasks; and based on the fixed dimensional combination and the computation path of the optimized fixed dimension combination, activating the computation tasks, computing the computation tasks and obtaining computing results. The disclosed solution is applicable to multi-dimensional decomposition.

Abstract: In one embodiment, a social-networking system may access an enhanced search index of an online social network. The enhanced search index may include data from a social graph having a plurality of nodes and a plurality of edges connecting the nodes, where the nodes comprise a plurality of internal nodes corresponding to entities associated with the online social network, and a plurality of external nodes corresponding to objects associated with a third-party system. The social-networking system may then search the enhanced search index in response to a query received from a user to identify objects that substantially match the query. Each identified object may be scored by the social-networking system based at least in part on a connectivity of the corresponding external node to the one or more internal nodes. In response to the query, the social-networking system may send a search-results page referencing objects based on their scores.

Abstract: A method and apparatus for adaptive data repartitioning and adaptive data replication is provided. A data set stored in a distributed data processing system is partitioned by a first partitioning key. A live workload comprising a plurality of data processing commands is processed. While processing the live workload, statistical properties of the live workload are maintained. Based on the statistical properties of the live workload with respect to the data set, it is determined to replicate and/or repartition the data set by a second partitioning key. The replicated and/or repartitioned data set is partitioned by the second partitioning key.

Abstract: A social networking system selects a set of groups for presentation to a user of the social networking system. To select groups, the social networking system determining scores for various groups representing a likelihood of the user interacting with the groups. When determining a score for a group, the social networking system accounts for a likelihood of the user providing content to the group as well as the user accessing or viewing content associated with the group. Based on the scores, one or more groups are selected and presented to the user. Additionally, the social networking system may apply one or more diversity rules so that the selected groups have a variety of characteristics.

Abstract: Equivalent concepts expressed across multiple domains are matched and associated with a metapage generated by a social networking system. User preferences expressed on multiple domains, represented as pages in a social networking system, may be organized by concept and shared with advertisers, third-party developers, and other users using the metapages generated for the concepts. Aggregated social information may be presented to users viewing a page associated with a metapage. Information presented on external websites may be used to link pages across multiple domains with a metapage generated on the social networking system. Information on other external websites associated with the metapage may be presented as links on the pages associated with the metapage. Feedback from users may be used to include or exclude pages from being associated with a generated metapage. A best page for a concept embodied in multiple pages may be determined using a hierarchy of rules.

Abstract: Systems, methods, and other embodiments associated with content invalidation are described. One example method includes parsing a response to identify an invalidation directive. Then if identified, invalidating cached content from a cache memory that corresponds to the content identified by an invalidation directive.

Abstract: A system gathers information on important and influential people and builds a social graph. The system regularly sends news alert messages to users. This can help users nurture their relationship with persons they are connected to, by providing them with updates on news and other events that happen to persons they are connected to. The watch can be customized with a variety of options, such as including related entities, organizing news alerts with user data, and other options.

Abstract: A tool for processing a multi-modal network to reduce modality. The tool determines a plurality of entities connected by a plurality of links within a multi-modal network. The tool assigns a weighted value to each of the plurality of links connecting the plurality of entities. The tool converts the multi-modal network into a modelled network based, at least in part, on the weighted value assigned to each of the plurality of links. The tool eliminates one or more of the plurality of entities not designated as an entity of interest from the modelled network. The tool converts the modelled network into a uni-modal network.

Abstract: A system stored in a non-transitory medium executable by processor circuitry is provided for generating sponsored verbs and contexts. The system includes interface circuitry for receiving a search query from a user device and query processing circuitry for identifying search results comprising entity search result objects and non-entity search result objects related to the search query. Targeting circuitry determines a set of verb keywords associated with the search result objects and analytics circuitry selects one or more sponsored verbs for at least one entity or non-entity search result. Display logic circuitry is communicatively coupled to the interface circuitry and dynamically generates interface elements for each of the one or more sponsored verbs, and displays, in response to the search query, the interface elements as a sub-component of the at least one entity or non-entity search result.

Abstract: A social networking system allows a first user to provide contact information for a second user via a synchronization or upload event from a computing device. The second user is prompted as to whether he or she wishes to share the received contact information on his public profile. If he or she responds affirmatively, the updated contact information is stored in association with the second user's profile on the social networking system. If the user responds negatively, the contact information is stored on the social networking system in association with the uploading user.

Abstract: In one embodiment, a method includes receiving unstructured text from a user of a social-networking system, determining whether the unstructured text includes a request for a recommendation, identifying one or more first entity names in the unstructured text, generating a structured query based upon the one or more first entity names, identifying, in the social graph, one or more second entity names corresponding to the structured query, and presenting the one or more second entity names and the unstructured text in a social context of the user. The unstructured text may include text of a post or message generated by the user on a social-networking system. A score may be generated based on the unstructured text to determine whether the text includes a request for recommendation using a machine-learning model based on comparison of the unstructured text to the one or more predetermined words associated with requests for recommendation.

Abstract: Methods and systems are provided for facilitating access to a cloud-based logging service. According to one embodiment, access to a cloud-based logging service is integrated within a network security appliance by automatically configuring access settings for the logging service and creating an account for the security appliance with the logging service. A log is created within the logging service by making use of the automatically configured access settings and the account. A request is received by the security appliance to access data associated with the log. Responsive thereto and without requiring separate registration of a network administrator with the cloud-based logging service, the data is retrieved by the security appliance from the logging service and is presented via a graphical user interface of the security appliance.

Abstract: In one embodiment, a method includes receiving, from a client device of a first user, a text string inputted by the first user, generating a set of suggested queries based on the text string, each suggested query in the set being based on a string generated by a grammar of a grammar model and comprising the text string of the query and one or more tokens inserted by the grammar model, calculating, for each suggested query in the set, a quality score based on an insertion cost of the one or more tokens inserted by the grammar model, filtering the set to remove one or more suggested queries from the set based on the respective quality scores of the suggested queries, and sending, to the client device, one or more of the suggested queries from the post-filtered set for presentation to the first user.

Abstract: Embodiments are disclosed for improving cache or memory efficiency of a social network system. A method according to some embodiments includes steps of: receiving an instruction to improve cache or memory efficiency of social graph data of a social graph; generating based on the social graph a partitioning tree including multiple bottom-level buckets, the partitioning tree dividing the vertices of the social graph into the bottom-level buckets and ordering the bottom-level buckets such that a social network metric regarding the vertices is optimized; assigning user IDs to the vertices of the social network in a numerical sequence based on the ordering of the bottom-level buckets; storing the social graph data of the users in storage locations in an order according to the numeral sequence of the assigned user IDs of the vertices.

Abstract: In one embodiment, a method includes identifying a first node and a second node in a social graph. The historical location data is available for the first node and for the second node. The method also includes accessing one or more component metrics for computing a geo-metric. The geo-metric represents an assessment of a spatial commonality between the first node and the second node. The spatial commonalities are determined based on historical location data stored for the first node and historical location data stored for the second node. The method also includes accessing one or more coefficients each corresponding to one of the component metrics; calculating the geo-metric by applying the received coefficients to the component metrics and combining the component metrics; and providing the calculated geo-metric.

Abstract: This application is directed to an indexing system for graph data. In particular implementations, the indexing system uses a database index infrastructure that provides for flexible search capability to data objects and associations between data objects. Particular embodiments relate to an indexing system for storing and serving information modeled as a graph that includes nodes and edges that define associations or relationships between nodes that the edges connect in the graph.

Abstract: Techniques for identifying, in a target graph, subgraphs that match a query graph are provided. Processing a query graph comprises multiple stages, one for each query node in the query graph. In the first stage, a query node is selected, different portions of the target graph are assigned to different threads, each thread identifies nodes that match the selected query node and stores the identities of those nodes in storage that is local to the thread. The results of each thread are then stored in a “global” data structure. In the second stage, a second query node is selected and different portions of the global data structure are assigned to different threads. Each thread identifies nodes that match the second query node and that are connected to a previously-matched node. The second stage repeats until all nodes in the query graph are processed.

Abstract: It is provided a method for constructing a graph representation for a 3D object, wherein comprising the steps of generating an initial graph representation for the 3D object, wherein a node in the initial graph representation corresponds to a component of the 3D object and a symmetric indication value uniquely identifying a symmetric group is associated with a symmetric node; selecting two nodes from one symmetric group that has the most symmetric nodes, wherein the distance between the two nodes are the largest among distance between any other two nodes within the symmetric group; obtaining two set of nodes by expanding separately from the two nodes to their directly connected nodes, wherein if a node is connected directly to both two nodes, the node is excluded from the two set of nodes; and if determining that the two sets of nodes match, updating the graph representation by grouping each set of nodes into one node.

Abstract: Systems and methods for checking for region consistency and table integrity problems and automatically repairing a corrupted HBase cluster. The methods and systems operate in a diagnostic mode and a diagnostic and repair mode. The methods include fixing table integrity problems, such as backwards table regions, table region holes, table region overlap, and the like to restore table integrity invariant. Once the table integrity has been restored, each row key resolves to exactly one region. The methods further include fixing region inconsistencies, such as bad region assignment, no region present in the meta table, region information not in the Hadoop Distributed File System (HDFS), and the like to restore region consistency invariant. The information in the HDFS is taken as ground truth and any meta table or assignment problems that are inconsistent with the HDFS is deemed wrong and removed.

Abstract: Exemplary methods, apparatuses, and systems receive a request from a first user of a social networking system, during a first time period, to share a content item with a plurality of second users that are connected to the first user via a set relationship. A snapshot of the plurality of second users during the first period of time is created. During a second time period that is subsequent to the first time period, a request to view content items is received from a third user that became connected to the first user via the set relationship after the first time period. The content item shared during the first time period is excluded from content items shared with the third user in response to determining that the content item is associated with the PLS and that the third user is not in the PLS.

Abstract: The disclosed embodiments provide a system that facilitates user interaction. During operation, the system obtains user data for a first user and a second user connected to the first user in a social network. Next, the system uses the user data to calculate one or more influence scores between the first and second users. The system then constructs an influence graph of a set of users comprising the first and second users by creating a first node representing the first user, creating a second node representing the second user, and using the one or more influence scores as edge weights of directed edges between the first and second nodes. Finally, the system uses the influence graph to facilitate interaction among the users.

Abstract: Techniques for presenting a personalized member profile page to a viewer are described. A highlight module can receive a request to view a profile page of a member in a social network. The highlight module can access viewer data of a viewer associated with the request, and access member data of the member. Additionally, the highlight module can determine a plurality of member attributes relevant to the viewer based on the viewer data, the plurality of member attributes being derived from the member data. Furthermore, the highlight module can calculate an overall score for a member attribute in the plurality of member attributes based on the viewer data and the member data. Subsequently, a profile generation module can cause a presentation, on a display of a device, of the member attribute on the profile page, when the overall score of the member attribute is higher than a predetermined threshold value.

Abstract: An approach is provided for managing split and merge operations for information spaces with respect to their information content.