# US 2009/0157810 A1 · Relevance-based expiration of data

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2009/0157810 A1
- Document ID: US20090157810A1
- Status: Published application
- Kind: A1
- Application number: 11/956,481
- Filed: 2007-12-14
- Published: 2009-06-18
- Earliest claimed: 2007-12-14
- Assignees: Microsoft Corporation
- Inventors: Ashutosh Tripathi; Jonathan Shriver-Blake; Amit Kripalani; Dharmanand Singh; Rohit Gupta; Shirish Koti
- Web page: https://patentgrep.com/patent/US20090157810A1

## CPC

- G06F 16/93: Document management systems
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Technologies are described herein for relevance-based expiration of data. An initial expiration time for the data is computed based upon an expiration duration associated with the data. The expiration time for the data is periodically re-computed in order to extend the expiration time. A relevance value for the meeting data is computed and the expiration time is set as a function of the computed relevance value. The relevance value may be computed as a product of a user-settable relevance value for the meeting data and a dynamic relevance point for the meeting data. When the computed expiration time for meeting data has been reached, the meeting data is expired, such as through the deletion of the meeting data.

## Claims

### Claim 1

A method for relevance-based expiration of data, the method comprising:
storing the data;
computing a relevance value for the data;
determining an expiration time for the data based upon the computed relevance value for the data; and
expiring the data after the determined expiration time.

### Claim 2 (depends on 1)

The method of claim 1, further comprising prior to expiring the data:
re-computing the relevance value for the data; and
updating the expiration time for the data based upon the re-computed relevance value for the data.

### Claim 3 (depends on 2)

The method of claim 2, wherein computing a relevance value for the data comprises:
identifying a user-settable relevance value for the data;
computing a dynamic relevance point for the data; and
multiplying the user-settable relevance value for the data by the dynamic relevance point for the data to compute the relevance value for the data.

### Claim 4 (depends on 3)

The method of claim 3, wherein the dynamic relevance point is computed as a function of a frequency of access of the data.

### Claim 5 (depends on 4)

The method of claim 4, wherein the data comprises meeting content and a meeting recording.

### Claim 6 (depends on 4)

The method of claim 4, wherein expiring the data comprises deleting the data.

### Claim 7 (depends on 4)

The method of claim 4, wherein determining an expiration time for the data based upon the computed relevance value for the data comprises:
defining an expiration duration for the data, the expiration duration defining the minimum amount of time that should elapse prior to expiring the data; and
computing the expiration time for the data by multiplying the computed relevance value for the data by the expiration duration and adding a time that the data was last accessed.

### Claim 8 (depends on 7)

The method of claim 7, wherein the expiration duration is initially defined by a license.

### Claim 9 (depends on 4)

The method of claim 4, wherein determining an expiration time for the data based upon the computed relevance value for the data comprises:
defining an expiration duration for the data, the expiration duration defining the minimum amount of time that should elapse prior to expiring the data; and
computing the expiration time for the data by multiplying the computed relevance of the data by the expiration duration and adding a previously calculated expiration time.

### Claim 10 (depends on 9)

The method of claim 9, wherein the expiration duration is initially defined by a license.

### Claim 11

A computer-readable medium having computer executable instructions stored thereon which, when executed by a computer, cause the computer to:
store meeting data comprising content for a meeting and a recording of the meeting;
compute an initial expiration time for the meeting data based upon an expiration duration associated with the meeting data;
periodically re-compute the expiration time by determining a relevance value for the meeting data and setting the expiration time as a function of the relevance value; and
expiring the meeting data after the expiration time.

### Claim 12 (depends on 11)

The computer-readable medium of claim 11, wherein determining a relevance value for the meeting data comprises:
identifying a user-settable relevance value for the meeting data;
computing a dynamic relevance point for the meeting data; and
multiplying the user-settable relevance value for the meeting data by the dynamic relevance point for the meeting data to compute the relevance value for the meeting data.

### Claim 13 (depends on 12)

The computer-readable medium of claim 12, wherein the dynamic relevance point is computed as a function of a frequency of access of the meeting data.

### Claim 14 (depends on 13)

The computer-readable medium of claim 13, wherein setting the expiration time as a function of the relevance value comprises computing the expiration time for the meeting data by multiplying the computed relevance value for the meeting data by the expiration duration and adding a time that the meeting data was last accessed.

### Claim 15 (depends on 13)

The computer-readable medium of claim 13, wherein setting the expiration time as a function of the relevance value comprises computing the expiration time for the meeting data by multiplying the computed relevance of the meeting data by the expiration duration and adding a previously calculated expiration time.

### Claim 16 (depends on 13)

The computer-readable medium of claim 13, wherein expiring the meeting data comprises deleting the meeting data.

### Claim 17

A method for relevance-based expiration of meeting data, the method comprising:
storing meeting data at a conferencing server computer, the meeting data comprising content for a meeting and a recording of the meeting;
storing a license at the conferencing server computer, the license defining an expiration duration for the meeting data;
computing an initial expiration time for the meeting data, the initial expiration time based upon the expiration duration;
periodically re-computing the expiration time for the meeting data by identifying a user-settable relevance value for the meeting data, computing a dynamic relevance point for the meeting data, multiplying the user-settable relevance value for the meeting data by the dynamic relevance point for the meeting data to compute a relevance value for the meeting data, and setting the expiration time for the meeting data as a function of the computed relevance value; and
expiring the meeting data after the computed expiration time.

### Claim 18 (depends on 17)

The method of claim 17, wherein setting the expiration time for the meeting data as a function of the computed relevance value comprises setting the expiration time for the meeting data to a time defined by the product of the computed relevance value for the meeting data and the expiration duration added to a time that the meeting data was last accessed.

### Claim 19 (depends on 17)

The method of claim 17, wherein setting the expiration time for the meeting data as a function of the computed relevance value comprises setting the expiration time for the meeting data to a time defined by the product of the computed relevance of the meeting data and the expiration duration added to a previously calculated expiration time.

### Claim 20 (depends on 17)

The method of claim 17, wherein a first expiration time is computed for the content and wherein a second expiration time is computed for the recording.
