Patent application number | Description | Published |
20120221581 | Automatically Generating Nodes and Edges in an Integrated Social Graph - In one embodiment, a method includes maintaining a data store of nodes and edges and for each of one or more users: scanning items of content associated with the corresponding user node; identifying a candidate item of content; searching for matches between the candidate item of content and existing nodes; determining whether or not a match between the candidate item of content and an existing node exists; and when it is determined that at least one match exists, generating an edge from the user node to the existing node for which the best match is determined; and when it is determined that no match exists, generating a new node based on the candidate item of content, and generating an edge from the user node to the new node. | 08-30-2012 |
20130124624 | ENABLING PREFERENCE PORTABILITY FOR USERS OF A SOCIAL NETWORKING SYSTEM - 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. | 05-16-2013 |
20130124625 | DETERMINING A COMMUNITY PAGE FOR A CONCEPT IN A SOCIAL NETWORKING SYSTEM - 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 of the social networking system using the metapages generated for the concepts. Aggregated social information may be presented to users of the social networking system 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, presenting the information on other external websites associated with the metapage 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. | 05-16-2013 |
20130124626 | SEARCHING TOPICS BY HIGHEST RANKED PAGE IN A SOCIAL NETWORKING SYSTEM - 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 of the social networking system using the metapages generated for the concepts. Aggregated social information may be presented to users of the social networking system 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. A best page may be determined for a concept embodied in multiple pages on the social networking system using a hierarchy of rules. A best page may also be determined for a user based on information about the user. | 05-16-2013 |
20130124627 | PROVIDING UNIVERSAL SOCIAL CONTEXT FOR CONCEPTS IN A SOCIAL NETWORKING SYSTEM - 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 of the social networking system using the metapages generated for the concepts. Aggregated social information may be presented to users of the social networking system 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. Social context information may be provided on a page associated with a metapage for a viewing user that shows expressions of interest by other users on the page and other pages associated with the metapage. | 05-16-2013 |
20140025671 | CONTEXT-BASED OBJECT RETRIEVAL IN A SOCIAL NETWORKING SYSTEM - Embodiments improve the ability of users of a social networking system to search for information that is likely to be relevant to them by learning and/or applying a search context associated with selector components used to search for objects of the social networking system. The search context is specific to the use of an individual selector and thus need not be as general as the context of an entire page or set of pages in which selectors can be embedded. The social networking system may learn the context of a selector by monitoring user selections from prior search results performed using the selector. | 01-23-2014 |
20140040300 | Automatically Generating Nodes and Edges in an Integrated Social Graph - 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. | 02-06-2014 |
20150100591 | Determining a Community Page for a Concept in a Social Networking System - 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 of the social networking system using the metapages generated for the concepts. Aggregated social information may be presented to users of the social networking system 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. In one embodiment, the 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. In one embodiment, a best page may be determined for a concept embodied in multiple pages on the social networking system using a hierarchy of rules. In another embodiment, a best page may be determined for a user based on information about the user. In yet another embodiment, social context information may be provided on a page associated with a metapage for a viewing user that shows expressions of interest by other users on the page and other pages associated with the metapage. | 04-09-2015 |
20150161290 | Automatically Generating Suggested Queries in a Social Network Environment - In one embodiment, a method includes receiving, at a query form associated with a social network environment, a request from a first user of the social network environment, the request comprising a character string entered by the first user, identifying objects associated with the social network environment matching at least in part the character string of the request, and sending, to the query form for display to the first user, one or more suggested queries responsive to the request, wherein each suggested query comprises the character string of the request and references to one or more of the identified objects. | 06-11-2015 |
20150347525 | Context-Based Object Retrieval In A Social Networking System - Embodiments improve the ability of users of a social networking system to search for information that is likely to be relevant to them by learning and/or applying a search context associated with selector components used to search for objects of the social networking system. The search context is specific to the use of an individual selector and thus need not be as general as the context of an entire page or set of pages in which selectors can be embedded. The social networking system may learn the context of a selector by monitoring user selections from prior search results performed using the selector. | 12-03-2015 |
Patent application number | Description | Published |
20150112755 | Automated Identification and Evaluation of Business Opportunity Prospects - Embodiments identify and evaluate business opportunity prospects in an automated fashion. An engine receives one or more inputs used to identify business opportunities. These input(s) can comprise recent events gathered from external sources, for example feeds from news websites, and/or publicly-available business information (e.g. compiled by third parties). Other inputs can comprise information from internal sources, such as Enterprise Resource Planning (ERM) and/or Customer Relationship Management (CRM) applications. Still other inputs can comprise personalized user preferences, for example an industry and/or territory assigned to a particular user. From these input(s), the engine automatically generates a business lead, together with a score reflecting a strength of that lead. To this existing lead information (e.g. score, lead name, lead contact information, etc.), a user can manually add further information, for example monetary value and/or an closing date, in order to create a deal pipeline for visualization. | 04-23-2015 |
20150112756 | Automated Software Tools for Improving Sales - A sales application is described that includes multiple automated sales tools that can be combined to help improve sales within a sales team. A deal finder sales tool is described to help identify sales opportunities. A deal playbook sales tool is also described to help structure the sales opportunity into a sales play by recommending products to sale in conjunction and also constructing a sales team. An influencer sales tool is also described to help identify business relationships that can be utilized to influence members of the sales team. | 04-23-2015 |
Patent application number | Description | Published |
20140108633 | System and Method for Flexible Distributed Massively Parallel Processing (MPP) - An embodiment method for massively parallel processing includes initiating a management instance on an initial machine, the management instance generating an initial partition corresponding to the initial machine, determining a total number of partitions desired for processing a database, the total number of partitions including the initial partition, determining a number of additional machines available to process the database, grouping the initial machine and the additional machines together in a pod, and launching the management instance on the additional machines in the pod to generate the total number of partitions desired for the database. Additional embodiment methods and an embodiment system operable to perform such methods are also disclosed. | 04-17-2014 |
20140122484 | System and Method for Flexible Distributed Massively Parallel Processing (MPP) Database - An embodiment method for massively parallel processing includes assigning a primary key to a first table in a database and a foreign key to a second table in the database, the foreign key of the second table identical to the primary key of the first table, determining a number of partition groups desired for the database, partitioning the first table into first partitions based on the primary key assigned and the number of partition groups desired, partitioning the second table into second partitions based on the foreign key assigned and the number of partition groups desired, and distributing the first partitions and the second partitions to the partition groups as partitioned. An embodiment system for implementing the embodiment methods is also disclosed. | 05-01-2014 |
20140156666 | Method for Automated Scaling of a Massive Parallel Processing (MPP) Database - A massively parallel processing (MPP) database can be re-partitioned/re-balanced while remaining on-line through a staged migration procedure. Staged migration may include a first stage and a second stage. During the first stage, entries in an existing partition are reallocated to the new partition, and the catalog is updated to associate the re-allocated entries with both the existing partition and the new partition such that queries for the re-allocated entries are directed toward the existing partition and the new partition. During the second stage, the re-allocated entries are migrated from the existing partition to the new partition, and after the migration is complete, the catalog is re-updated to associate the migrated entries with the new partition such that new queries are directed toward the new partition. | 06-05-2014 |
20140188841 | Method for Two-Stage Query Optimization in Massively Parallel Processing Database Clusters - Queries may be processed more efficiently in an massively parallel processing (MPP) database by locally optimizing the global execution plan. The global execution plan and a semantic tree may be provided to MPP data nodes by an MPP coordinator. The MPP data nodes may then use the global execution plan and the semantic tree to generate a local execution plan. Thereafter, the MPP data nodes may select either the global execution plan or the local execution plan is accordance with a cost evaluation. | 07-03-2014 |
20140280020 | System and Method for Distributed SQL Join Processing in Shared-Nothing Relational Database Clusters Using Self Directed Data Streams - System and method embodiments are provided for improving the performance of query processing in a massively parallel processing (MPP) database system by pushing down join query processing to data nodes recursively. An embodiment method includes receiving, at a coordinator process, a join query associated with a plurality of tables of the MPP database system, generating, at the coordinator process, an execution plan tree for the join query, and processing, at each of a plurality of data nodes communicating with the coordinator process, the execution plan tree to obtain join query results. The method further includes, upon detecting a next join operator below a top join operator in the execution plan tree at each of the data nodes, forwarding to the other data nodes a sub-tree for the next join operator, and receiving, at each of the data nodes from the other data nodes, sub-tree processing results. | 09-18-2014 |
20150227586 | Methods and Systems for Dynamically Allocating Resources and Tasks Among Database Work Agents in an SMP Environment - Dynamically re-allocating tasks and/or memory quotas amongst work agents in symmetric multiprocessing (SMP) systems can significantly mitigate delays and inefficiencies associated with data skew. For example, unfinished tasks can be reallocated from a busy work agent to an idle work agent upon determining that the idle work agent has finished processing its originally assigned set of tasks. Alternatively, a portion of a memory quota assigned to an idle work agent can be reallocated to a busy work agent for use in processing the remaining tasks. Memory quotas can be re-assigned by releasing the memory quota back into a memory pool once the idle work agent has finished processing its originally assigned tasks, and then reallocating some or all of the memory quota to the busy work agent. | 08-13-2015 |