Abstract: A query is separated into subqueries including a first subquery containing terms applicable to a first data store and a second subquery containing terms applicable to a second data store, where both data stores maintain information regarding the documents. Applying the first subquery to the first data store retrieves a first list of document identifiers associated with documents that satisfy the terms of the first subquery. The first list is combined with the second subquery to form a masked subquery, which is applied to the second data store. The masked subquery only seeks to identify document identifiers that both are included the first list and that satisfy terms of the second query. The document identifiers included in the first list may be ordered to match an order in which the document identifiers are ordered in the second data store.

Abstract: Methods and computer-readable media are provided for performing a search on a relational database. According to one method, a query class is provided that includes properties that specify how a query is to be performed and how results from the query are to be returned, and an execute method that is called to perform the actual query. A keyword query class derived from the query class is also provided that includes keyword query properties and an execute method for performing the keyword query. In order to perform a keyword query of an SQL database, an instance of the keyword query class is created, the properties set on the instance, and the execute method called. When the execute method is called, the specified properties are translated into an equivalent SQL statement and the search is performed on the identified relational database by a search service.

Abstract: Methods and computer-readable media are provided for performing a search on a relational database. According to one method, a query class is provided that includes properties that specify how a query is to be performed and how results from the query are to be returned, and an execute method that is called to perform the actual query. A keyword query class derived from the query class is also provided that includes keyword query properties and an execute method for performing the keyword query. In order to perform a keyword query of an SQL database, an instance of the keyword query class is created, the properties set on the instance, and the execute method called. When the execute method is called, the specified properties are translated into an equivalent SQL statement and the search is performed on the identified relational database by a search service.

Abstract: A query is separated into subqueries including a first subquery containing terms applicable to a first data store and a second subquery containing terms applicable to a second data store, where both data stores maintain information regarding the documents. Applying the first subquery to the first data store retrieves a first list of document identifiers associated with documents that satisfy the terms of the first subquery. The first list is combined with the second subquery to form a masked subquery, which is applied to the second data store. The masked subquery only seeks to identify document identifiers that both are included the first list and that satisfy terms of the second query. The document identifiers included in the first list may be ordered to match an order in which the document identifiers are ordered in the second data store.

Abstract: The invention efficiently determines whether a container that is associated with an item of changeable data actually is associated with the freshest version of this item of changeable data. Multiple containers may exist in the virtual memory (“in-memory container”) or in a persistent storage system (“persistent container”) of a computer system and be associated with different versions of an item of changeable data. A table in the virtual memory reveals the freshness of changeable data associated with in-memory containers. One or more in-memory containers associated with one or more same items of changeable data are merged into a new persistent container and removed from the virtual memory. A persistent container is associated with a list that identifies all changeable data associated with the persistent container. An invalidation process invalidates, in the lists associated with older persistent containers, older versions of the changeable data associated with the new persistent container.

Abstract: A field-weighted search combines statistical information for each term across document fields in a suitably weighted fashion. Both field-specific term frequencies and field and document lengths are considered to obtain a field-weighted document weight for each query term. Each field-weighted document weight can then be combined in order to generate a field-weighted document score that is responsive to the overall query.