Patent US6356902B1 successfully refreshed from Google Patents.
US6356902B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and system for storage and retrieval of multimedia objects
Assignee: Panasonic Holdings Corp
•
Filing: 1998-07-28
•
Granted: 2002-03-12
•
Expires: 2018-07-28
Abstract
Abstract A method for storing and organizing multimedia objects by decomposing a multi-level tree structure into a graph map using single-link graph nodes, assigning a name or address to each node in the tree structure in ascending order from a root node to the last leaf node, mapping each node in the tree structure to a single-link graph node having a pointer memory location, and storing the horizontal or vertical coupled graph nodes into a page memory.
Inventors
- 👤 Pek Yew Tan
- 👤 Kok Leong Ng
- 👤 Jianfeng Chen
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 13:14
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/40; G06F16/90; G06F16/901; G06F16/9024; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99933
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
185 words
A method for storing and organizing multimedia objects by decomposing a multi-level tree structure having a plurality of nodes into a graph map using single-link graph nodes corresponding to the plurality of nodes of the multi-level tree structure and implemented using a single set of memory locations, comprising: (a) assigning one of a name and an address to each node in the tree structure in ascending order from a root node until the last leaf nodes in the last level of the multiple level tree structure have been reached and storing the assigned one of the name and the address of the next multimedia object in the single-link graph node memory location; (b) mapping each node in the tree structure to a single-link graph node, said single-link graph node consisting of a pointer memory location that stores the one of the name and the address of a first child node of sub-tree nodes in a lower level of the tree structure; and (c) storing the graph nodes that are multimedia objects arranged one of horizontally and vertically in a tree structure into a page memory.
Claim 2
Independent Claim
185 words
A method for storing and organizing multimedia objects by decomposing a multi-level tree structure having a plurality of nodes into a graph map using single-link graph nodes corresponding to the plurality of nodes of the multi-level tree structure and implemented using a single set of memory locations, comprising: (a) assigning one of a name and an address to each node in the tree structure in ascending order from a root node until the last leaf nodes in the last level of the multiple level tree structure have been reached and storing the assigned one of the name and the address of the next multimedia object in the single-link graph node memory location; (b) mapping each node in the tree structure to a single-link graph node, said single-link graph node consisting of a pointer memory location that stores the one of the name and the address of a first child node of sub-tree nodes in a lower level of the tree structure; and (c) storing the graph nodes that are multimedia objects arranged one of horizontally and vertically in a tree structure into a page memory.
Claim 3
Dependent Claim
31 words
The method according to claim 1 , further comprising composing an arbitrary size tree structure into serially structured graph nodes with a single memory location that indicates a next multimedia object.
Claim 4
Dependent Claim
39 words
A method of packing sequentially ordered graph nodes into a page memory for graph nodes that are one of vertically and horizontally arranged in a tree structure based on the serially structured graph nodes according to claim 2 .
Claim 5
Dependent Claim
48 words
A method according to claim 1 , further comprising packing tree nodes into a memory page to minimize page faults during multimedia object retrieval by packing an integer number of serially structured graph nodes into the memory page bounded by the fixed memory space of the page memory.
Claim 6
Independent Claim
92 words
A method that enables organizing and administering a plurality of groups of multimedia objects organized in a tree structure in a distributed manner such that one entity manages the interconnection of one or more multimedia objects that do not belong to a same branch of a tree; and a federated manner such that one entity manages a group of branches or a specific branch of multimedia objects belonging to a tree, by storing network address and the memory location of the adjacent graph node in a pointer memory of a graph node.
Claim 7
Independent Claim
92 words
A method that enables organizing and administering a plurality of groups of multimedia objects organized in a tree structure in a distributed manner such that one entity manages the interconnection of one or more multimedia objects that do not belong to a same branch of a tree; and a federated manner such that one entity manages a group of branches or a specific branch of multimedia objects belonging to a tree, by storing network address and the memory location of the adjacent graph node in a pointer memory of a graph node.
References Cited (Backward Citations)
US4868743A
Cited
EP0650131A1
Cited
US6076106A
Cited
US5832182A
Cited
US6067093A
Cited
US5974572A
Cited
US6144962A
Cited
US6108676A
Cited
US6047331A
Cited
US6128719A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2005-03-11 | 2005-09-10 | 2006-03-12 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2009-03-11 | 2009-09-10 | 2010-03-12 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2013-03-11 | 2013-09-10 | 2014-03-12 | $7700.00 | Window Closed / Lapsed |