Microsoft Technology Licensing, LLC

Microsoft Corporation

Kyle G Peltonen

Dmitriy Meyerzon

David J Lee

Sitaram C Raju

Eric J Horvitz

Christopher A Meek

Gary William Flake

Joshua T Goodman

Susan Theresa Dumais

Ramez Naam

Srikanth Shoroff

Anoop Gupta

Mark Joseph Zbikowski

Brian Thomas Berkowitz

Bradly A Brunell

Chadd Creighton Merrigan

Bartosz Boleslaw Milewski

Bartosz Milewski

William Henry Gates, Iii

Alexander G Gounares

Xuedong D Huang

John Carlton Platt

Raymond Edward Ozzie

Eric David Brill

Oliver Hurst-Hiller

Hugo Zaragoza

Yevgeniy Anatolievich Samsonov

Christopher D Payne

Alan R Whitney

Mircea Neagovici-Negoescu

Dennis Gursky

Michael M H Cheng

Andrew DeBruyne

Andrew Debruyne

Sitaram C V Raju

Bartosz B Milewski

Yevgeniy Samsonov

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.

System and method for scoping searches using index keys

The subject disclosure pertains to anonymous network interaction. More specifically, mechanisms are provided to ensure anonymity with respect network interaction such that third parties are unable to determine the source and/or intent of communications. Accordingly, entities may anonymize all outgoing and/or incoming data packets so as to mitigate outside entities from learning about information being sought and/or provided. For example, a user or corporation may employ an anonymizer with respect to web searching so that outside entities are not able to determine what information is attempted to be accessed and by whom.

Anonymous and secure network-based interaction

The subject disclosure pertains to anonymous network interaction. More specifically, mechanisms are provided to ensure anonymity with respect network interaction such that third parties are unable to determine the source and/or intent of communications. Accordingly, entities can anonymize all outgoing and/or incoming data packets so as to mitigate outside entities from learning about information being sought and/or provided. For example, a user or corporation can employ an anonymizer with respect to web searching so that outside entities are not able to determine what information is attempted to be accessed and by whom.

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.

Entity-specific search model

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.

System and method for facilitating full text searching utilizing inverted keyword indices

A process takes advantage of a structure of a server hosting a network site that includes a change log stored in a database to batch index documents for search queries. The content of the site is batched and shipped in bulk from the server to an indexer. The change log keeps track of the changes to the content of the site. The indexer incrementally requests updates to the index using the change log and batches the changes so that the bandwidth usage and processor overhead costs are reduced.

System and method for batched indexing of network documents

Methods of providing a document relevance score to a document on a network are disclosed. Computer readable medium having stored thereon computer-executable instructions for performing a method of providing a document relevance score to a document on a network are also disclosed. Further, computing systems containing at least one application module, wherein the at least one application module comprises application code for performing methods of providing a document relevance score to a document on a network are disclosed.

Ranking functions using document usage statistics

Systems and methods for scoping a search. When a content index for electronic data is built, one or more scope restrictions are included in the content index. The scope restriction may be, for example, a root folder identifier, a mailbox identifier, or a Uniform Resource Locator (URL). Because the scope restriction is included in the content index random access of the property store to determine the scope is avoided. Rather, the scope restriction is implicitly added to a search that uses the content index. By including a scope restriction in the search query, the search results identified from the content index are limited to results that match the scope restriction. Advantageously, the effect of including the scope restriction in the search is ignored if the search results are relatively small or when including the scope restriction provides little benefit.

Scoping queries in a search engine

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.

System and method for secure full-text indexing

Systems and methods for scoping a search. When a content index for electronic data is built, one or more scope restrictions are included in the content index. The scope restriction may be, for example, a root folder identifier, a mailbox identifier, or a URL. Because the scope restriction is included in the content index random access of the property store to determine the scope is avoided. Rather, the scope restriction is implicitly added to a search that uses the content index. By including a scope restriction in the search query, the search results identified from the content index are limited to results that match the scope restriction. Advantageously, the effect of including the scope restriction in the search is ignored if the search results are relatively small or when including the scope restriction provides little benefit.

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. Then the transaction table is read to identify each of the structured storages that must be opened and processed to remove any remaining internal copies of streams. In summary, the system provides robust multiuser transacted access to user data through file system metadata transactions and uses a transaction table to optimize system recovery.

Recovering from a failure using a transaction table in connection with

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.

Monitoring document changes in a file system of documents with the

Transaction processing for user data employing both logging and shadow

Growing community of inventors

Issaquah, WA, United States of America

Kyle G Peltonen