Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2007-12-25
2007-12-25
Alam, Hosain (Department: 2166)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C715S252000, C715S252000
Reexamination Certificate
active
10629744
ABSTRACT:
A method, a system and recording medium for maintaining the order of nodes in a hierarchical document. The method may select the maximum and the minimum number of children for each node, build an auxiliary ordered tree having at least as many leaves as atoms within the hierarchical document based upon the selected maximum and minimum number of children for each node, attach the atoms to the leaves of the auxiliary ordered tree, and label each of the nodes in the auxiliary ordered tree.
REFERENCES:
patent: 6247016 (2001-06-01), Rastogi et al.
patent: 6408300 (2002-06-01), Bergman et al.
patent: 6694323 (2004-02-01), Bumbulis
patent: 6804677 (2004-10-01), Shadmon et al.
patent: 6889226 (2005-05-01), O'Neil et al.
patent: 2002/0087571 (2002-07-01), Stapel et al.
patent: 2003/0172352 (2003-09-01), Kashima et al.
Wang et. al ,“ViST: A Dynamic Index Method for Querying XML Data by Tree Structure”, ACM SIGMOD, Jun. 2003 (12 pages).
Peter Gulutzan, Trudy Pelzer, “SQL Performance Tuning”, Addison Wesley Professional, Sep. 10, 2002 (3 pages).
Cohen, et al., “Labeling Dynamic XML Trees”, In Proc. ACM Symposium on Principles of Database Systems (PODS), Jun. 2002.
Abiteboul, et al., “Compact labeling schemes for ancestor queries”, In Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA), Jan. 2001.
Alstrup, et al., “Improved labeling scheme for ancestor queries”, In Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA), Jan. 2002.
Kaplan, et al., “A comparison of labeling schemes for ancestor queries”, In Proc. ACM-SIAM Symposium on Discrete Algorithms (SODA), Jan. 2002.
Santoro, et al., “Labeling and implicit routing in networks”, In Computer Journal, 1985.
Dietz, et al., “Two Algorithms for Maintaining Order in a List”, In Proc. 19th Annual ACM Symposium on Theory of Computing, pp. 365-372, Springer, 1987.
Dietz, “Maintaining Order in a Linked List”, In Proc. 14th Annual ACM Symposium on Theory of Computing, pp. 122-127, May 1982.
Willard, “Good Worst-case Algorithms for Inserting and Deleting Records in Dense Sequential Files”, In Proc. ACM International Conference on Management of Data (SIGMOD), pp. 251-260, 1986.
Li, et al., “Indexing and Querying XML Data for Regular Path Expressions”, In VLDB Journal, pp. 361-370, 2001.
Zhang, et al., “On Supporting Containment Queries in Relational Database Management Systems”, In Proc. ACM International Conference on Management of Data (SIGMOD), 2001.
Bruno, et al., “Holistic Twig Joins: Optimal XML Pattern Matching”, In Proc. ACM International Conference on Management of Data (SIGMOD), pp. 310-321 2002.
Grust, “Accelerating XPath Location Steps”, In Proc. ACM International Conference on Management of Data (SIGMOD), pp. 109-120, 2002.
Bayer, et al., “Organization and Maintenance of Large Ordered Indices”, Mathematical and Information Sciences Report No. 20, Mathematical and Information Sciences Laboratory, Boeing Scientific Research Laboratories, pp. 107-141, Jul. 1970.
Bordawekar Rajesh
Chen Yi
Mihaila George A.
Padmanabhan Sriram
Abzug, Esq. Jesse L.
Alam Hosain
International Business Machines - Corporation
Lin Shew-Fen
McGinn IP Law Group PLLC
LandOfFree
Method, system and recording medium for maintaining the... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method, system and recording medium for maintaining the..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method, system and recording medium for maintaining the... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3856091