Patent application number | Description | Published |
20100145943 | Using Message Sampling To Determine The Most Frequent Words In A User Mailbox - A method is presented for generating a list of frequently used words for an email application on a server computer. When a request is received for a word frequency list for emails stored in a user's mailbox, a word frequency list is returned if one exists. If the word frequency list does not exist, an asynchronous process is started on the server computer to generate a word frequency list. If the word frequency list exists but it is older than an aging limit, an asynchronous process is started on the server computer to regenerate the word frequency list. The word frequency list is stored in the user's mailbox along with a timestamp indicating the date and time that the list was created or updated. | 06-10-2010 |
20110055196 | DATA MINING ELECTRONIC COMMUNICATIONS - User insights derived from communication data may be provided. Communications associated with a user may be collected and analyzed to derive insights about the user. The insight may then be provided to the user, such as for modifying an application functionality, creating a message processing rule, providing new information to the user, and updating an application display or user interface. | 03-03-2011 |
20110055264 | DATA MINING ORGANIZATION COMMUNICATIONS - Data mining for organization insights may be provided. Data from a plurality of sources, such as user communications and documents, may be collected. The collected data may be analyzed to identify an insight about users or organizations associated with the communications. The insight may be provided to a user, such as in response to a search query, an analytics tool, or an added application functionality. | 03-03-2011 |
20110145208 | POLICY DRIVEN DISTRIBUTED DATA RESILIENCY - A data resiliency layer provides manageable data resiliency policy options for email related applications. Through one or more APIs such applications are enabled to query whether a data resiliency policy is satisfied for a given mailbox or database at a given point in time. Email related applications may consume this information to modify their behavior such as to wait, repeat, or fail the actions at hand to the point where data committal is guaranteed to a degree specified by the data resiliency policy. | 06-16-2011 |
20110145565 | FEDERATED AUTHENTICATION FOR MAILBOX REPLICATION - A data replication mechanism is proposed that relies on existing federation infrastructure enabling distributed authentication instead of storing and using explicit credentials for a remote forest. The data replication mechanism requests a federation token with data replication capabilities targeted to the remote forest and passes this token to the remote forest in lieu of explicit credentials. | 06-16-2011 |
20110167039 | DISTRIBUTED THROTTLING FOR MAILBOX DATA REPLICATION - Distributed mailbox data replication agents are employed to adjust load on mail system resources by enabling the agents to receive a throttling policy, resource capacity, and current usage information. Each agent preparing to access the resource (e.g. provide replicated data) may then throttle itself ensuring optimum resource usage. The agents may receive the information by querying the resource, which monitors accessing agents and their types, or from a shared space instead of directly from the resource. | 07-07-2011 |
20110185136 | MOVING LARGE DYNAMIC DATASETS VIA INCREMENTAL CHANGE SYNCHRONIZATION - Incremental change synchronization for moving large data sets may be provided. Source data to be moved may be identified and a snapshot of the data may be created. The data may be moved to a new datastore and a second snapshot may be created. The snapshots may be compared to identify any data elements that have been modified and the modified elements may be copied to the new datastore. | 07-28-2011 |
20110185247 | MASSIVE STRUCTURED DATA TRANSFER OPTIMIZATIONS FOR HIGH-LATENCY, LOW-RELIABILITY NETWORKS - Optimizations for data transmission may be provided. A portion of a data block may be read into a batch by a read thread on a first server. The batch may be passed to a transmission thread. The transmission thread may then transmit the first batch to a second server while the read thread asynchronously reads a second portion of the data block into another batch. | 07-28-2011 |
20110320467 | Using Message Sampling To Determine The Most Frequent Words In A User Mailbox - A method is presented for generating a list of frequently used words for an email application on a server computer. When a request is received for a word frequency list for emails stored in a user's mailbox, a word frequency list is returned if one exists. If the word frequency list does not exist, an asynchronous process is started on the server computer to generate a word frequency list. If the word frequency list exists but it is older than an aging limit, an asynchronous process is started on the server computer to regenerate the word frequency list. The word frequency list is stored in the user's mailbox along with a timestamp indicating the date and time that the list was created or updated. | 12-29-2011 |