Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2005-12-20
2005-12-20
Pham, Khanh (Department: 2167)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000, C707S793000, C711S100000, C711S216000
Reexamination Certificate
active
06978271
ABSTRACT:
Mechanisms and methods for traversing trees are disclosed. A novel data structure for modeling a node that includes a unique node counter also is described. In certain embodiments of the inventions the unique node counter is a timestamp of sufficient granularity to render each timestamp in the tree unique. A node counter, in conjunction with the lineage of a specified continuation node may be used to locate an appropriate starting point within a tree in a continuation call when the specified continuation node no longer exists in the tree.
REFERENCES:
patent: 4823310 (1989-04-01), Grand
patent: 6567815 (2003-05-01), Rubin et al.
patent: 6597957 (2003-07-01), Beakley
patent: 6725244 (2004-04-01), Bonwick
patent: 6728955 (2004-04-01), Berry et al.
Dale et al., “Abstract Data Types: Specifications, Implementations, and Applications”, Lexington, Mass. Jones & Bartlett publishers, Inc, 1996.
Cleary et al., “Timestamp Representations for Virtual Sequences”, Proceeding to the 11thworkshop on Parallel and Distributed simulation, 1997, pp. 98-105.
Hoffman Philip M.
Kogen Clark C.
Liermann Robert K.
Milligan Andrew David
LandOfFree
Mechanism for continuable calls to partially traverse a... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Mechanism for continuable calls to partially traverse a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mechanism for continuable calls to partially traverse a... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3496275