Method and mechanism for handling arbitrarily-sized XML in...

Data processing: database and file management or data structures – Database and file access – Record – file – and data search and comparisons

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C707S769000, C707S775000, C707S778000

Reexamination Certificate

active

07873645

ABSTRACT:
Disclosed is a method and mechanism for processing expressions and operator trees. An approach is particularly useful to optimize processing of XML statements with respect to SQL operators. A top-down processing approach can be taken to directly output data from operators to a data stream. In addition, multiple processing approaches can be taken within a single expression tree, with some operators processed using the top-down approach and other operators processed with the bottom-up approach. Even data that can not be streamed is copied fewer times using this approach, intermediate values from bottom-up processing may still be streamed if it is used by an operator that is eligible for top-down processing.

REFERENCES:
patent: 5455945 (1995-10-01), VanderDrift
patent: 6470344 (2002-10-01), Kothuri et al.
patent: 6662342 (2003-12-01), Marcy
patent: 6665663 (2003-12-01), Lindsay et al.
patent: 6671853 (2003-12-01), Burkett et al.
patent: 6678672 (2004-01-01), Ramasamy et al.
patent: 6678686 (2004-01-01), Patel et al.
patent: 6708164 (2004-03-01), Cseri et al.
patent: 6742054 (2004-05-01), Upton
patent: 6799184 (2004-09-01), Bhatt et al.
patent: 6832219 (2004-12-01), Lal et al.
patent: 7213017 (2007-05-01), Rys et al.
patent: 2001/0029604 (2001-10-01), Dreyband et al.
patent: 2002/0073399 (2002-06-01), Golden
patent: 2002/0143521 (2002-10-01), Call
patent: 2002/0156811 (2002-10-01), Krupa
patent: 2002/0188613 (2002-12-01), Chakraborty et al.
patent: 2003/0014393 (2003-01-01), Kabra et al.
patent: 2003/0037048 (2003-02-01), Kabra et al.
patent: 2003/0074419 (2003-04-01), VanderDrift
patent: 2003/0101169 (2003-05-01), Bhatt et al.
patent: 2003/0233618 (2003-12-01), Wan
patent: 2004/0060007 (2004-03-01), Gottlob et al.
patent: 2004/0068487 (2004-04-01), Barton et al.
patent: 2004/0103105 (2004-05-01), Lindblad et al.
patent: 2005/0273703 (2005-12-01), Doughan
patent: 2005/0278358 (2005-12-01), Doughan
patent: 01/42881 (2001-06-01), None
“XQuery from the Experts: A Guide to the W3C XML Query Language”, by Howard Katz et al., Aug. 2003, ISBN: 0-321-18060-7, chapters 6 & 7.
“XQuery from the Experts: A Guide to the W3C XML Query Language”, by Howard Katz et al., Aug. 2003, ISBN: 0-321-18060-7, publication information pages, copyright information pages.
McHugh et al., “Query Optimization for XML”, Proceedings of the 25th VLDB Conference, Edinburgh Scotland, 1999.
“Burg—Fast Optimal Instruction Selection and Tree Parsing”, by Fraser et al., ACM SIGPLAN Notices, vol. 27, No. 4, Apr. 1992.
“Better XML Parser through Functional Programming”, by Kiselyov, Lecture Notes in Computer Science, vol. 2257 archive, Proceedings of the 4th International Symposium on Practical Aspects of Declarative Languages, pp. 209-224, Year of Publication: 2002, ISBN:3-540-43092-X.
Bruno, N. et al., “Holistic Twig Joins: Optimal XML Pattern Matching”, Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data SIGMOD '02, Jun. 2002, pp. 310-321, ACM Press, USA.
Chaudhuri, S. et al., “On Relational Support for XML Publishing: Beyond Sorting and Tagging”, Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, Jun. 2003, ACM Press, USA.
Damiani, E. et al., “A Fine-Grained Access Control System for XML Documents”, ACM Transactions on Information and System Security (TISSEC), May 2002, pp. 169-202, vol. 5, Issue 2, ACM Press.
DeHaan, D. et al., “A Comprehensive XQuery to SQL Translation Using Dynamic Interval Encoding”, Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, Jun. 2003, pp. 623-634, ACM Press, USA.
Fiebig, T. et al., “Algebraic XML Construction and its Optimization in Natix”, World Wide Web, Jan. 2002, pp. 167-187, vol. 3, Issue 4, Kluwer Academic Publishers, The Netherlands.
Flesca, S. et al., “A Query Language for XML Based on Graph Grammars”, World Wide Web, Aug. 2002, pp. 125-157, vol. 5, Issue 2, Kluwer Academic Publishers, The Netherlands.
Funderburk, J. et al., “XML Programming with SQL/XML and XQuery”, IBM Systems Journal, Oct. 2002, pp. 642-665, vol. 41, No. 4, IBM Corporation, USA.
Ives, Z. et al., “An XML Query Engine for Network-Bound Data”, The VLDB Journal—The International Journal on Very Large Data Bases, Dec. 2002, pp. 380-402, vol. 11, Issue 4, Springer-Verlag New York, Inc., USA.
Jiang, H. et al., “Path Materialization Revisited: An Efficient Storage Model for XML Data”, Australian Computer Science Communications, Proceedings of the 13thAustralasian Database Conference, Jan. 2002, pp. 85-94, vol. 24, Issue 2, Australian Computer Society, Inc., and the IEEE Computer Society Press, Australia.
Lee, D. et al., “NeT&CoT: Translating Relational Schemas to XML Schemas Using Semantic Constraints”, Proceedings of the 11thInternational Conference on Information and Knowledge Management, Nov. 2002, pp. 282-291, ACM Press, USA.
Li, C. et al., “Composing XSL Transformations with XML Publishing Views”, Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, Jun. 2003, pp. 515-526, ACM Press, USA.
Li, X. et al., “Compiler Support for Efficient Processing of XML Datasets”, Proceedings of the 17thAnnual International Conference on Supercomputing, Jun. 2003, pp. 42-52, ACM Press, USA.
Papakonstantinou, Y. et al., “QURSED: Querying and Reporting Semistructured Data”, Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data SIGMOD '02, Jun. 2002, ACM Press, USA.
Shanmugasundaram, J. et al., “Efficiently Publishing Relational Data as XML Documents”, The International Journal on Very Large Data Bases, Sep. 2001, pp. 133-154, vol. 10, Issue 2-3, Springer-Verlag New York, Inc., USA.
Tatarinov, I. et al., “Storing and Querying Ordered XML Using a Relational Database System”, Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data SIGMOD '02, Jun. 2002, ACM Press, USA.
Wong, R., “The Extended XQL for Querying and Updating Large XML Database”, Proceedings of the 2001 ACM Symposium on Document Engineering, Nov. 2001, pp. 95-104, ACM Press, USA.
Yoshikawa, M. et al., “XREL: A Path-Based Approach to Storage and Retrieval of XML Documents Using Relational Databases”, ACM Transactions on Internet Technology (TOIT), Aug. 2001, pp. 110-141, vol. 1, Issue 1, ACM Press, USA.
Zhang, X. et al., “Honey, I Shrunk the XQuery!—An XML Algebra Optimization Approach”, Proceedings of the 4thInternational Workshop on Web Information and Data Management, Nov. 2002, pp. 15-22, ACM Press, USA.
Fialli et al. “Java Architecture for XML Binding JAXB)” Jan. 8, 2003, Sun Microsystems, pp. 58 and 74.
Kudrass, T. “Management of XML documents without schema in relational database systems” Information and Software Techology (Mar. 31, 202) 44(4):269-275.
Noga et al. “Lazy XML Processing” Nov. 2002, ACM, pp. 88-94.
Tian et al. “The Design and Performance Evaluation of Alternative XML Storage Strategies” Mar. 2002, pp. 5-10.
Borstein, N.; “Pull Parsing in C# and Java”; May 22, 2002; pp. 1-9; XLM.Com.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method and mechanism for handling arbitrarily-sized XML in... 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 and mechanism for handling arbitrarily-sized XML in..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and mechanism for handling arbitrarily-sized XML in... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2742896

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.