Abstract: A method and system for dynamically synthesizing a computer program based on user context data is provided. In accordance with the invention, a request is received to generate a computer program for an identified user. In response, an incomplete definition of the computer program, from which portions of the definition are omitted, is retrieved. For each portion of the computer program omitted from the incomplete definition of the computer program, a plurality of possible versions of the omitted portion are accessed. Each possible version produces a different behavior in the computer program when it is added to the computer program. Further, each possible version has one or more conditions that may be evaluated against user attributes for the identified user to determine whether the possible version is acceptable for the user. Next, for each possible version of each omitted portion, the conditions of the possible version are evaluated to determine whether the possible version is acceptable for the user.

Abstract: A system, method, and various software products provide for improved information retrieval in very large document databases through the use of a predetermined static cache. The static cache includes for terms that appear in a large number of documents, a plurality of documents ordered by a contribution that the term makes to the document score of the document. The contribution is a scalar measure of the influence of the term in the computed document score. The contribution reflects both the within document frequency and the between document frequency of the term. In addition, the static cache includes for each term a lookup table that references selected entries for the term in an inverted index. Queries to the database are then processed by first traversing the static cache and obtaining the contribution information thereform and computing the document score from this information.

Abstract: An information retrieval system incorporates an extensible query architecture allowing an applications programmer to integrate new query models into the system as desired. The query architecture is based on an abstract base class of query nodes, or code objects that retrieve records from the database. Specific subclasses for particular query models are derived from the base class. Each query node class includes a search function that iteratively searches the database for matching records. Query node objects are instantiated by associated node creator class objects. A parser is used to parse a search query into its components, including nested search queries used to combine various query models. The parser determines the particular search operator keywords, and the node creator object for instantiating the appropriate query node object for each search operator.