The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Dec. 11, 2018

Filed:

Feb. 06, 2015
Applicant:

International Business Machines Corporation, Armonk, NY (US);

Inventors:

Brent Benton, North Vancouver, CA;

Thomas Hampp-Bahnmueller, Stuttgart, GE;

Dana W. Morris, Arlington, VA (US);

Daniel Pittner, Steinenbronn, DE;

Thomas Schaeck, Achern, DE;

Dieter Schieber, Jettingen, DE;

Attorney:
Primary Examiner:
Assistant Examiner:
Int. Cl.
CPC ...
G06F 17/30 (2006.01); H04L 29/08 (2006.01);
U.S. Cl.
CPC ...
G06F 17/30 (2013.01); H04L 67/104 (2013.01);
Abstract

Providing access to media data shared by multiple users. A predefined edge weight is assigned to each edge of a linked data structure based on a dependency category of the edge. A first access rating value is assigned to each node. A rating residue value is calculated as the difference between the two first access rating values of the nodes connected by each edge. The data structure is traversed from a seed node, and for each edge traversed, calculating a second access rating value using an edge weight value and the first access rating value. Repeating until the rating residue values meet a predefined convergence criterion. The nodes having access rating values meeting a predefined data removal criterion are selected from the nodes of the linked data structure. The data entities corresponding to the selected nodes are then removed.


Find Patent Forward Citations

Loading…