Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2007-01-09
2007-01-09
Mizrahi, Diane D. (Department: 2165)
Data processing: database and file management or data structures
Database design
Data structure types
Reexamination Certificate
active
10463327
ABSTRACT:
The disclosed teachings provide methods and systems for efficient evaluation of XPath queries. In particular, the disclosed evaluation methods require only polynomial time with respect to the total size of an input XPath query and an input XML document. Crucial for the new methods is the notion of “context-value tables”. This idea can be further refined for queries in Core XPath and XSLT Patterns so as to yield even a linear time evaluation method. Moreover, the disclosed methods can be used for improving existing methods and systems for processing XPath expressions so to guarantee polynomial worst-case complexity.
REFERENCES:
patent: 2003/0074352 (2003-04-01), Raboczi et al.
patent: 2004/0073541 (2004-04-01), Lindblad et al.
patent: 2004/0167864 (2004-08-01), Wang et al.
Georg Gottlob et al, “XPath processing in a nutshell”, 2003, ACM Press, NY, NY, vol. 32, Issue 1, pp. 12-19.
Georg Gottlob et al., “The complexity of XPath query evaluation”, 2003, ACM Press, NY, NY., pp. 179-190.
Gottlob Georg
Koch Christoph
Pichler Reinhard
LandOfFree
Efficient processing of XPath queries does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Efficient processing of XPath queries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient processing of XPath queries will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3745179