Techniques of rewriting descendant and wildcard XPath using...

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

C707S760000

Reexamination Certificate

active

07730080

ABSTRACT:
A method for processing queries is provided. A first representation of a query is generated, where the query includes a certain operator that is to be performed based on an XPath expression that is expandable into multiple location paths. The first representation of the query is rewritten into a second representation that corresponds to an equivalent query, where rewriting the first representation includes expanding the XPath expression into the plurality of location paths and, based on the certain operator, including a plurality of operators in the second representation, where the plurality of operators include: a first set of operators that is to be performed based on each of the plurality of location paths, and a second set of operators that is to be performed based on data returned from at least one operator included in the first set of operators. The query may thereafter be executed based on the second representation. The second representation may be further rewritten to third representation depending on the physical storage of XML.

REFERENCES:
patent: 5897632 (1999-04-01), Dar et al.
patent: 5950188 (1999-09-01), Wildermuth
patent: 6295541 (2001-09-01), Bodnar et al.
patent: 6421658 (2002-07-01), Carey et al.
patent: 6526403 (2003-02-01), Lin et al.
patent: 6615203 (2003-09-01), Lin et al.
patent: 6892210 (2005-05-01), Erickson et al.
patent: 7031956 (2006-04-01), Lee et al.
patent: 7120645 (2006-10-01), Manikutty et al.
patent: 7194462 (2007-03-01), Riccardi et al.
patent: 7266764 (2007-09-01), Flam
patent: 7315852 (2008-01-01), Balmin et al.
patent: 7386568 (2008-06-01), Warner et al.
patent: 2002/0073019 (2002-06-01), Deaton
patent: 2002/0116457 (2002-08-01), Eshleman et al.
patent: 2003/0097383 (2003-05-01), Smirnov et al.
patent: 2003/0115548 (2003-06-01), Melger
patent: 2003/0140308 (2003-07-01), Murthy et al.
patent: 2004/0064466 (2004-04-01), Manikutty et al.
patent: 2004/0148278 (2004-07-01), Milo et al.
patent: 2004/0220912 (2004-11-01), Manikutty et al.
patent: 2004/0267760 (2004-12-01), Brundage et al.
patent: 2005/0065949 (2005-03-01), Warner et al.
patent: 2005/0097084 (2005-05-01), Balmin et al.
patent: 2005/0120001 (2005-06-01), Yagoub et al.
patent: 2005/0228791 (2005-10-01), Thusoo et al.
patent: 2005/0289125 (2005-12-01), Liu et al.
patent: 2006/0031233 (2006-02-01), Liu et al.
patent: 2006/0074901 (2006-04-01), Pirahesh et al.
patent: 2006/0212491 (2006-09-01), Agrawal et al.
patent: 2006/0224564 (2006-10-01), Yu et al.
patent: 2006/0224627 (2006-10-01), Manikutty et al.
patent: 2006/0235840 (2006-10-01), Manikutty et al.
Muralidhar Krishnaprasad et al., Proceedings of the Thirtieth international conference on Very large data bases, 2004, vol. 30, pp. 1134-1145.
Microsoft Computer Dictionary, 2002, Microsoft Press, Fifth Edition, 3 pages.
W3C, “XML Path Language (XPath) 2.0”, W3C Candidate Recommendation Nov. 3, 2005, located at http://www.w3.org/TR/xpath20/, 128 pgs.

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

Techniques of rewriting descendant and wildcard XPath using... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Techniques of rewriting descendant and wildcard XPath using..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Techniques of rewriting descendant and wildcard XPath using... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4160730

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