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.
Patent No.:
Date of Patent:
Sep. 24, 2013
Filed:
Aug. 22, 2005
Yao-ching Stephen Chen, Saratoga, CA (US);
Yue Huang, San Jose, CA (US);
Fen-ling Lin, San Jose, CA (US);
Brian Thinh-vinh Tran, San Jose, CA (US);
Guogen Zhang, San Jose, CA (US);
Yao-Ching Stephen Chen, Saratoga, CA (US);
Yue Huang, San Jose, CA (US);
Fen-Ling Lin, San Jose, CA (US);
Brian Thinh-Vinh Tran, San Jose, CA (US);
Guogen Zhang, San Jose, CA (US);
International Business Machines Corporation, Armonk, NY (US);
Abstract
A storage of nodes of hierarchically structured data uses logical node identifiers to reference the nodes stored within and across record data structures. A node identifier index is used to map each logical node identifier to a record identifier for the record that contains the node. When a sub-tree is stored in a separate record, a proxy node is used to represent the sub-tree in the parent record. The mapping in the node identifier index reflects the storage of the sub-tree nodes in the separate record. Since the references between the records are through logical node identifiers, there is no limitation to the moving of records across pages, as long as the indices are updated or rebuilt to maintain synchronization with the resulting data pages. This approach is highly scalable and has a much smaller storage consumption than approaches that use explicit references between nodes.