Abstract: One embodiment of the present invention provides a system that automatically identifies compounds, such as bigrams or n-grams. During operation, the system obtains selections of search results which were selected by one or more users, wherein the search results were previously generated by a search engine in response to queries containing search terms. Next, the system forms a set of candidate compounds from the queries, wherein each candidate compound comprises n consecutive terms from a query. Then, for each candidate compound in the set, the system analyzes the selections of search results to calculate a likelihood that the candidate compound is a compound.

Abstract: An information retrieval system uses phrases to index, retrieve, organize and describe documents. Phrases are extracted from the document collection. Documents are the indexed according to their included phrases, using phrase posting lists. The phrase posting lists are stored in an cluster of index servers. The phrase posting lists can be tiered into groups, and sharded into partitions. Phrases in a query are identified based on possible phrasifications. A query schedule based on the phrases is created from the phrases, and then optimized to reduce query processing and communication costs. The execution of the query schedule is managed to further reduce or eliminate query processing operations at various ones of the index servers.

Abstract: Disclosed herein are methods for automatically managing information relating to a customs agency's import regulations. The methods disclosed include procedures for maintaining import data according to the regulations as they become updated or changed. Also disclosed are procedures for interfacing with a plurality of software applications utilized for performing various steps of a method for managing import data according to the regulations.

Abstract: A computer-implemented method to access a tree data structure in a computing environment is provided. The method includes generating a tree data structure in a computing environment, wherein the tree data structure includes nodes and links to link the nodes, wherein each node includes fields for various data types, accessing contents of the tree data structure with a single command in a computing environment.

Abstract: A method and apparatus for provision of persistence context to program components. An embodiment of a method includes receiving a call from a persistence engine, the call requesting a persistence context for a program component of a computer application. There is a method call to obtain the persistence context; and the persistence context is provided to the persistence engine. Other embodiments are also disclosed and claimed.

Abstract: Searching stored content is disclosed. A first mapping is created from an object to one or more stored relational database tables. A second mapping is created from the object to an indexer schema. One or both of the following is done: 1) using the first mapping to translate a search request expressed in an abstract query language to a first query language associated with the relational database; and 2) using the second mapping to translate the search request to a second query language associated with the indexer schema.

Abstract: Embodiments of the invention may be used to normalize data stored in an in-memory database on a parallel computer system. The data normalization may be used to achieve memory savings, thereby reducing the number of compute nodes required to store an in-memory database. Thus, as a result, faster response times may be achieved when querying the data. In one embodiment, normalization may be performed in a manner to avoid datasets that cross physical or logical boundaries of the compute nodes of a parallel system.

Abstract: Systems and techniques for estimation of item ratings for a user. A set of item ratings by multiple users is maintained, and similarity measures for all items are precomputed, as well as values used to generate interpolation weights for ratings neighboring a rating of interest to be estimated. A predetermined number of neighbors are selected for an item whose rating is to be estimated, the neighbors being those with the highest similarity measures. Global effects are removed, and interpolation weights for the neighbors are computed simultaneously. The interpolation weights are used to estimate a rating for the item based on the neighboring ratings, Suitably, ratings are estimated for all items in a predetermined dataset that have not yet been rated by the user, and recommendations are made of the user by selecting a predetermined number of items in the dataset having the highest estimated ratings.

Abstract: Disclosed is an evaluation technique for text search with black-box scoring functions, where it is unnecessary for the evaluation engine to maintain details of the scoring function. Included is a description of a system for dealing with blackbox searching, proofs of correctness, as well experimental evidence showing that the performance of the technique is comparable in efficiency to those techniques used in custom-built engines.

Abstract: Adding references to objects to a mark stack. A limited number of references to objects referenced by an object with a large number of object references are added to the stack. An object is accessed. A determination is made that references in the object should be added to a mark stack using a reference in the mark stack to the object in conjunction with a pointer. The pointer is used to track which references in the object have been placed on the mark stack. A reference to the object on the mark stack is accessed. A pointer is initialized. A reference to another object referenced by the object is pushed onto the mark stack. The pointer is incremented. It is then determined that that more references should be pushed to the mark stack. Acts of pushing references onto the mark stack and incrementing the pointer are repeated.

Abstract: A method and apparatus for provision of connections to program components. In an embodiment of a method, a call is received from a persistence engine, the call requesting a connection to a database. A method is called to obtain the connection from a data source. The connection is provided to the persistence engine. The method further includes providing the connection to the persistence engine. Other embodiments are also disclosed and claimed.

Abstract: Systems and techniques for converting numeric queries into substantially equivalent textual queries are described. In general, the systems and techniques discussed use search query logs to accurately select a most probably mapping for a numeric-to-text conversion. This mapping can occur when a system (e.g., a server-side search system) receives a series of numeric inputs (e.g., from a cell phone keypad) that may correspond to more than one word. For example, a search server may receive input 22737, which corresponds to both the words ACRES and CASES, as part of a query. The server uses current entries in query logs to create mappings for words from the numeric input. If recent queries indicate that the term ACRES is currently more popular than the term CASES, the mapping may match the entry 22737 to the text ACRES.

Abstract: A method for automatic reconciliation of database change requests associates administrative database commands with the change request via a context event command. A database monitoring system identifies a context event command that indicates that a particular context, or session, is beginning. The context event command is a tag command, and includes parameters specifying a context label indicative of a change request. Prior to entering a particular change request, the DBA issues the context event command with the context label as a parameter. The context label is an identifier of the change request to be associated with the set of operations, or commands, resulting from the particular change request. The database monitoring system logs and associates subsequently received commands with the context label in a database access log which is employed for later reconciliation of the operations with the corresponding change request.

Abstract: An information retrieval system uses phrases to index, retrieve, organize and describe documents. Phrases are extracted from the document collection. Documents are the indexed according to their included phrases, using phrase posting lists. The phrase posting lists are stored in an cluster of index servers. The phrase posting lists can be tiered into groups, and sharded into partitions. Phrases in a query are identified based on possible phrasifications. A query schedule based on the phrases is created from the phrases, and then optimized to reduce query processing and communication costs. The execution of the query schedule is managed to further reduce or eliminate query processing operations at various ones of the index servers.

Abstract: The present invention relates to a method to make effective use of display space. In an embodiment of the invention, given a heterogeneous set of images along with metadata or nearby text, similar images are recursively clustered into a k-tree using the k-means algorithm. In an embodiment of the invention, the invention is particularly useful for showing image search results on small mobile devices.

Abstract: In one embodiment, systems and methods are provided for nonlinear journaling. In one embodiment, groups of data designated for storage in a data storage unit are journaled into persistent storage. In one embodiment, the journal data is recorded nonlinearly. In one embodiment, a linked data structure records data and data descriptors in persistent storage.

Abstract: Systems and methods for storing and restoring backup data. One method includes receiving, while a current view of an application is displayed in a user interface, a first user input requesting a history view associated with the current view of the application. The history view is displayed in response to the first user input, the history view including at least a first visual representation of an earlier version of the current view of the application, the earlier version including a first element. A second user input is received while the history view is displayed. The second user input requesting that the current view of the application be modified according to the earlier version, at least with regard to the first element. The current view of the application is modified in response to the second user input according to the earlier version, at least with regard to the first element.

Abstract: Systems and methods for providing a user interface including earlier versions of data. In one implementation, computer program product is provided. The computer program product generates a user interface. The user interface includes a view display area for presenting a current view and a history view display area for presenting a history view associated with the current view. The history view includes one or more first visual representations of corresponding earlier versions of the current view. The user interface also includes an input control for initiating a restoration of the current view according to at least a portion of an earlier version of the one or more earlier versions.

Abstract: Systems and methods for navigating within snapshots are provided. In one implementation a method is provided. The method includes receiving, while a current view is displayed in a user interface, a first user input requesting that a history view associated with the current view be displayed. The history view is displayed in response to the first user input, the history view including at least a first visual representation of an earlier version of the current view, the earlier version including a hierarchical structure wherein a first element of the earlier version includes a second element. There is received, while the history view is displayed, a second user input requesting that the current view be modified according to the second element. The method includes modifying, in response to the second user input, the current view according to the second element.

Abstract: Systems and methods are provided for resolving conflicts. In one implementation, a method relating to modifying a view in a user interface is provided. The method includes receiving, while a current view is displayed in a user interface, a first user input requesting that a history view associated with the current view be displayed. The history view is displayed in response to the first user input, the history view includes at least a first visual representation of an earlier version of the current view, and the earlier version includes a first element. There is received, while the history view is displayed, a second user input requesting that the current view be modified according to the earlier version, at least with regard to the first element. The method further includes determining, in response to the second user input, whether the current view includes a current version of the first element.