Patent application number | Description | Published |
20090249004 | DATA CACHING FOR DISTRIBUTED EXECUTION COMPUTING - Embodiments for caching and accessing Directed Acyclic Graph (DAG) data to and from a computing device of a DAG distributed execution engine during the processing of an iterative algorithm. In accordance with one embodiment, a method includes processing a first subgraph of the plurality of subgraphs from the distributed storage system in the computing device. The first subgraph being processed with associated input values in the computing device to generate first output values in an iteration. The method further includes storing a second subgraph in a cache of the device. The second subgraph being a duplicate of the first subgraph. Moreover, the method also includes processing the second subgraph with the first output values to generate second output values if the device is to process the first subgraph in each of one or more subsequent iterations. | 10-01-2009 |
20100281078 | DISTRIBUTED DATA REORGANIZATION FOR PARALLEL EXECUTION ENGINES - A distributed data reorganization system and method for mapping and reducing raw data containing a plurality of data records. Embodiments of the distributed data reorganization system and method operate in a general-purpose parallel execution environment that use an arbitrary communication directed acyclic graph. The vertices of the graph accept multiple data inputs and generate multiple data inputs, and may be of different types. Embodiments of the distributed data reorganization system and method include a plurality of distributed mappers that use a mapping criteria supplied by a developer to map the plurality of data records to data buckets. The mapped data record and data bucket identifications are input for a plurality of distributed reducers. Each distributed reducer groups together data records having the same data bucket identification and then uses a merge logic supplied by the developer to reduce the grouped data records to obtain reorganized data. | 11-04-2010 |
20110295845 | Semi-Supervised Page Importance Ranking - Importance ranking of web pages is performed by defining a graph-based regularization term based on document features, edge features, and a web graph of a plurality of web pages, and deriving a loss term based on human feedback data. The graph-based regularization term and the loss term are combined to obtain a global objective function. The global objective function is optimized to obtain parameters for the document features and edge features and to produce static rank scores for the plurality of web pages. Further, the plurality of web pages is ordered based on the static rank scores. | 12-01-2011 |
20110295855 | Graph-Processing Techniques for a MapReduce Engine - Systems, methods, and devices for sorting and processing various types of graph data are described herein. Partitioning graph data into master data and associated slave data allows for sorting of the graph data by sorting the master data. In another embodiment, promoting a data bucket having a first data bucket size to a data bucket having a second data bucket size greater than the first data bucket size upon reaching a memory limit allows for the reduction of temporary files output by the data bucket. | 12-01-2011 |
20120143792 | PAGE SELECTION FOR INDEXING - Some implementations provide techniques for selecting web pages for inclusion in an index. For example, some implementations apply regularization to select a subset of the crawled web pages for indexing based on link relationships between the crawled web pages, features extracted from the crawled web pages, and user behavior information determined for at least some of the crawled web pages. Further, in some implementations, the user behavior information may be used to sort a training set of crawled web pages into a plurality of labeled groups. The labeled groups may be represented in a directed graph that indicates relative priorities for being selected for indexing. | 06-07-2012 |
20120143844 | MULTI-LEVEL COVERAGE FOR CRAWLING SELECTION - Some implementations provide techniques for determining which URLs to select for crawling from a pool of URLs. For example, the selection of URLs for crawling may be made based on maintaining a high coverage of the known URLs and/or high discoverability of the World Wide Web. Some implementations provide a multi-level coverage strategy for crawling selection. Further, some implementations provide techniques for discovering unseen URLs. | 06-07-2012 |
20120259831 | User Information Needs Based Data Selection - Techniques for determining user information needs and selecting data based on user information needs are described herein. The present disclosure describes extracting topics of interests to users from multiple sources including search log data and social network website, and assigns a budget to each topic to stipulate the quota of data to be selected for each topic. The present disclosure also describes calculating similarities between gathered data and the topics, and selecting top related data with each topic subject to limit of the budget. A search engine may use the techniques described here to select data for its index. | 10-11-2012 |
20120259850 | EFFICIENT QUERY CLUSTERING USING MULTI-PARTITE GRAPHS - Efficient search query clustering using tripartite graphs may enable a search engine developer to model information needs of users while expending less computing resources. The efficient clustering of search queries may involve multiple computing devices receiving a subgraph of a multi-partite graph that encompasses search queries, as well as receiving a global center vector table that includes cluster center entries for query clusters. At each computing device, the received global center vector table may be filtered to eliminate one or more cluster center entries that are irrelevant to the search queries. Subsequently, the search queries may be clustered into the query clusters by at least using the filtered global center vector table at each of the computing devices. In some instances, one or more comparisons between search queries and the cluster center entries in the global center vector table during the clustering may be eliminated. | 10-11-2012 |
20130091013 | Presenting Targeted Social Advertisements - Techniques for providing targeted social advertisements in a social network are described. A targeted social advertisement application detects a commercial intent of a user and retrieves input from friends in the social network. In an implementation, a user interface includes a pane to display a comment with the commercial intent submitted by the user in the social network, the commercial intent being detected for a potential product. The user interface also includes a voting pane to display a plurality of candidate products targeted towards the commercial intent of the user for the potential product. One or more command buttons are on the voting pane to prompt voting as recommendations for the plurality of candidate products from friends of the user. | 04-11-2013 |
20130097011 | Online Advertisement Perception Prediction - An advertisement perception predictor may forecast the effectiveness of an online advertisement in a web page by predicting whether the online advertisement may be perceived by a consumer. The advertisement perception predictor may use a perception model that is trained for determining perception probability values of online advertisements. The perception model may be applied to an online advertisement to determine a perception probability value for the online advertisement. The perception probability value may indicate the likelihood that a consumer is likely to view the online advertisement. | 04-18-2013 |
20130097027 | Task-Based Advertisement Delivery - A task guidance tool that displays instructional steps and associated advertisements may facilitate the accomplishment of a task by users who are otherwise unfamiliar with the task. The task guidance tool may be developed from input data mined from various sources. The task guidance tool may display a series of step pages in which each step page include instructions for accomplishing a corresponding step of the task. Further, one or more step pages of the task guidance tool may be provided with selected advertisements that are displayed with the step instructions. | 04-18-2013 |
20130173398 | Search Engine Menu-based Advertising - Implementations for providing menu-based advertising are disclosed. A search engine front-end determines non-search engine information pages that are relevant to the user input based on user input entered into a search query field on a search page. A suggestion menu is caused to be displayed on a search page. The suggestion menu includes interactive elements that are interactive to cause a client device to retrieve the non-search engine information pages associated with the interactive elements. The interactive elements may be advertisements, and the suggestion menu may also be used to display search query suggestions. | 07-04-2013 |