Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2006-01-10
2006-01-10
Mizrahi, Diane (Department: 2165)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000
Reexamination Certificate
active
06985910
ABSTRACT:
A tilting tree, spinning cones process is employed to map n-dimensional array data originally in markup language, to an n-dimension table suitable for use by COBOL application programs. Mapping is performed without scanning the result array for an empty slot. This allows the result array slots to be pre-loaded with state data. During mapping, the hierarchical nature of the markup language n-dimensional data is represented in two-dimensions using an inverted tree structure having cones for each array level. The tree is tilted to bring a member of a given level into contact with one of the axes of the tree graph, followed by spinning appropriate cones to bring a certain member of that level into contact with the same axis. This results in the ability to use a one-dimensional mapping array. The dimension offset on the mapping axis can then be used as an index value into the mapped array output for storage or retrieval of element data.
REFERENCES:
patent: 5943674 (1999-08-01), Schofield
patent: 6209124 (2001-03-01), Vermeire et al.
patent: 6301579 (2001-10-01), Becker
patent: 6336214 (2002-01-01), Sundaresan
patent: 6502101 (2002-12-01), Verprauskus et al.
patent: 6795868 (2004-09-01), Dingman et al.
patent: 6820135 (2004-11-01), Dingman et al.
patent: 2002/0042849 (2002-04-01), Ho et al.
patent: 2002/0046294 (2002-04-01), Brodsky et al.
patent: 2002/0161907 (2002-10-01), Moon
patent: 2004/0268242 (2004-12-01), Layman et al.
patent: 2005/0055336 (2005-03-01), Hui et al.
patent: 1231547 (2002-08-01), None
patent: WO0165419 (2001-09-01), None
H.V. Jagadish et al., On effective multi-dimensional indexing for strings, (2000), ACM Press, NY, NY., pp. 403-414.
Robert Van Engelen, Code generation techniques for developing light-weight XML Web services for embedded devices, (2004), ACM Press, NY, NY, pp. 854-861.
Tak Wong et al, XML implementation of frame processor, (2001), ACM Press, NY, NY, pp. 164-172.
Albrecht Schmidt, et al., “Efficient Storage and Retrieval of XML Documents” WebDB (informal Proceedings) (2000).
Takeyuki Shimura, et al., “Storage and Retrieval of XML Documents Using Object-Relational Databases” DEXA (1999).
Sneed, H.M., “Wrapping legacy COBOL programs behind an XML-interface” IEEE, Oct. 2, 2001, pp. 189-197, p. 194, col. 2, line 20—p. 195, col. 1, line 13, figures 4-7.
Funderburk, J.E., et al, “XTABLES: bridging relational technology and XML” IBM Syst., J. (USA), IBM Systems Journal, 2002, IBM, USA, vol. 41, No. 4, 2002, pp. 616-641, p. 631, col. 1, line 5—pp. 633, col. 2, line 25.
Florescu, D., et al, “A Performance Evaluation of Alternative Mapping Schemes for Storing XML Data in a Relational Database” INRIA Rapport De Recherche No. 3680, May 1999, pp. 1-31, Le, France, Paragraph 3: “Storing XML Documents in Relational Databases”.
Shanmugasundaram, J., et al, “Relational databases for querying XML documents: limitaitns and opportunites” Proceedings of 25th International Conference on Very Large Databases, Edinburgh, UK, Sep. 7, 1999, pp. 302-314, Orlando, Florida.
Frantz Robert H.
Mims Jr. David A.
Mizrahi Diane
LandOfFree
Tilting tree spinning cones method and system for mapping... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Tilting tree spinning cones method and system for mapping..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tilting tree spinning cones method and system for mapping... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3570765