Abstract: A set of index keys is included in an index search system that are associated with the scope of the search rather than the content of the documents that are the target of the search. These scope related index keys, or scope keys allows the scope of the search to be selected, reducing the number of documents that a search is required to sift through to obtain results. Furthermore, compound scopes are recognized and stored such that an index of complex search scopes is provided to eliminate rehashing of the searches based on these complex search scopes.

Abstract: A system that employs an explicitly and/or implicitly trained model in order to return entity-specific computer-based search results is provided. The innovation can provide for a customized search model that focuses search in connection with achieving information that is meaningful with respect to goals of an entity. The model can be used to modify a search query in accordance with a goal of the entity or to generate the search query thereby returning meaningful and/or targeted results to the user. The system can automatically gather entity-related data thereafter determining or inferring a goal as well as training the model. Moreover, the system can selectively configure (e.g., order, rank, filter) and render results to a user based upon the model.

Abstract: A system and method for facilitating full text searching utilizing inverted keyword indices in shared memory are provided. An inverted keyword index and an inverted keyword attribute index are created from keyword tokens from a set of documents. The keyword indices are stored in a shared memory buffer and accessed by a query processing component. Shared memory pointers corresponding to the indices are dynamically adjusted according to the addressing schema of the query processing component. The query processing component then processes data queries from the keyword indices stored in the shared memory buffer.

Abstract: A set of index keys is included in an index search system that are associated with the scope of the search rather than the content of the documents that are the target of the search. These scope related index keys, or scope keys allows the scope of the search to be selected, reducing the number of documents that a search is required to sift through to obtain results. Furthermore, compound scopes are recognized and stored such that an index of complex search scopes is provided to eliminate rehashing of the searches based on these complex search scopes.

Abstract: A set of index keys is included in an index search system that are associated with the scope of the search rather than the content of the documents that are the target of the search. These scope related index keys, or scope keys allows the scope of the search to be selected, reducing the number of documents that a search is required to sift through to obtain results. Furthermore, compound scopes are recognized and stored such that an index of complex search scopes is provided to eliminate rehashing of the searches based on these complex search scopes.

Abstract: Documents are indexed in accordance with a process that separates the filtering and word breaking portions of the process so that they are performed under a restricted security setting. When a document is requested by an indexer, the document is retrieved and then passed to the higher security process. The document is then filtered one or more filters and tokenized by one or more wordbreakers under the restricted security setting before being passed to the indexer. The restricted security setting prevents security vulnerabilities from being exploited during the filtering and word breaking processes.

Abstract: Architecture for targeted advertising using offline user behavior information. Information relating to offline behavior can be collected from cell phones, geolocation systems, credit card information, restaurants, grocery stores, etc., and this information is aggregated and employed in connection with selecting and displaying targeted advertising to a user when online. Machine learning and reasoning can be employed to make inferences and dynamically tune advertisement processing. Offline user information can also be employed to enhance context-based searching when the user goes online. The ranking of search results and content for display can be modified as a function of offline behavior. A system is provided that facilitates online advertising based on at least offline activity using a profile component for aggregating offline behavior information of a user and generating a related user profile.

Abstract: A system that employs an explicitly and/or implicitly trained model in order to return entity-specific computer-based search results is provided. The innovation can provide for a customized search model that focuses search in connection with achieving information that is meaningful with respect to goals of an entity. The model can be used to modify a search query in accordance with a goal of the entity or to generate the search query thereby returning meaningful and/or targeted results to the user. The system can automatically gather entity-related data thereafter determining or inferring a goal as well as training the model. Moreover, the system can selectively configure (e.g., order, rank, filter) and render results to a user based upon the model.

Abstract: A system that employs an explicitly and/or implicitly trained model in order to return entity-specific computer-based search results is provided. The innovation can provide for a customized search model that focuses search in connection with achieving information that is meaningful with respect to goals of an entity. The model can be used to modify a search query in accordance with a goal of the entity or to generate the search query thereby returning meaningful and/or targeted results to the user. The system can automatically gather entity-related data thereafter determining or inferring a goal as well as training the model. Moreover, the system can selectively configure (e.g., order, rank, filter) and render results to a user based upon the model.

Abstract: Architecture for targeted advertising using offline user behavior information. Information relating to offline behavior can be collected from cell phones, geolocation systems, credit card information, restaurants, grocery stores, etc., and this information is aggregated and employed in connection with selecting and displaying targeted advertising to a user when online. Machine learning and reasoning can be employed to make inferences and dynamically tune advertisement processing. Offline user information can also be employed to enhance context-based searching when the user goes online. The ranking of search results and content for display can be modified as a function of offline behavior. A system is provided that facilitates online advertising based on at least offline activity using a profile component for aggregating offline behavior information of a user and generating a related user profile.

Abstract: A system that incorporates a user context into a computer-based search is provided. To establish the context, the innovation can identify information about a user state or context via a variety of sources and sensors. The state/context information can be used to filter, arrange and/or rank search results so as to facilitate converging on meaningful searches and results. Machine learning systems (implicitly and/or explicitly trained) can be employed to infer a current and/or future context related to user. An identified or inferred user context can be employed to modify an automated or user-defined search input/query. Contextual cues can be considered directly in the construction and use of context of context-sensitive retrieval algorithms that are optimized for identifying and/or ranking of informational items of potential interest or value in different contexts. As well, the context can be employed to intelligently render results of a query (e.g., user/application defined, context-modified query).

Abstract: A system that incorporates a user context into a computer-based search is provided. To establish the context, the innovation can identify information about a user state or context via a variety of sources and sensors. The state/context information can be used to filter, arrange and/or rank search results so as to facilitate converging on meaningful searches and results. Machine learning systems (implicitly and/or explicitly trained) can be employed to infer a current and/or future context related to user. An identified or inferred user context can be employed to modify an automated or user-defined search input/query. Contextual cues can be considered directly in the construction and use of context of context-sensitive retrieval algorithms that are optimized for identifying and/or ranking of informational items of potential interest or value in different contexts. As well, the context can be employed to intelligently render results of a query (e.g., user/application defined, context-modified query).

Abstract: A system for performing transaction processing on user data maintains a transaction table. The transaction table holds the identities of structured storages that have been opened but not yet closed by each of the transactions that are accessing the structured storages. Each time that a stream holding user data is opened in a write mode, an internal copy of the stream is made. Changes are applied to the internal copy. At commit time, the following metadata operations are performed as a single atomic transaction. Each copy is renamed to have the name of the original stream. If no other transactions are accessing the stream, the original stream is deleted. However, if other transactions are accessing the stream, the original stream is renamed to have the name of the copy. The metadata transaction is implemented with write-ahead logging. Upon recovery from a system failure, any metadata transaction that was in progress at the time of the failure is undone.

Abstract: A method and system for improved monitoring of document changes in a search engine by an indexing program. Once an indexing or other such monitoring program is halted, upon restart the monitoring program needs to update its own files and its indexes to reflect document changes that occurred while halted. A file system such as the Windows NT file system persistently logs document change information on disk in a monotonically increasing, uniquely-numbered persistent record, which further identifies the file that has changed. The method and system utilize the logged change information to efficiently maintain the indexes, and to rapidly update the indexes after a shutdown and subsequent restart.

Abstract: A system for performing transaction processing on user data maintains a transaction table. The transaction table holds the identities of structured storages that have been opened but not yet closed by each of the transactions that are accessing the structured storages. Each time that a stream holding user data is opened in a write mode, an internal copy of the stream is made. Changes are applied to the internal copy. At commit time, the following metadata operations are performed as a single atomic transaction. Each copy is renamed to have the name of the original stream. If no other transactions are accessing the stream, the original stream is deleted. However, if other transactions are accessing the stream, the original stream is renamed to have the name of the copy. The metadata transaction is implemented with write-ahead logging. Upon recovery from a system failure, any metadata transaction that was in progress at the time of the failure is undone.

Abstract: A method and mechanism for rapidly freeing storage space allocated to any logical portion of a file. An application program provides the file system with information indicating a block of logical data to free. The file system converts the information to the physical allocation units such as the clusters corresponding to the logical block of data, and manipulates the file's meta data to indicate that the physical space is no longer allocated to the file. The file system then adds the space to disk free space. Applications such as merge applications and those managing FIFO queues may use the method and mechanism to shrink a file from the start of the file toward the end thereof without copying the logical data or adjusting internal pointers relative to the logical file data.

Abstract: A method and mechanism for responding to a query in a hierarchically organized system of documents and folders. In response to the query, a set of documents is retrieved based on specified criteria. Only documents in that set which match a specified scope are returned in a result set. Scope testing is performed on each of the documents in the set by obtaining a document identifier of each document, and then using that document identifier to obtain a document identifier of the parent folder thereof. The document identifier of the parent folder is used as a key to a data structure, which stores flags indicative of whether parent folders are in the specified scope. If the flag for a given parent folder indicates that the parent folder is in scope, the document having that parent is returned in the result set. If the flag indicates that the current document is not in scope, that document is not returned.

Abstract: A system and method for returning a sorted result set of information corresponding to files in a file system that have properties which match user query criteria. A view index of files sorted by at least one property common to those files is provided. The view index may be synchronously or asynchronously updated as files are changed. Upon receipt of query requesting a result set of files corresponding to properties in the query criteria, the view index is compared to determine if the properties are maintained in an order that corresponds to the query criteria. If so, the view index is accessed to locate information of files that have the matching properties, and the result set is returned. The view index may be associated with a view description of the identities and order of the properties. The comparison to determine if a view index corresponds with the criteria may then be performed against the view description.