Patent application number | Description | Published |
20080294602 | DOMAIN COLLAPSING OF SEARCH RESULTS - Systems, methods, computer-readable media, and graphical user interfaces for presenting search results having collapsed domains are provided. A search result obtaining module obtains search results based upon a received query. Upon obtaining the search results, search results having the same domain are associated with one another. Thereafter, search result clusters of associated search results are formed. In some embodiments, the search result clusters may be formatted to include desired search result cluster attributes. The search result clusters are presented such that two or more associated search results form a single cluster of search results rather than being presented individually. In some embodiments, an option to view more search results with the same domain may be provided. | 11-27-2008 |
20080313161 | DISCOSQL: DISTRIBUTED PROCESSING OF STRUCTURED QUERIES - Structured queries, such as those written using the Structured Query Language (SQL) can be an efficient mechanism for expressing the information sought to be obtained from a collection of data. Mechanisms can enable the use of structured queries to express data processing that can be performed in parallel in order to obtain the attendant efficiencies of such processing. The structured queries, whether standing alone or integrated into another programming context, can be translated into an intermediate form that can be compatible with, or equivalent to, the programming context into which they were integrated or some other high-level programming language. The intermediate, translated form can use core commands that abstract mechanisms that can be executed in parallel. The core commands include commands for applying a function in parallel and distributing and joining data in parallel, and also include aggregations of core commands directed to commonly performed functions. | 12-18-2008 |
20080313610 | DISCOSCRIPT: A SIMPLIFIED DISTRIBUTED COMPUTING SCRIPTING LANGUAGE - Scripting core commands and aggregations of such commands are provided to script authors to enable them to generate scripts that can be parallel-processed without requiring the author to be aware of parallel-processing techniques. The scripting core commands and aggregations abstract mechanisms that can be executed in parallel, enabling the script author to focus on higher-level concepts. The scripting core commands provided include commands for applying a function in parallel and distributing and joining data in parallel. For added flexibility, one or more scripting core commands can utilize functions written in a different programming language and referenced appropriately in code blocks. | 12-18-2008 |
20080313625 | DISCO: A SIMPLIFIED DISTRIBUTED COMPUTING LIBRARY - Core commands and aggregations of such commands are provided to programmers to enable them to generate programs that can be parallel-processed without requiring the programmer to be aware of parallel-processing techniques. The core commands and aggregations abstract mechanisms that can be executed in parallel, enabling the programmer to focus on higher-level concepts. The core commands provided include commands for applying a function in parallel and distributing and joining data in parallel. The output of each core command can implement an interface that can enable underlying mechanisms to stitch together multiple core commands in a cohesive manner to perform more complex actions. | 12-18-2008 |
20090119640 | GRAPHICAL APPLICATION FOR BUILDING DISTRIBUTED APPLICATIONS - A graphical application development tool for developing parallel computation applications. The tool facilitates insertion of computational elements by a drag-and-drop operation onto a canvas area for creating a computational graph. The graphical application tool reduces the barriers to the development of parallel computation applications by entry-level developers, for example, by allowing these users to write applications by using a graphical tool, thereby avoiding complexities of having to write well-formed code and learning a new language. The tool includes built-in functionality that allows the developer to write arbitrary code (e.g., C#) to perform various functions on massive amounts of data. | 05-07-2009 |
20090119641 | PROGRAMMING LANGUAGE EXTENSIONS IN STRUCTURED QUERIES - The insertion and processing of programming language code (e.g., C#) in SQL statements, and the dynamic compiling of the code to detect errors prior to statement execution. The SQL statement with arbitrary programming language code can then be executed concurrently as a query on a computer cluster. External libraries can be imported and the associated functionality leveraged from within a SQL statement. The programming language compiler performs checking at build time, rather than retuning an error during the statement execution against the cluster, a potentially costly proposition in both computing time and human resources. | 05-07-2009 |
20100175049 | SCOPE: A STRUCTURED COMPUTATIONS OPTIMIZED FOR PARALLEL EXECUTION SCRIPT LANGUAGE - Embodiments of the present invention relate to systems, methods and computer storage media for providing Structured Computations Optimized for Parallel Execution (SCOPE) that facilitate analysis of a large-scale dataset utilizing row data of those data sets. SCOPE includes, among other features, an extract command for extracting data bytes from a data stream and structuring the data bytes as data rows having strictly defined columns. SCOPE also includes a process command and a reduce command that identify data rows as inputs. The reduce command also identifies a reduce key that facilitates the reduction based on the reduce key. SCOPE additionally includes a combine command that identifies two data row sets that are to be combined based on an identified joint condition. Additionally, SCOPE includes a select command that leverages SQL and C# languages to create an expressive script that is capable of analyzing large-scale data sets in a parallel computing environment. | 07-08-2010 |
20100241624 | PRESENTING SEARCH RESULTS ORDERED USING USER PREFERENCES - Systems and methods for presenting search results ordered, at least in part, based upon indicated user preferences are provided. User preferences for one potential search result over another that are free of position bias are obtained utilizing random relative order interchange of juxtaposed, ranked search results. Upon receipt of a search query, a determination is made to present at least a portion of search results satisfying the received query ordered based on user preferences, whether or not the order coincides with that determined using a ranking algorithm. In this way, presented search results are ordered, at least in part, according to user preferences, thus improving the relevance of the output relative to standard ranking algorithms alone. | 09-23-2010 |
20120239646 | RANKING CONTEXTUAL SIGNALS FOR SEARCH PERSONALIZATION - Methods are provided for re-ranking documents based on user-specific features. Search results are received from a non-contextual ranking system such that the search results are not specific toward a particular user, such as the user who submitted the search query. Contextual signals are received and provide user-specific features that are used to re-rank documents so that the most important and relevant documents are listed at the top of the list of search results. Each of the user-specific features are evaluated and compared to determine a new position of each document. A set of contextual search results is then generated based on the new positions. | 09-20-2012 |
20130346400 | SELF-TUNING ALTERATIONS FRAMEWORK - Embodiment described herein are directed to an enhanced search engine with multiple feedback loops for providing optimal search results that are responsive a user's search query. The user's search query is parsed, and based on the underlying terms, different linguistic models and refinement techniques generate alternative candidate search queries that may yield better results. Searches are performed for the original search query and the candidate search queries, and different scores are used to select the best search results to present to the user. Results making it onto the list, as well as the underlying candidate search query, linguistic model, or refinement technique for generating that search query, will have their corresponding scores updated to reflect their success of generating a search result. Scores are stored and used by future searches to come up with better results. | 12-26-2013 |
20140379747 | IDENTIFYING RELEVANT APPS IN RESPONSE TO QUERIES - Systems, methods, and computer-readable storage media are provided for permitting users to search the content of a plurality of apps from a single search query input location. A user inputs a search query and a plurality of apps and/or the content thereof is searched to determine relevancy to the input query. If an app having relevant app content is identified, it may be determined if the app is associated with the querying user. If it is determined that the app is associated with the querying user, the information determined relevant to the input query may be presented to the user. If, it is determined that the app is not associated with the user, the user may be presented with the identity of the app and/or be directed to a location (e.g., an app store) where the user can become associated with the identified app and obtain the desired information. | 12-25-2014 |