# US 2005/0097121 A1 · Content filtering, ordering by relevance, and caching

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

- Number: US 2005/0097121 A1
- Document ID: US20050097121A1
- Status: Published application
- Kind: A1
- Application number: 10/921,444
- Filed: 2004-08-19
- Published: 2005-05-05
- Earliest claimed: 2003-10-29
- Assignees: International Business Machines Corporation
- Inventors: Kevin Sally; Julie Waterhouse
- Web page: https://patentgrep.com/patent/US20050097121A1

## CPC

- G06F 16/9535: Search customisation based on user profiles and personalisation
- G06F 16/335: Filtering based on additional data, e.g. user or group profiles (filtering in web context G06F16/9535, G06F16/9536)
- G06F 16/9574: {of access to content, e.g. by caching}
- Y10S 707/99932: Access augmentation or optimizing
- Y10S 707/99936: Pattern matching access
- Y10S 707/99937: Sorting
- Y10S 707/99943: Generating database or data structure, e.g. via user interface
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- Y10S: TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS

## Abstract

There is disclosed a technique for organizing a plurality of content items. In an embodiment, the technique comprises assigning to each content item a content item array or bit string, wherein each unique ordinal or bit position indicates a characteristic of the content item. The content items may be filtered by applying a content filter including at least one filter rule concerning at least one characteristic of each content item. In an embodiment, a user preference bit string is used to indicate a user preference for one or more characteristics of the content items. The user preference bit string may be compared to each content item bit string to determine relevance a content item, and to order the content items according to the user's preferences. In an embodiment, the content items may be cached using a cache key generated from the user preference bit string.

## Claims

### Claim 1

A method of organizing a plurality of content items, comprising:
(i) assigning to each content item a content item array, wherein each ordinal of said content item array indicates a characteristic of said content item;
(ii) applying a content filter to said plurality of content items, said content filter including at least one filter rule concerning at least one characteristic of each said content item.

### Claim 2 (depends on 1)

The method of claim 1, wherein said array comprises a content item bit string, and said each ordinal comprises a unique bit position in said content item bit string.

### Claim 3 (depends on 2)

The method of claim 2, further comprising associating a display area with said content filter, and facilitating display in said display area of any of said plurality of content items that pass through said content filter.

### Claim 4 (depends on 2)

The method of claim 2, wherein said content filter is assembled from at least one filter rule, and multiple filter rules, if present, are combined by a logical operator.

### Claim 5 (depends on 4)

The method of claim 4, wherein said applying a content filter in (ii) comprises performing a bitwise AND operation between each said filter rule and each said content item bit string.

### Claim 6 (depends on 2)

The method of claim 2, further comprising, before (i), defining each possible characteristic of a content item, and assigning to each possible characteristic a unique bit position.

### Claim 7 (depends on 2)

The method of claim 2, wherein said characteristic comprises whether or not a defined subject area relates to said content item, and said content item bit string indicates, at each unique bit position, such a characteristic.

### Claim 8 (depends on 2)

The method of claim 2, further comprising:
(iii) assigning to each user of said plurality of content items a user preference bit string, wherein each unique bit position in said user preference bit string indicates whether said user has a preference for a characteristic represented by said unique bit position;
(iv) comparing said user preference bit string to each said content item bit string to determine if any characteristics match.

### Claim 9 (depends on 8)

The method of claim 8, wherein said comparing in (iv) comprises performing a bitwise AND operation between each said content item bit string and said user preference bit string.

### Claim 10 (depends on 8)

The method of claim 8, further comprising:
(v) calculating for each said content item a relevance value in dependence upon said comparing in (iv);
(vi) ordering said plurality of content items based, at least in part, on said relevance values calculated in (v).

### Claim 11 (depends on 10)

The method of claim 10, further comprising facilitating display in a display area said plurality of content items ordered in (vi).

### Claim 12 (depends on 9)

The method of claim 9, further comprising:
(v) calculating for each said content item a relevance value in dependence upon said comparing in (iv);
(vi) ordering said plurality of content items based, at least in part, on said relevance values calculated in (v).

### Claim 13 (depends on 12)

The method of claim 12, wherein, in (v), said relevance value is calculated by counting the number of matching characteristics in the results of said bitwise AND operation in (iv).

### Claim 14 (depends on 10)

The method of claim 10, further comprising:
(vii) caching said plurality of content items ordered in (vi) utilizing a cache key generated from said user preference bit string.

### Claim 15

A system comprising a processor and computer readable memory, said memory storing code for organizing a plurality of content items, said code being configured to:
(a) assign to each content item a content item array, wherein each ordinal of said content item array indicates a characteristic of said content item;
(b) apply a content filter to said plurality of content items, said content filter including at least one filter rule concerning at least one characteristic of each said content item.

### Claim 16 (depends on 15)

The system of claim 15, wherein said array comprises a content item bit string, and said each ordinal comprises a unique bit position in said content item bit string.

### Claim 17 (depends on 16)

The system of claim 16, wherein said code is further configured to associate a display area with said content filter, and facilitate display in said display area of any of said plurality of content items that have passed through said content filter.

### Claim 18 (depends on 16)

The system of claim 16, wherein said code is further configured to assemble said content filter from at least one filter rule, and to combine multiple filter rules, if present, by use of at least one logical operator.

### Claim 19 (depends on 18)

The system of claim 18, wherein in (b), said code is further configured to perform a bitwise AND operation between each said filter rule and each said content item bit string.

### Claim 20 (depends on 16)

The system of claim 16, wherein said code is further configured to define each possible characteristic of a content item, and assign to each possible characteristic a unique bit position.

### Claim 21 (depends on 16)

The system of claim 16, wherein said characteristic comprises whether or not a defined subject area relates to said content item, and said code is configured to indicate, at each unique bit position of said content item bit string, such a characteristic.

### Claim 22 (depends on 16)

The system of claim 16, wherein said code is further configured to:
(c) assign to each user of said plurality of content items a user preference bit string, wherein each unique bit position in said user preference bit string indicates whether said user has a preference for a corresponding characteristic of said content items;
(d) compare said user preference bit string to each said content item bit string to determine if any characteristics match.

### Claim 23 (depends on 21)

The system of claim 21, wherein, in (d), said code is configured to perform a bitwise AND operation between each said content item bit string and said user preference bit string.

### Claim 24 (depends on 22)

The system of claim 22, wherein said code is further configured to:
(e) calculate for each said content item a relevance value in dependence upon said comparison in (d);
(f) order said plurality of content items based, at least in part, on said relevance values calculated in (e).

### Claim 25 (depends on 24)

The system of claim 24, wherein said code is further configured to facilitate display in a display area of said plurality of content items ordered in (f).

### Claim 26 (depends on 23)

The system of claim 23, wherein said code is further configured to:
(e) calculate for each said content item a relevance value in dependence upon said comparing in (d);
(f) order said plurality of content items based, at least in part, on said relevance values calculated in (e).

### Claim 27 (depends on 26)

The system of claim 26, wherein, in (e), said relevance value is calculated by counting the number of matching characteristics in the results of said bitwise AND operation in (d).

### Claim 28 (depends on 24)

The system of claim 24, wherein said code is further configured to:
(g) cache said plurality of content items ordered in (f) utilizing a cache key generated from said user preference bit string.

### Claim 29

A computer readable medium containing computer executable code for organizing a plurality of content items, said computer executable code comprising:
(a) code for assigning to each content item a content item array, wherein each ordinal of said content item array indicates a characteristic of said content item;
(b) code for applying a content filter to said plurality of content items, said content filter including at least one filter rule concerning at least one characteristic of each said content item.

### Claim 30 (depends on 29)

The computer readable medium of claim 29, wherein said array comprises a content item bit string, and said each ordinal comprises a unique bit position in said content item bit string.

### Claim 31 (depends on 30)

The computer readable medium of claim 30, wherein said computer executable code further comprises code for associating a display area with said content filter, and facilitating display in said display area any of said plurality of content items that have passed through said content filter.

### Claim 32 (depends on 30)

The computer readable medium of claim 30, wherein said computer executable code further comprises code for assembling said content filter from a plurality of filter rules using at least one logical operator.

### Claim 33 (depends on 32)

The system of claim 32, wherein said code in (b) comprises code for performing a bitwise AND operation between each said filter rule and each said content item bit string.

### Claim 34 (depends on 30)

The computer readable medium of claim 30, wherein said computer executable code further comprises code for defining each possible characteristic of a content item, and assigning to each possible characteristic a unique bit position.

### Claim 35 (depends on 30)

The computer readable medium of claim 30, wherein said characteristic comprises whether or not a defined subject area relates to said content item, and said computer executable code includes code for indicating, at each unique bit position of said content item bit string, such a characteristic.

### Claim 36 (depends on 30)

The computer readable medium of claim 30, wherein said computer executable code further comprises:
(c) code for assigning to each user of said plurality of content items a user preference bit string, wherein each unique bit position in said user preference bit string indicates whether said user has a preference for a corresponding characteristic of said content items;
(d) code for comparing said user preference bit string to each said content item bit string to determine if any characteristics match.

### Claim 37 (depends on 36)

The computer readable medium of claim 36, wherein, in (d), said computer executable code includes code for performing a bitwise AND operation between each said content item bit string and said user preference bit string.

### Claim 38 (depends on 36)

The computer readable medium of claim 36, wherein said computer executable code further comprises:
(e) code for calculating for each said content item a relevance value in dependence upon said comparing in (d);
(f) code for ordering said plurality of content items based, at least in part, on said relevance values calculated in (e).

### Claim 39 (depends on 38)

The computer readable medium of claim 38, wherein said computer executable code further includes code for facilitating display in a display area of said plurality of content items ordered in (f).

### Claim 40 (depends on 37)

The computer readable medium of claim 37, wherein said computer executable code further comprises:
(e) code for calculating for each said content item a relevance value in dependence upon said comparing in (d);
(f) code for ordering said plurality of content items based, at least in part, on said relevance values calculated in (e).

### Claim 41 (depends on 40)

The computer readable medium of claim 40, wherein, in (e), said code for calculating a relevance value for each said content item comprises code for counting the number of matching characteristics in the results of said bitwise AND operation in (d).

### Claim 42 (depends on 38)

The computer readable medium of claim 38, wherein said computer executable code further comprises:
(g) code for caching said plurality of content items ordered in (f) utilizing a cache key generated from said user preference bit string.
