Traversing data in a repeatable manner

Details Traversing data in a repeatable manner Traversing data in a repeatable manner

2005-04-14

2010-02-02

Stevens, Robert (Department: 2162)

Data processing: database and file management or data structures

Database design

Data structure types

C707S793000, C711S161000, C711S162000

Reexamination Certificate

active

07657579

ABSTRACT:
Traversing hierarchical data is disclosed. A first list of items in a first level of the data is received and sorted in an order. The data of the first level is processed in the order of the sorted first list. If any other level of data is encountered during processing, another list of items in the encountered level is received and sorted in an order. The data is processed in the order of the list.

REFERENCES:
patent: 4453217 (1984-06-01), Boivie
patent: 5241668 (1993-08-01), Eastridge et al.
patent: 5276874 (1994-01-01), Thomson
patent: 5644736 (1997-07-01), Healy et al.
patent: 5764877 (1998-06-01), Lomet et al.
patent: 5838783 (1998-11-01), Cheng et al.
patent: 5918229 (1999-06-01), Davis et al.
patent: 6148377 (2000-11-01), Carter et al.
patent: 6199074 (2001-03-01), Kern et al.
patent: 6330570 (2001-12-01), Crighton
patent: 6625591 (2003-09-01), Vahalia et al.
patent: 6647393 (2003-11-01), Dietterich et al.
patent: 6687849 (2004-02-01), Cherf
patent: 6779003 (2004-08-01), Midgley et al.
patent: 6804690 (2004-10-01), Dysert et al.
patent: 7007047 (2006-02-01), Zelenka et al.
patent: 7069402 (2006-06-01), Coulter et al.
patent: 7085962 (2006-08-01), Hamilton et al.
patent: 7234077 (2007-06-01), Curran et al.
patent: 7546305 (2009-06-01), Sathyanarayan
patent: 2001/0054042 (2001-12-01), Watkins et al.
patent: 2002/0012296 (2002-01-01), Suzuki
patent: 2002/0075331 (2002-06-01), Orbanes et al.
patent: 2002/0103982 (2002-08-01), Ballard et al.
patent: 2002/0107877 (2002-08-01), Whiting et al.
patent: 2002/0152194 (2002-10-01), Sathyanarayan
patent: 2003/0018878 (2003-01-01), Dorward et al.
patent: 2003/0056139 (2003-03-01), Murray et al.
patent: 2003/0093420 (2003-05-01), Ramme
patent: 2003/0135704 (2003-07-01), Martin
patent: 2003/0172094 (2003-09-01), Lauria et al.
patent: 2003/0187883 (2003-10-01), Zelenka et al.
patent: 2003/0236933 (2003-12-01), Shigeta et al.
patent: 2004/0117410 (2004-06-01), Dietterich et al.
patent: 2004/0199485 (2004-10-01), Caswell
patent: 2004/0267822 (2004-12-01), Curran et al.
patent: 2004/0267838 (2004-12-01), Curran et al.
patent: 2005/0027757 (2005-02-01), Kiessig et al.
patent: 2005/0033911 (2005-02-01), Kitamura et al.
patent: 2008/0126445 (2008-05-01), Michelman
Vipin Kumar, V. Nageshware Rao, “Parallel depth first search. Part II. Analysis”, Springer Netherlands, International Journal of Parallel Programming, vol. 16, No. 6 / Dec. 1987, 501-519.
Quinlan, Sean, et al., “Venti: A New Approach to Archival Storage”, Proc. Of the FAST 2002 Conf. on File and Storage Technologies, Monterey, CA, Jan. 28-30, 2002, pp. 1-14.
Kleindienst, Jan, et al., “Lessons Learned from Implementing the CORBA Persistent Object Service”, OOPLSLA '96, San Jose, CA, © 1996, pp. 150-167.
Vogels, Werner, “File System Usage in Windows NT 4.0”, SOSP-17, Kiawah Island, SC, Dec. 1999, pp. 93-109.
Cole, Andrew W., “Proposed Component Tools for Corpus Map Utility to Characterize Large File Systems”, Masters Thesis, Univ. of Pennsylvania, © 2002, pp. i-v and 1-32.

Affiliated with

Also associated with

Rating

Traversing data in a repeatable manner does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Traversing data in a repeatable manner, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Traversing data in a repeatable manner will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4176353