Abstract: A method of delivering location-specific content by a content processing server is disclosed. A request for web content is received by the content processing server. A location of an originator of the received request for web content is identified. A local proxy server is selected based on the identified location of the originator of the received request for web content. The web content is requested via the selected local proxy server. Location-specific web content from the content provider is received via the selected local proxy server. The received local-specific web content is sent to the originator of the received request in response to the received request.

Abstract: A method of delivering location-specific content by a content processing server is disclosed. A request for web content is received by the content processing server. A location of an originator of the received request for web content is identified. A local proxy server is selected based on the identified location of the originator of the received request for web content. The web content is requested via the selected local proxy server. Location-specific web content from the content provider is received via the selected local proxy server. The received local-specific web content is sent to the originator of the received request in response to the received request.

Abstract: A method of delivering location-specific content by a content processing server is disclosed. A request for web content is received by the content processing server. A location of an originator of the received request for web content is identified. A local proxy server is selected based on the identified location of the originator of the received request for web content. The web content is requested via the selected local proxy server. Location-specific web content from the content provider is received via the selected local proxy server. The received local-specific web content is sent to the originator of the received request in response to the received request.

Abstract: A method of delivering a webpage is disclosed. It is determined that delivery of at least a portion of third-party content associated with a webpage is to be accelerated. One or more pre-conditions to be met prior to the delivery of the accelerated third-party content are determined. A loading order configuration for the webpage is determined based at least in part on the one or more pre-conditions. At least a portion of the webpage that modifies a loading order of content portions of the webpage is determined based on the loading order configuration.

Abstract: A method of delivering a webpage is disclosed. It is determined that delivery of at least a portion of third-party content associated with a webpage is to be accelerated. One or more pre-conditions to be met prior to the delivery of the accelerated third-party content are determined. A loading order configuration for the webpage is determined based at least in part on the one or more pre-conditions. At least a portion of the webpage that modifies a loading order of content portions of the webpage is determined based on the loading order configuration.

Abstract: Various techniques for prioritized content retrieval from social network servers are disclosed herein. In one embodiment, a method includes receiving information of a user's profile related to a social network service provided by a social network server and generating a priority rating for the user based on the received information. The priority rating represents a likelihood of consumption of the publish content by the user. The method further includes retrieving the published content by the user from the social network server in accordance with the generated priority rating.

Abstract: The subject matter disclosed herein relates to alter an expression of executable instructions via a compiler component for use in ranking of electronic documents.

Abstract: A computer readable medium stores a program for optimization for a search, and has sets of instructions for receiving a first decision tree. The first decision tree includes several nodes, and each node is for comparing a feature value to a threshold value. The instructions are for weighting the nodes within the first decision tree, determining the weighted frequency of a first feature within the first decision tree, and determining the weighted frequency of a second feature within the first decision tree. The instructions order the features based on the determined weighted frequencies, and store the ordering such that values of features having higher weighted frequencies are retrieved more often than values of features having lower weighted frequencies within the first decision tree.

Abstract: The subject matter disclosed herein relates to prefetching data for use in ranking of electronic documents via a document ranking component.

Abstract: Machine-learned ranking algorithms, e.g. for ranking search results, often use a sequence of decision trees involving decision nodes based on threshold values of features. Modules, systems and methods of optimizing such algorithms involve analyzing threshold feature values to determine threshold intervals for each feature and grouping decision trees according to the feature used in a root decision node. Then coalescing the decision trees within each group to form a coalesced group tree for each group and finally coalescing the coalesced group trees to form a coalesced tree that implements the algorithm.

Abstract: A computer readable medium stores a program for optimization for a search, and has sets of instructions for receiving a first decision tree. The first decision tree includes several nodes, and each node is for comparing a feature value to a threshold value. The instructions are for weighting the nodes within the first decision tree, determining the weighted frequency of a first feature within the first decision tree, and determining the weighted frequency of a second feature within the first decision tree. The instructions order the features based on the determined weighted frequencies, and store the ordering such that values of features having higher weighted frequencies are retrieved more often than values of features having lower weighted frequencies within the first decision tree.

Abstract: Machine-learned ranking algorithms, e.g. for ranking search results, often use a sequence of decision trees involving decision nodes based on threshold values of features. Modules, systems and methods of optimizing such algorithms involve analyzing threshold feature values to determine threshold intervals for each feature and grouping decision trees according to the feature used in a root decision node. Then coalescing the decision trees within each group to form a coalesced group tree for each group and finally coalescing the coalesced group trees to form a coalesced tree that implements the algorithm.

Abstract: The subject matter disclosed herein relates to alter an expression of executable instructions via a compiler component for use in ranking of electronic documents.

Abstract: The subject matter disclosed herein relates to prefetching data for use in ranking of electronic documents via a document ranking component.

Abstract: Using a testing framework, developers may create a test module to centralize resources and results for a software test plan amongst a plurality of systems. With assistance from the testing framework, the test module may facilitate the creation of test cases, the execution of a test job for each test case, the collection of performance statistics during each test job, and the aggregation of collected statistics into organized reports for easier analysis. The test module may track test results for easy comparison of performance metrics in response to various conditions and environments over the history of the development process. The testing framework may also schedule a test job for execution when the various systems and resources required by the test job are free. The testing framework may be operating system independent, so that a single test job may test software concurrently on a variety of systems.

Abstract: Using a testing framework, developers may create a test module to centralize resources and results for a software test plan amongst a plurality of systems. With assistance from the testing framework, the test module may facilitate the creation of test cases, the execution of a test job for each test case, the collection of performance statistics during each test job, and the aggregation of collected statistics into organized reports for easier analysis. The test module may track test results for easy comparison of performance metrics in response to various conditions and environments over the history of the development process. The testing framework may also schedule a test job for execution when the various systems and resources required by the test job are free. The testing framework may be operating system independent, so that a single test job may test software concurrently on a variety of systems.

Abstract: A database system providing self-tuned parallel database recovery is described. In one embodiment, for example, in a database system, a method is described for performing recovery operations using an optimal number of recovery threads, the method comprises steps of: (a) spawning an initial recovery thread to perform recovery operations; (b) measuring I/O (input/output) performance with the initial recovery thread; (c) spawning a subsequent recovery thread to perform recovery operations; (d) measuring I/O performance with the subsequent recovery thread; and (e) as long as I/O performance does not degrade beyond a preselected percentage, repeating steps (c) and (d) for spawning a desired number of additional recovery threads. In another embodiment, the database system auto-tunes the cache during performance of database recovery operations to optimize the performance of recovery operations.

Abstract: A database system providing methodology for extended memory support is described. In one embodiment, for example, a method is described for extended memory support in a database system having a primary cache, the method comprises steps of: creating a secondary cache in memory available to the database system; mapping a virtual address range to at least a portion of the secondary cache; when the primary cache is full, replacing pages from the primary cache using the secondary cache; in response to a request for a particular page, searching for the particular page in the secondary cache if the particular page is not found in the primary cache; if the particular page is found in the secondary cache, determining a virtual address in the secondary cache where the particular page resides based on the mapping; and swapping the particular page found in the secondary cache with a page in the primary cache, so as to replace a page in the primary cache with the particular page from the secondary cache.

Abstract: A database system providing methodology for extended memory support is described. In one embodiment, for example, a method is described for extended memory support in a database system having a primary cache, the method comprises steps of: creating a secondary cache in memory available to the database system; mapping a virtual address range to at least a portion of the secondary cache; when the primary cache is full, replacing pages from the primary cache using the secondary cache; in response to a request for a particular page, searching for the particular page in the secondary cache if the particular page is not found in the primary cache; if the particular page is found in the secondary cache, determining a virtual address in the secondary cache where the particular page resides based on the mapping; and swapping the particular page found in the secondary cache with a page in the primary cache, so as to replace a page in the primary cache with the particular page from the secondary cache.

Abstract: A database system providing self-tuned parallel database recovery is described. In one embodiment, for example, in a database system, a method is described for performing recovery operations using an optimal number of recovery threads, the method comprises steps of: (a) spawning an initial recovery thread to perform recovery operations; (b) measuring I/O (input/output) performance with the initial recovery thread; (c) spawning a subsequent recovery thread to perform recovery operations; (d) measuring I/O performance with the subsequent recovery thread; and (e) as long as I/O performance does not degrade beyond a preselected percentage, repeating steps (c) and (d) for spawning a desired number of additional recovery threads. In another embodiment, the database system auto-tunes the cache during performance of database recovery operations to optimize the performance of recovery operations.