Pre-Grant Publication Number: 20080091649
Please help the USPTO examine the application by evaluating the relevance of the publicly submitted prior art to the patent application.
Peer-to-Patent forwards the Top 10 most relevant prior art submissions and their annotations to the United States Patent and Trademark Office.
Review this prior art and click on the thumbs up (or down) to indicate whether this submission should be forwarded to the USPTO.
If you login then you can add an annotation by typing in the box at the bottom of the screen to comment on the relevance of the prior art to the claims of the patent application.
Review this prior art and click on the thumbs up (or down) to indicate whether this submission should be forwarded to the USPTO.
If you login then you can add an annotation by typing in the box at the bottom of the screen to comment on the relevance of the prior art to the claims of the patent application.
Prior Art Detail
Summary / Description
| Summary / Description | Change detection in XML documents is an important task in the context of query systems. In this paper, we present CustX- Diff, a customizable change detection approach for XML documents based on X-Diff [6]. CustX-Diff performs the change detection operation simultaneosly with the XPath based filtering of XML document parts. The class of XPath expressions used is the tree patterns subset of XPath. For the embedding of simple paths into XPath expressions during the difference operation, a dynamic programming approach is proposed. Comparative performance results with respect to the original X-Diff [6] approach demonstrate the efficiency of the proposed method. |
Basic Information
| Type of Prior Art | Print Publication |
| Publication Title * | Customizable detection of changes for XML documents using XPath expressions |
| Author | Ermir Qeli |
| ISBN | |
| Page Range | |
| Medium | Journal article |
| Publication Date * | January 1, 2006 |
| URL | http://portal.acm.org/citation.... |
Notes / To Do
| Notes | |
Excerpt
Excerpt Detecting and representing changes to data is important for active databases, data warehousing, view maintenance, and version and configuration management. Most previous work in change management has dealt with flat-file and relational data; we focus on hierarchically structured data. Since in many cases changes must be computed from old and new versions of the data, we define the hierarchical change detection problem as the problem of finding a "minimum-cost edit script" that transforms one data tree to another, and we present efficient algorithms for computing such an edit script. Our algorithms make use of some key domain characteristics to achieve substantially better performance than previous, general-purpose algorithms. We study the performance of our algorithms both analytically and empirically, and we describe the application of our techniques to hierarchically structured documents. |
Relevance
Claims
1
A method for processing queries, the method on information processing system comprising:
receiving a data query for a set of hierarchical markup documents;
extracting at least one query path expression from the data query;
processing the query path against at least one shared hierarchical markup document in a plurality of shared hierarchical markup documents, wherein the plurality of shared hierarchical documents is associated with the set of hierarchical markup documents;
generating, in response to the shared hierarchical markup document completely matching the query path expression, a query result for the data query based on the processing of the query path expression against at least one of the shared hierarchical markup document and the difference hierarchical markup document.
Relevance
The context is the same. Looking for difference in documents.
The context is the same. Looking for difference in documents.
Claim Chart
All
0 days left
