Abstract: A database benchmark configuration is selected via an interface. At least one database partitioning scheme from a plurality of database partitioning schemes is selected via the interface. The selected database partitioning scheme is configured through the interface. The selected database partitioning scheme is evaluated based on the configuring step and the selected database benchmark configuration, and evaluation results are generated. A presentation is generated for the interface based on at least a portion of the evaluation results, wherein the presentation is configured to provide at least an indication of a performance of the selected database partitioning scheme given the configuring step and the selected database benchmark configuration.

Abstract: In one embodiment, one or move computing devices receive, from a client device of a first user, a query corresponding to a first node type of a plurality of node types. The computer devices search one or more search indices to identify one or more nodes of a social graph matching the query. The search indices maintain an index of a plurality of nodes of the first node type, each node of the plurality of nodes having a static rank which is based at least in part on a pre-calculated value for each node. The computer devices send, to the client device of the first user for display, a search-results interface responsive to the received query. The search-results interface includes reference to one or more nodes each corresponding to the first node type and having a static rank greater than a threshold rank.

Abstract: A method for profile matching includes receiving a plurality of user profiles, each user profile comprising traits of a respective user. The method includes receiving a preference indication for a first user profile of the plurality of user profiles. The method also includes determining a potential match user profile of the plurality of user profiles based on the preference indication for the first user profile. The method also includes presenting the potential match user profile to a second user.

Abstract: A computer implemented method for a user of a network to locate one or more human resources, the method comprising the steps of: providing a record in a database for each of a plurality of human resources, the record including one or more keywords associated with the human resource; receiving from a first user a search request including one or more keywords; searching the records in the database to find matching records associated with one or more human resources with a keyword that matches a keyword in the received search request; and returning search results to the first user, the search results identifying the matching records.

Abstract: A method, system, and computer program product is disclosed for caching results in a client-side cache. Embodiments of a method, a system, and a computer program product are disclosed that associate a first snapshot of a database with a client that indicates a state of the database after a last database request by the client, and indicate any number of invalid cached results in the client cache for the client based upon the first snapshot. In some embodiments, the method further includes receiving a second snapshot that indicates a state of the database upon receipt of a database server request by the client, and updating the first snapshot with the second snapshot.

Abstract: The technology disclosed relates to identifying connection maps between entities (persons and organizations) and generating so-called connection stories between them based on the connection maps. The connection stories are graphic and visual representations of the connection paths that present to entities topological and chronological aspects of their relationships with other entities.

Abstract: Particular embodiments may store, at a client device, information associated with nodes and edges of a social graph. A node may comprise a user node or a concept node. Each node may be connected by edges to other nodes of the social graph. A first user may be associated with a first user node of the social graph. The client device may receive a character string from the first user, and identify, as the first user inputs the character string, an edge-type based on the character string and one or more edges of the identified edge-type, wherein the edges are locally stored on the client device. The client device may display one or more predictive typeahead results based on the identified edge-type and the identified edges. The predictive typeahead results may correspond to nodes stored locally on the client device.

Abstract: Described are methods, systems and computer readable media for dynamic join operations.

Abstract: A server array controller that includes a Data Flow Segment (DFS) and at least one Control Segment (CS). The DFS includes the hardware-optimized portion of the controller, while the CS includes the software-optimized portions. The DFS performs most of the repetitive chores including statistics gathering and per-packet policy enforcement (e.g. packet switching). The DFS also performs tasks such as that of a router, a switch, or a routing switch. The CS determines the translation to be performed on each flow of packets, and thus performs high-level control functions and per-flow policy enforcement. Network address translation (NAT) is performed by the combined operation of the CS and DFS. The CS and DFS may be incorporated into one or more separate blocks. The CS and DFS are independently scalable. Additionally, the functionality of either the DFS or the CS may be separately implemented in software and/or hardware.

Abstract: A method for improving information exchange in a social network environment. Actions (e.g., copying) being performed on an electronic object (e.g., e-mail) are detected. Furthermore, the entry of the electronic object in a social networking website is detected thereby identifying an association between this electronic object and this social networking website. Rule patterns are identified based on these detected actions and these associations. Indications of these associations are stored in terms of concept nodes in a hierarchical tree using the identified rule patterns. Social networking feeds of interest are then searched using the hierarchical tree as well as a current electronic object of a user (e.g., status message on a social networking feed, e-mail). The user would then be provided an opportunity to repost an information nugget from the current electronic object in one or more of these social networking feeds of interest.

Abstract: Disclosed can improve rights list management as well as performance of systems utilizing an access control list. A database server having a transitive closure management module may receive an identification of an entity defined in a database storing a cached transitive closure. The transitive closure management module may incrementally update the cached transitive closure stored in the database by generating a new transitive closure for the entity and determining a delete transitive closure record. The delete transitive closure record may be determined by analyzing the cached transitive closure and the new transitive closure, determining a first transitive closure path for the entity that is not specified in the new transitive closure and that is specified in the cached transitive closure, and selecting as the delete transitive closure record a record specifying the first transitive closure path. The delete transitive closure record can then be deleted from the cached transitive disclosure.

Abstract: In one embodiment, a method includes, by one or more computing devices of an online social network, receiving, from a mobile-client system of a first user of the online social network, geographic-location information associated with the mobile-client system. The method further includes identifying multiple candidate place-entities associated with the online social network that correspond to the geographic-location information, where each candidate place-entity is associated with a particular geographic location. The method also includes determining, for each candidate place-entity, a confidence score based on the geographic-location information associated with the mobile-client system and a location-probability distribution associated with the candidate place-entity, where the confidence score represents a probability that the first user is located at the candidate place-entity.

Abstract: In one embodiment, a method includes receiving an text query inputted by a first user from a client device of the first user, generating a set of structured queries based on the text query, each structured query in the set corresponding to a grammar of a context-free grammar model, wherein each structured query is based on a natural-language string generated by a grammar of the context-free grammar model and comprises one or more tokens, wherein one or more of the tokens of each structured query correspond to one or more objects associated with the online social network, respectively, filtering the set to remove one or more structured queries from the set, each removed structured query having a quality score less than a threshold quality score, and sending one or more of the structured queries from the post-filtered set to the client device of the first user for display.

Abstract: Techniques for cross platform user joining are disclosed. In some embodiments, cross platform user joining includes associating a first user identification (UID) and a second UID with one or more Internet Protocol addresses (IPs); associating the first UID and the second UID with one or more monitored behaviors; and joining the first UID and the second UID based on the one or more IPs and the one or more monitored behaviors.

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: Particular embodiments may retrieve information associated with one or more nodes of a social graph from one or more data stores. A node may comprise a user node or a concept node. Each node may be connected by edges to other nodes of a social graph. A first user may be associated with a first user node of the social graph. Particular embodiments may detect that the first user is entering an input term. Predictive typeahead results may be provided as the first user enters the input term. The predictive typeahead results may be based on the input term. Each predictive typeahead result may include at least one image. Each predictive typeahead result may correspond to at least one node of the social graph.

Abstract: A computer-implemented method for finding related datasets includes, for each reference dataset from multiple reference datasets, determining domains and geographies for a user dataset and the reference dataset, obtaining a weighted domain coefficient and a weighted geography coefficient using the determined domains and geographies for the user dataset and the reference dataset, calculating a correlation coefficient between the user dataset and the reference dataset and calculating a semantic filtering coefficient for the user dataset and the reference dataset using the calculated correlation coefficient, the weighted domain coefficient and the weighted geography coefficient.

Abstract: In one embodiment, one or more computing devices receive, from a client device of a first user, a query from the first user. The computer devices search a social graph to identify one or more nodes of the social graph that are relevant to the query. The computer devices obtain a static rank for each identified node. The static rank is based at least in part on a number of edges of a particular edge type that are connected to the node in the graph or attributes of edges connected to the node in the graph. The computer devices send to the client device of the first user for display, a search-results page responsive to the received query. The search-results page includes reference to one or more nodes having a static rank greater than a threshold rank.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for dynamic graph performance monitoring. One of the methods includes receiving multiple units of work that each include one or more work elements. The method includes determining a characteristic of the first unit of work. The method includes identifying, by a component of the first dataflow graph, a second dataflow graph from multiple available dataflow graphs based on the determined characteristic, the multiple available dataflow graphs being stored in a data storage system. The method includes processing the first unit of work using the second dataflow graph. The method includes determining one or more performance metrics associated with the processing.

Abstract: In one embodiment, a method includes receiving a request at a wireless access point from a client system to access a network through the wireless access point. The wireless access point sends an identifier associated with the client system to a social-networking system, the social-networking system including user profiles arranged in one or more social graphs. The social graphs store relationships between the user profiles. The method further includes receiving at the wireless access point from the social-networking system an authorization determination. The authorization determination is based upon a first user profile of the plurality of user profiles. The first user profile includes the identifier associated with the client system. The method further includes providing the client system with access to the network through the wireless access point in accordance with the authorization determination.

Abstract: Each user is represented by a mixture of topics, e.g., one or more topics, and a probability of interest in each topic in the mixture, and given the target user, one or more other users can be recommended, each user that is recommended to the target user is determined to have a topical interest similarity with the target user, e.g., the target user's interest in one or more topics of the mixtures of topics is determined to be similar to a recommended interest in the one or more topics of the mixture of topics. The target user and the one or more recommended users can be said to have similar topical interests. The target user can use the user recommendation to establish an interactive dialogue, for example, with one or more users identified in the user recommendation.

Abstract: In one embodiment, a method includes determining available media content from one or more content sources, providing at least a portion of the available media content for display on a display device of a user, and determining whether a media action button should be displayed on the display device. The media action button is provided for display on the display device when it is determined that the media action button should be displayed. The media action button is operable to perform an action associated with particular available media content.

Abstract: In order to facilitate efficient storage and extraction of data, a system may represent a compound relationship in a graph stored in a graph database. In particular, the system (or a user) may define the compound relationship based on two or more predicates associated with two or more edges between two or more nodes in the graph. Then, the system may generate, in the graph, a hub node that corresponds to the compound relationship and that has an identifier that is hidden from users of the graph so that the identifier of the hub node is not visible external to the graph database. Moreover, the identifier of the hub node may be specified in a query using the two or more predicates, thereby allowing data associated with the compound relationship to be readily identified, modified and/or extracted.

Abstract: In order to request desired information from a graph database, a system executes a query against the graph database. The graph database may store a graph that includes nodes, edges between the nodes, and predicates to represent and store data with index-free adjacency. Moreover, the query may identify a first edge associated with a predicate that specifies one or more of the nodes in the graph. In response to the query, the system receives a result that includes a subset of the graph. Then, the system may verify the subset of the graph. In particular, the system may verify that the subset of the graph includes one or more particular edges, such as an edge with the predicate in the query. Furthermore, the system may verify that the subset of the graph includes data and/or associated structure in the portion of the graph.

Abstract: In order to request desired information from a graph database, a system executes a query against the graph database. The graph database may store a graph that includes nodes, edges between the nodes, and predicates to represent and store data with index-free adjacency. Moreover, the query may identify a first edge associated with a predicate that specifies one or more of the nodes in the graph. In response to the query, the system receives a result that includes a subset of the graph. Then, the system may use the result of the query in a concatenated set of queries. In particular, the system may execute a second query against the subset of the graph. Furthermore, in response to the second query, the system may receive a second result that includes a second subset of the graph.

Abstract: Systems and methods for visualizing and manipulating graph databases in accordance embodiments of the invention are disclosed. In one embodiment of the invention, a graph database manipulation device includes a processor and a memory configured to store a graph database manipulation application, wherein the graph database manipulation application configures the processor to obtain a graph database including a set of nodes and a set of edges, determine a source node within the set of nodes, locate a set of related nodes based on the source node and the set of edges, recursively locate a set of sub-related nodes based on the set of related nodes and the set of edges, generate a representation of the set of related nodes from the perspective of the source node, and recursively update the generated representation of the set of sub-related nodes from the perspective of the source node and the related nodes.

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: In one embodiment, a method includes maintaining access to a data store of information corresponding to nodes and edges; receiving a user-generated character string comprising one or more characters of text entered by a user in an input form as they are entered by the user; searching the stored information for matches between the user-generated character string and existing nodes; determining whether or not a match between the user-generated character string and an existing node exists; and when it is determined that at least one match exists, generating an edge between the node corresponding to the user and the node for which the best match is determined; and when it is determined that no match between the user-generated character string and an existing node exists, generating a new node based on the user-generated character string, and generating an edge between the node corresponding to the user and the new node.

Abstract: In one embodiment, a method includes receiving from a first user of an online social network a search query, searching data stores to identify objects that match the search query, where identifying the objects is also based in part on the privacy setting for each object, determining for each identified object a visibility of the object with respect to the first user, and generating one or more search results corresponding to the search query.

Abstract: Systems and techniques that can be used for analyzing a social network or any other type of entity networks. In an effort to preserve the privacy rights of individuals, a model of a real entity network can be generated that is a balanced representation of the entity network, and various tests can be performed on metadata in the model. For example, the model network can be generated based on only two data portions: the total number of nodes in the network and the number of relations per node.

Abstract: In one embodiment, one or more computing devices receive, from a client device of a first user, a query from the first user. The computer devices search a social graph to identify one or more nodes of the social graph that are relevant to the query. The computer devices obtain a static rank for each identified node. The static rank is based at least in part on a number of edges of a particular edge type that are connected to the node in the graph or attributes of edges connected to the node in the graph. The computer devices send to the client device of the first user for display, a search-results page responsive to the received query. The search-results page includes reference to one or more nodes having a static rank greater than a threshold rank.

Abstract: Embodiments related to calculating node centralities in large and complex networks and graphs. An aspect includes approximating a product of a matrix exponential and a random probe vector of an adjacency matrix, wherein the adjacency matrix represents a graph. A diagonal of the adjacency matrix is computed based on the product of the matrix exponential and the random probe vector. The node centralities are then calculated based on the computed diagonal until a designated number of central nodes has been detected according to embodiments.

Abstract: Relationship management systems in accordance with embodiments of the invention are configured to provide systematic ways for a user to measure, and manage relationships in the user's social network. One embodiment of the invention includes a relationship management server system, and a database. In addition, the relationship management server system is configured to store a user account associated with a user in the database, store information concerning contacts associated with the user in the database, store event information associated with the user and at least one of the stored contacts in the database, store at least one objective in the database, score at least one relationship between the user and a contact based upon stored event information associated with the user and the contact to create a scored relationship graph, and generate a recommendation concerning an action based upon the stored objective and the scored relationship graph.

Abstract: Technologies are generally described for systems, methods and devices effective to remove information from a network such as the Internet. In some examples, a device may include a memory including instructions and a processor configured in communication with the memory. The processor may be configured effective to receive user information relating to a user and search the network using the user information. In response to the search, the processor may find additional information relating to the user stored in the network. The processor may receive a first request to remove particular information from the network. The particular information may be part of the additional information and the particular information may be removable by a second user. The processor may send a second request to remove the particular information from the network.

Abstract: Embodiments of the present invention provide systems, methods and computer readable media for optimizing a data integration process. In embodiments, a system can be configured to represent the processing of a data record that includes attributes, and to use that representation to determine an optimal processing of that data record. In embodiments, the system represents the processing of a data record as an operator graph comprising nodes and edges, where each node is an operator node that represents an operator for implementing at least one logical operation on at least one of the attributes and each edge between a pair of nodes represents the movement of data between the nodes. In embodiments, each operator node includes one or more operator metrics (e.g. operator cost metrics and operator quality metrics). In embodiments, the system determines optimal processing of the data record by determining a best path within the operator graph.

Abstract: In one embodiment, a method includes accessing a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, receiving from a user an unstructured text query, generating a set of structured queries based on the text query, calculating a quality score based on the text query and the structured query for each structured query in the set, and filtering the set to remove each structured query having a quality score less than a threshold score.

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: Particular embodiments may retrieve information associated with one or more nodes of a social graph from one or more data stores. A node may comprise a user node or a concept node. Each node may be connected by edges to other nodes of a social graph. A first user may be associated with a first user node of the social graph. Particular embodiments may detect that the first user is entering an input term. Predictive typeahead results may be provided as the first user enters the input term. The predictive typeahead results may be based on the input term. Each predictive typeahead result may include at least one image. Each predictive typeahead result may correspond to at least one node of the social graph.

Abstract: The present technology relates to protocols relative to utility meters associated with an open operational framework. More particularly, the present subject matter relates to protocol subject matter for advanced metering infrastructure, adaptable to various international standards, while economically supporting a 2-way mesh network solution in a wireless environment, such as for operating in a residential electricity meter field. The present subject matter supports meters within an ANSI standard C12.22/C12.19 system while economically supporting a 2-way mesh network solution in a wireless environment, such as for operating in a residential electricity meter field, all to permit cell-based adaptive insertion of C12.22 meters within an open framework. Cell isolation is provided through quasi-orthogonal sequences in a frequency hopping network. Additional features relate to apparatus and methodology subject matters relating to Number-of-sons' management.

Abstract: Embodiments of the present disclosure relate to a computer system and interactive user interfaces configured to enable efficient and rapid access to multiple different data sources simultaneously, and by an unskilled user. The unskilled user may provide simple and intuitive search terms to the system, and the system may thereby automatically query multiple related data sources of different types and present results to the user. Data sources in the system may be efficiently interrelated with one another by way of a mathematical graph in which nodes represent data sources and/or portions of data sources (for example, database tables), and edges represent relationships among the data sources and/or portions of data sources. For example, edges may indicate relationships between particular rows and/or columns of various tables. The table graph enables a compact and memory efficient storage of relationships among various disparate data sources.

Abstract: A query parser that converts query definition into a query graph and decides the execution order of operators is installed, a set of consecutive operators in the execution order is called a stage, the total of calculation costs of operators configuring each stage is called a calculation cost of the stage, the query graph is divided into multiple stages such that the calculation cost of each stage becomes a value less than a value dividing the total cost of all operators by the number of calculation cores, and each calculation core extracts tuples one by one from an input stream, and, when taking charge of and executing processing of the tuples from the entrance to exit of the query graph, before the execution of each stage, confirms whether processing of the stage is completed for a tuple previous to a charge tuple.

Abstract: Techniques are described herein that are capable of deep cloning (a.k.a. deep copying) objects using a binary format. A deep clone of a designated object includes references to other objects (and potentially copies of the other objects) included in the designated object. A binary representation of each object in an object graph is generated to provide a binary clone of the object graph. Objects created by a dynamic language engine are called dynamic language objects. Objects created by a host (e.g., that hosts the dynamic language engine) are called host objects. Each host object is associated with an intermediate representation thereof via a property bag that describes properties of that host object. Each intermediate representation is understandable by the dynamic language engine. A binary representation of each dynamic language object and each host object may be generated in accordance with the binary format to provide the binary clone.

Abstract: A method for reconstruction includes providing a directed input graph generated from a set of n-grams and statistics for the n-grams, edges of the graph being joined through nodes of the graph. Each edge has an associated label and a multiplicity of at least one. Each of the n-grams in the set being represented by a respective one of the labels, whereby a Eulerian cycle through the graph traverses each edge the respective multiplicity of times. Reduction rules are applied iteratively to generate a refined graph which is both irreducible and equivalent to the input graph. Information is output based on the labels of the refined graph.

Abstract: The present invention provides a method and system for sharding a graph database. The graph computing includes one or more processors, and a memory module. The memory module contains instructions that, when executed by the one or more processors, causes the one or more processors to perform a set of steps including identifying a first set of nodes from a plurality of nodes and a second set of nodes from a plurality of nodes, generating one or more sub graph shards from the graph database, and storing the one or more sub graph shards on one or more data stores. Each sub graph shard of the one or more sub graph shards includes at least one node from the first set of nodes and a replica of the second set of nodes.

Abstract: Techniques for improved partitioning of a database for distribution in a data processing system. In one example, a method comprises the following steps. A database and a workload set associated with the database are analyzed. A hyper-graph is generated based on the analysis of the database and the workload set. The hyper-graph is partitioned into a partitioned hyper-graph. The partitioned hyper-graph is evaluated based on one or more partitioning constraints and/or one or more partitioning effect metrics. The partitioned hyper-graph is repartitioned when warranted by the evaluation step. A mapping is generated based on the partitioned hyper-graph that assigns at least one or more portions of the database to one or more nodes of a data processing system. The analyzing, hyper-graph generating, partitioning, evaluating, repartitioning and mapping generation steps are executed via at least one processor device.

Abstract: A system and method performed by a server for determining at least one user account that is influential for a topic: obtaining the topic; determining a plurality of user accounts within a social data network that are related to the topic; representing each of the user accounts as a node in a connected graph and determining an existence of a relationship between each of the user accounts; computing a topic network graph using each of the user accounts as nodes and the corresponding relationships as edges between each of the nodes; ranking the user accounts within the topic network graph to filter outlier nodes within the topic network graph; identifying at least two distinct communities amongst the user accounts within the filtered topic network graph, each community associated with a subset of the user accounts; identifying attributes associated with each community; outputting each community associated with the corresponding attributes.

Abstract: The technology disclosed relates to identifying connection maps between entities (persons and organizations) and generating so-called connection stories between them based on the connection maps. The connection stories are graphic and visual representations of the connection paths that present to entities topological and chronological aspects of their relationships with other entities.

Abstract: Aspects of the present disclosure provide techniques that determine whether each configuration item in a plurality of configuration items is associated with every other configuration item therein. If each configuration item in the plurality of configuration items is associated with every other configuration item therein, the plurality of configuration items are merged such that each attribute associated therewith is associated with one configuration item. If each configuration item in the plurality of configuration items is not associated with every other configuration item therein, it is determined whether at least one configuration item may be ignored.

Abstract: The present disclosure provides a method and a system for generating social graphs using coincident geolocation data. In particular, a method is provided in which an entity retrieves information from one or more databases. The information includes geolocation data for a plurality of entities generated over a predetermined period of time. The information is analyzed to determine coincident geolocation information of the entities. The coincident geolocation information is then analyzed to determine social relationships of the entities. One or more social graphs are then generated based on the social relationships of the entities. The social graphs comprise multi-node graphs having edges or connectors linking the nodes. The entities are represented by the nodes. A social relationship between the entities is represented by the edges or connectors linking the nodes. The attributes of the edges or connectors are based upon information describing a characteristic of the relationship.

Abstract: Embodiments of the present disclosure relate to a computer system and interactive user interfaces configured to enable efficient and rapid access to multiple different data sources simultaneously, and by an unskilled user. The unskilled user may provide simple and intuitive search terms to the system, and the system may thereby automatically query multiple related data sources of different types and present results to the user. Data sources in the system may be efficiently interrelated with one another by way of a mathematical graph in which nodes represent data sources and/or portions of data sources (for example, database tables), and edges represent relationships among the data sources and/or portions of data sources. For example, edges may indicate relationships between particular rows and/or columns of various tables. The table graph enables a compact and memory efficient storage of relationships among various disparate data sources.