TERMINAL DEVICE, INFORMATION PROCESSING METHOD, AND COMPUTER PROGRAM PRODUCT

• US 20140320498A1
• Filed: 03/12/2014
• Published: 10/30/2014
• Est. Priority Date: 04/26/2013
• Status: Abandoned Application

• Current Assignee: Kabushiki Kaisha Toshiba (Toshiba Corporation)
• Original Assignee: Kabushiki Kaisha Toshiba (Toshiba Corporation)
• Inventors: AJITOMI, Daisuke, MINAMI, Keisuke, GOTO, Masataka
• Application Number:
  US14/205,765
• Publication Number:
  US 20140320498A1
• Time in Patent Office: Days
• US Class Current: 345/440
• CPC Class Codes: G06T 11/206 Drawing of charts or graphs

Abstract

According to an embodiment, a terminal device includes a memory unit, a managing unit, a detecting unit, a reference assigning unit, a reference deleting unit, a determining unit, and a changing unit, and a deleting unit. The detector detects that a first graph element read by a processing unit is updated before the start of transactions being executed by the processing unit. The determining unit determines that a first graph element is updated before the start of the oldest transaction being executed and does not have reference information assigned thereto. The first graph element is pointed to by link information of a second information. The changing unit changes the link information of the second graph element to point to a third graph element, or delete the link information. The deleting unit deletes the first graph element.

Claims

1. A terminal device comprising:

a memory unit configured to store therein graph elements each representing a node or an edge constituting graph structure data;

a managing unit configured to generate and delete a processing unit which executes transactions each performing data manipulation on an individual basis with respect to the graph elements stored in the memory unit;

a detector configured to detect that the graph element read by the processing unit is updated before the start of transaction being executed by the processing unit;

a reference assigning unit configured to assign reference information to the graph element detected by the detector;

a reference deleting unit configured to, at the end of a transaction which has performed manipulation with respect to the graph element having reference information assigned thereto by the reference assigning unit, delete the reference information assigned to the graph element which has been manipulated;

a determining unit configured to determine that a first graph element is updated before the start of the oldest transaction being executed and does not have reference information assigned thereto, the first graph element being pointed to by link information of a second information;

a changing unit configured to change the link information of the second graph element to point to a third graph element, or delete the link information; and

a deleting unit configured to delete the first graph element.

2. The device according to claim 1, wherein, when a number of pieces of reference information becomes equal to zero as a result of deletion of reference information by the reference information deleting unit, the determining unit performs determination with respect to the graph element.

3. The device according to claim 1, wherein the determining unit performs determination with respect to a target graph element for determination in a predetermined cycle.

4. The device according to claim 3, wherein the target graph element for determination is either one of a pre-updating graph element that is notified to the determining unit by the processing unit after updating is decided, a graph element that is detected by the detecting unit and notified to the determining unit, and a graph element that is notified to the determining unit by the reference assigning unit at the time of assigning or by the reference deleting unit at the time of deleting.

5. The device according to claim 1, wherein

the link information represents link information from an edge to a node, and

when an operation with respect to a node indicates deletion, the changing unit notifies the determining unit about an edge having the link information as a target for deletion.

6. An information processing method for storing data in a terminal device that includes a memory unit which stores therein graph elements each representing a node or an edge constituting graph structure data, the method comprising:

generating and deleting a processing unit which executes transactions each performing data manipulation on an individual basis with respect to the graph element stored in the memory unit;

detecting that the graph element read by the processing unit is updated before the start of transaction being executed by the processing unit;

assigning reference information to the graph element detected in the detecting;

deleting, at the end of a transaction which has performed manipulation with respect to the graph element having reference information assigned thereto, the reference information assigned to the graph element which has been manipulated;

determining that a first graph element is updated before the start of the oldest transaction being executed and does not have reference information assigned thereto, the first graph element being pointed to by link information of a second information;

changing the link information of the second graph element to point to a third graph element, or deleting the link information; and

deleting the first graph element.

7. A computer program product comprising a computer-readable medium containing an image processing program for storing data in a terminal device that includes a memory unit which stores therein graph elements each representing a node or an edge constituting graph structure data, wherein the program, when executed by a computer, causes the computer to perform:

generating and deleting a processing unit which executes transactions each performing data manipulation on an individual basis with respect to the graph element stored in the memory unit;

detecting that the graph element read by the processing unit is updated before the start of transaction being executed by the processing unit;

assigning reference information to the graph element detected in the detecting;

deleting, at the end of a transaction which has performed manipulation with respect to the graph element having reference information assigned thereto, the reference information assigned to the graph element which has been manipulated;

determining that a first graph element is updated before the start of the oldest transaction being executed and does not have reference information assigned thereto, the first graph element being pointed to by link information of a second information;

changing the link information of the second graph element to point to a third graph element, or deleting the link information; and

deleting the first graph element.