# US 2018/0322304 A1 · Data allocation based on secure information retrieval

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

- Number: US 2018/0322304 A1
- Document ID: US20180322304A1
- Status: Published application
- Kind: A1
- Application number: 15/774,708
- Filed: 2015-11-10
- Published: 2018-11-08
- Earliest claimed: 2015-11-10
- Assignees: Hewlett Packard Enterprise Development LP
- Applicants: Hewlett Packard Enterprise Development LP
- Inventors: Mehran Kafai; Manav Das
- Web page: https://patentgrep.com/patent/US20180322304A1

## CPC

- G06F 21/6227: {where protection concerns the structure of data, e.g. records, types, queries}
- G06F 16/2455: Query execution
- G06F 16/24578: {using ranking}
- G06F 21/62: Protecting access to data via a platform, e.g. using keys or access control rules
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Data allocation based on secure information retrieval is disclosed. One example is a system including an information processor communicatively linked to a query processor and a plurality of data processors respectively associated with a plurality of datasets. The information processor receives a request from the query processor for identification of a target dataset to be associated with a query term. The information processor generates a random permutation, and receives a secure version of the query term from the query processor, and receives secure versions of a collection of candidate terms from each of a plurality of data processors, each candidate term representing a cluster of similar terms in the associated dataset. The information processor determines similarity scores between the secure version of the query term and secure versions of the candidate terms, and identifies the target dataset of the plurality of datasets based on the determined similarity scores.

## Claims

### Claim 1

A system for data allocation based on secure information retrieval, the system comprising:
an information processor communicatively linked to a query processor and a plurality of data processors respectively associated with a plurality of datasets, wherein the information processor is to:
receive, from the query processor, a request for identification of a target dataset to be associated with a query term, the request including a hash length and a hash number;
generate a random permutation based on the hash length;
receive, from the query processor, a secure version of the query term, the secure version based on the hash number and the permutation;
receive, from each of a plurality of data processors, secure versions of a collection of candidate terms, wherein each candidate term represents a cluster of similar terms in the associated dataset, and wherein the secure versions are based on the hash number and the permutation;
determine similarity scores between the secure version of the query term and secure versions of the candidate terms; and
identify the target dataset of the plurality of datasets based on the determined similarity scores.

### Claim 2 (depends on 1)

The system of claim 1, wherein the information processor is to provide the query term to the identified target dataset.

### Claim 3 (depends on 1)

The system of claim 1, wherein the information processor is to identify the target dataset by:
select, for each of the plurality of data processors, a representative term of the collection of candidate terms;
provide, to each of the plurality of data processors, the respective representative term;
receive, from each of the plurality of data processors, a comparative statistic between the representative term and its cluster of similar terms; and
identify the target dataset based on the comparative statistic.

### Claim 4 (depends on 1)

The system of claim 1, wherein the secure terms are based on applying orthogonal transforms to the respective terms.

### Claim 5 (depends on 1)

The system of claim 1, wherein the plurality of datasets is a respective plurality of secure storage containers, and the query term is a data term to be stored in a target storage container associated with the target dataset.

### Claim 6 (depends on 1)

The system of claim 1, wherein the information processor is to:
rank the plurality of datasets based on the determined similarity scores; and
provide, to the query processor, the ranked list of datasets.

### Claim 7 (depends on 5)

The system of claim 5, wherein the information processor is to identify the target dataset based on the ranking.

### Claim 8 (depends on 1)

The system of claim 1, wherein the information processor is to select a target cluster of the target dataset based on the determined similarity scores, and is to associate the query term with the target cluster in the target dataset.

### Claim 9 (depends on 1)

The system of claim 1, wherein the information processor is to:
receive a second query term from the query processor;
determine if the second query term is similar to the query term;
upon a determination that the second query term is similar to the query term, provide the second query term to the identified target dataset; and
upon a determination that the second query term is not similar to the query term, identify a second target dataset, and provide the second query term to the identified second target dataset.

### Claim 10

A method for data allocation based on secure information retrieval, the method comprising:
receiving, from a query processor, a request for identification of a target dataset to be associated with a query term, the request including a hash length and a hash number;
generating a random permutation based on the hash length;
receiving, from the query processor, a secure version of the query term, the secure version based on the hash number and the permutation;
receiving, from each of the plurality of data processors associated with a plurality of datasets, secure versions of a collection of candidate terms, wherein each candidate term represents a cluster of similar terms in the associated dataset, and wherein the secure versions are based on the hash number and the permutation;
determining similarity scores between the secure version of the query term and secure versions of the candidate terms;
selecting, for each of the plurality of data processors, a representative term of the collection of candidate terms;
receiving, from each of the plurality of data processors, a comparative statistic between the representative term and its cluster of similar terms; and
identifying the target dataset of the plurality of datasets based on the comparative statistic.

### Claim 11 (depends on 10)

The method of claim 10, comprising providing the query term to the identified target dataset.

### Claim 12 (depends on 10)

The method of claim 10, comprising selecting a target cluster of the target dataset based on the determined similarity scores, and associating the query term with the target cluster in the target dataset.

### Claim 13 (depends on 10)

The method of claim 10, wherein the plurality of datasets is a respective plurality of secure storage containers, and the query term is a data term to be stored in a target storage container associated with the target dataset.

### Claim 14

A non-transitory computer readable medium comprising executable instructions to:
receive, from a query processor, a request for identification of a target dataset to be associated with a query term, the request including a hash length and a hash number;
generate a random permutation based on the hash length;
receive, from the query processor, a secure version of the query term, the secure version based on the hash number and the permutation;
receive, from each of the plurality of data processors associated with a plurality of datasets, secure versions of a collection of candidate terms, wherein each candidate term represents a cluster of similar terms in the associated dataset, and wherein the secure versions are based on the hash number and the permutation;
determine similarity scores between the secure version of the query term and secure versions of the candidate terms;
identify the target dataset of the plurality of datasets based on the determined similarity scores; and
provide the query term to the identified target dataset.

### Claim 15 (depends on 14)

The computer readable medium of claim 14, comprising executable instructions to:
select a target cluster of the target dataset based on the determined similarity scores; and
associate the query term with the target cluster in the target dataset.
