Emc IP Holding Company LLC

Open Text Corporation

Memverge, Inc.

Emc Corporation

Kunwu Huang

Chao Chen

Jingjing Liu

Hongtao Dai

Lei Zhang

Ying Teng

Yue Li

Jie Yu

Robert W Beauchamp

Yue Zhao

Ning Xu

Yuanjie Wu

Wei Kang

Haiyan Wang

Peiyu Zhuang

Jiajie Sun

Ideogram character analysis includes partitioning an original ideogram character into strokes and mapping each stroke to a corresponding stroke identifier (id) to create an original stroke id sequence that includes stroke identifiers. A candidate ideogram character that has a candidate stroke id sequence within a threshold distance to the original stroke id sequence is selected. One or more embodiments may create a new phrase by replacing the original ideogram character with the candidate ideogram character in a search phrase. One or more embodiments perform a search using the search phrase and the new phrase to obtain a result and present the result. One or more embodiments may replace an original ideogram character in a character recognized document with the candidate ideogram character and store the character recognized document.

Method and system for ideogram character analysis

A method for servicing document search requests. The method includes receiving, by a document management service, a document search query from a requesting user, and injecting, into the document search query, a user access vector. The user access vector specifies, for the requesting user, access control lists that are associated with the requesting user. The method further includes identifying, in a document repository, documents that match the document search query with the injected user access vector. A matching document requires a match of terms in the search query with terms in the matching document, and a match of at least one access control list specified in the matching document and at least one of the access control lists specified in the user access vector.

Method and system for cached early-binding document search

Ideogram character analysis includes partitioning an original ideogram character into strokes, and mapping each stroke to a corresponding stroke identifier (id) to create an original stroke id sequence that includes stroke identifiers. A candidate ideogram character that has a candidate stroke id sequence within a threshold distance to the original stroke id sequence is selected. One or more embodiments may create a new phrase by replacing the original ideogram character with the candidate ideogram character in a search phrase. One or more embodiments perform a search using the search phrase and the new phrase to obtain a result, and present the result. One or more embodiments may replace an original ideogram character in a character recognized document with the candidate ideogram character and store the character recognized document.

In general, in one aspect, the invention relates to a method for servicing requests. The method includes receiving, from a client system, a request comprising a query, where the query includes a first plurality of terms. The method further includes generating, using a thesaurus library, a related query including a second plurality of terms, where at least one term in the second plurality of terms is present in the first plurality of terms. The method further includes issuing the query to a content repository to obtain a first result, issuing the related query to the content repository to obtain a second result, processing the first result and the second result to generate a final result, and providing the final result to the client system.

System and method to enhance phrase search with nested thesaurus parsing

Disclosed herein is an apparatus and method for a naming service in a distributed memory object system. In one embodiment, a name service method includes electing a primary node for the master key value store from a plurality of name service nodes, the primary node to receive master key value requests, a master key value store containing an entry for each directory within the distributed memory object, wherein the master key value store is configured for associating a directory pathname to a uniform unique identifier, and replicating the master key value store across the plurality of name service nodes. In another embodiment, a name service computing device includes a primary node for the master key value store, wherein the primary node is selected from a plurality of name service nodes and is configured to receive master key value requests, a master key value store containing an entry for each directory within the distributed memory object, wherein the master key value store is configured to associate a directory pathname to a uniform unique identifier, and the system further being in communication with the plurality of name service nodes, wherein the master key value store is replicated across the plurality of name service nodes.

Naming service in a distributed memory object architecture

Disclosed herein is an apparatus and method for a shuffle manager for a distributed memory object system. In one embodiment, a method includes forming a system cluster comprising a plurality of nodes, wherein each node includes a memory, a processor and a network interface to send and receive messages and data, wherein the network interface operates on remote direct memory access; creating a plurality of sharable memory spaces having partitioned data, wherein each space is a distributed memory object having a compute node, wherein the sharable memory spaces are at least one of persistent memory or DRAM cache; and storing data in an in-memory data structure when there is available memory in a compute node; and if there is an out of memory condition, serializing at least some of the in-memory data and spilling it to a distributed memory object system to persist shuffled data outside the compute node.

Shuffle manager in a distributed memory object architecture

A method for managing a document search index. The method includes obtaining indexing terms for documents in a document repository to generate search index fragments, storing the search index fragments in a document search index, and constructing a hierarchical structure from a first set of stored search index fragments. The selected first set of search index fragments is arranged by size, in the hierarchical structure. The method further includes selecting, based on a minimal size, a second set of stored search index fragments from the hierarchical structure, merging the second set of stored search index fragments to obtain a larger search index fragment, storing the larger search index fragment in the document search index, and serving at least one search request using the larger search index fragment.

Method and system for managing a document search index

A method for document search in a structured document repository. The method includes obtaining a document search query from a client, obtaining location constraints for documents to be identified in a structured document repository based on the document search query, identifying, in a document search index associated with the structured document repository, a document that matches the search query and the location constraints, and providing information associated with the identified document to the client.

Method and system for document search in structured document repositories

A method for servicing document search requests. The method includes receiving, by a document management service, a document search query from a requesting user, identifying, in a document repository, by the document management service, a document that matches the search query, and obtaining a permission level by the document management service, from an access control cache, based on a combination of the requesting user and an access control list required by the document. The access control cache is located on the document management service, and the access control cache is populated using content in an access control repository located on a repository server, separate from the document management service. The method further includes making a determination that the permission level is sufficient and based on the determination, returning the document to the requesting user, as a search result.

Method and system for cached document search

A method for document similarity analysis. The method includes obtaining a document to be archived, obtaining indexing terms for the document to be archived, and identifying document categories similar to the document to be archived, based on indexing terms and corresponding term frequencies. The method further includes making a determination that a weakly similar document category exists and based on the determination: generating a new document category and registering the document in the new document category, and registering the document in the weakly similar document category.

Method and system for document similarity analysis based on weak transitive relation of similarity

In general, in one aspect, the invention relates to a method for servicing requests, the method includes receiving, from a client system, a first request comprising a query, determining a first user associated with the first request, modifying the query to obtain a first modified query, where the first modified query includes a first permission definition token associated with the first user, processing the modified query to obtain a first object from a content repository, and providing the first object to the client system.

Method and system for processing search queries using permission definition tokens

A method for document similarity analysis. The method includes obtaining a document to be archived, and identifying a document category similar to the document to be archived. The similar document category is identified by: identifying a document category that includes indexing terms that are identical to indexing terms in the document to be archived, obtaining term frequency vectors for the identical indexing terms in the document to be archived and in the identified document category, generating normalized term frequency vectors, from the term frequency vectors, calculating a common denominator similarity based on the normalized term frequency vectors and a common denominator, and determining that the document category is similar to the document to be archived based on the common denominator similarity. The method further includes registering the document to be archived in the document category.

Method and system for document similarity analysis based on common denominator similarity

A method for tokenizing documents. The method includes obtaining a document comprising text to be tokenized, isolating a first string of consecutive characters in the document, searching, in a token tree, for an expression that matches the first string, making a determination that a matching expression exists in the token tree and, based on the determination, storing the matching expression as an extracted token.

Growing community of inventors

Shanghai, China

Kunwu Huang