IP Library › Granted Patent US 10,133,811
Granted Patent B2
US 10,133,811 · App. 15/064,982 · Granted Nov 20, 2018

Non-transitory computer-readable recording medium, data arrangement method, and data arrangement apparatus

Inventors: Yui Noma (Kawasaki, JP); Makiko Konoshima (Kawasaki, JP)
Assignee: FUJITSU LIMITED
G06F17/30675G06F17/30312G06F17/30483G06F17/30575G06F17/30705
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,133,811
App. No.
15/064,982
Granted
Nov 20, 2018
Kind
B2
Abstract

A data arrangement apparatus executes a process request on data stored in a database, calculates similarity of a process in a combination of the process request and the data, divides the data in such a manner as to distribute the similarity and processes a process request accepted for the divided data.

Claims (16)

1. A non-transitory computer-readable recording medium having stored therein a data arrangement program that causes a computer to execute a process comprising:

calculating a similarity between a process request and a piece of data to generate an intermediate table, by processing each of a plurality of pieces of data that are stored in a database by each of process requests of a plurality of types to measure a time taken by the processing, the time being used as an index indicating the similarity, the intermediate table indicating the similarity for each combination of the plurality of pieces of data and the process requests and having a dimension equal to a number of the process requests;

merging process requests in the intermediate table whose similarities with respect to same pieces of data are similar one another to reduce the dimension;

classifying into a same cluster pieces of data, similarities thereof with respect to same process requests indicated in the intermediate table being partially similar one another, and arranging each of the pieces of data included in the same cluster respectively in different computational resources; and

processing a process request accepted, for the pieces of data that are arranged in the computational resources.

2. A data arrangement method that is executed by a computer, the data arrangement method comprising:

calculating a similarity between a process request and a piece of data to generate an intermediate table, by processing each of a plurality of pieces of data that are stored in a database by each of process requests of a plurality of types to measure a time taken by the processing, the time being used as an index indicating the similarity, the intermediate table indicating the similarity for each combination of the plurality of pieces of data and the process requests and having a dimension equal to a number of the process requests;

merging process requests in the intermediate table whose similarities with respect to same pieces of data are similar one another to reduce the dimension;

classifying into a same cluster pieces of data, similarities thereof with respect to same process requests indicated in the intermediate table being partially similar one another, and arranging each of the pieces of data included in the same cluster respectively in different computational resources; and

processing a process request accepted, for the pieces of data that are arranged in the computational resources.

3. A data arrangement apparatus comprising:

a processor that executes a process comprising:

calculating a similarity between a process request and a piece of data to generate an intermediate table, by processing each of a plurality of pieces of data that are stored in a database by each of process requests of a plurality of types to measure a time taken by the processing, the time being used as an index indicating the similarity, the intermediate table indicating the similarity for each combination of the plurality of pieces of data and the process requests and having a dimension equal to a number of the process requests;

merging process requests in the intermediate table whose similarities with respect to same pieces of data are similar one another to reduce the dimension;

classifying into a same cluster pieces of data, similarities thereof with respect to same process requests indicated in the intermediate table being partially similar one another, and arranging each of the pieces of data included in the same cluster respectively in different computational resources; and

processing a process request accepted, for the pieces of data that are arranged in the computational resources.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 17, 2016
From: NOMA, YUI; KONOSHIMA, MAKIKO
To: FUJITSU LIMITED
Reel/Frame 038008/0596 →
Priority Claims (1)
JP 2015-048214 · Mar 11, 2015 · national
Continuity (1)
Related Publication 20160267173A1 · Sep 15, 2016