S. Chawathe, "Comparing hierarchical data in external memory" Proceedings of the Twenty-fifth International Conference on Very Large Data Bases (1999), Edinburgh, Scotland, p. 90-101.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....XML version management tools. IBM has developed a tool called treedi# [29] which compares two XML files and points out the di#erences between the two files. A similar tool has been developed by Dommit [15] We think that it would not be di#cult to implement such a tool in Generic Haskell. Chawathe [5] has developed algorithms for comparing hierarchally structured data (such as XML documents) It is easy to implement the minimum cost edit distance algorithm given by Chawathe as a generic program, by printing values to the format expected by the algorithm, and parsing, to a value of the original ....

S. Chawathe. Comparing hierarchical data in external memory. In The Twenty-fifth International Conference on Very Large Data Bases, pages 90--101, 1999.

....application and vice versa. After the file has been edited (e.g. upon file closing) it is re converted into the intermediate XML document and compared to the downloaded version in order to identify the changes. This is done by the client side FCDP which computes the minimum cost edit script [3, 5] that is transmitted to the FCDP server immediately (when in connected or weakly connected mode) or else upon reconnection. Note that re conversion and change detection can also be a user directed event. On the server, FCDP applies the edit script to the XML version of the original document ....

....tool has the original name of XyDiff and now has the name verbose diff (vdiff) accounting for documents differing levels of structural verbosity and content. XyDiff expanded on the capabilities of Sun s [21] IBM s [9] tools by incorporating the ability to capture move and update semantics. Like [3, 4], XyDiff is one of the few XML tools to utilize the move semantic for diff scripts. This takes advantage of the hierarchical nature of XML and allows movements of entire sub tree to new locations with a single entry in a diff script. The original XyDiff algorithm [14] utilizes external ....

[Article contains additional citation context not shown here]

S. Chawathe, "Comparing hierarchical data in external memory," presented at Twentyfifth International Conference on Very Large Data Bases, Philadelphia, PA, 1999.

....XML version management tools. IBM has developed a tool called treedi# [24] which compares two XML files and points out the di#erences between the two files. A similar tool has been developed by Dommit [13] We think that it would not be di#cult to implement such a tool in Generic Haskell. Chawathe [6] has developed algorithms for comparing hierarchally structured data (such as XML documents) It is easy to implement the minimum cost edit distance algorithm given by Chawathe as a generic program, by printing values to the format expected by the algorithm, and parsing, to a value of the original ....

S. Chawathe. Comparing hierarchical data in external memory. In The Twenty-fifth International Conference on Very Large Data Bases, pages 90--101, 1999.

....Active XML GL Rule We use edit scripts for representing the di erence among di erent states of the same document, which can be arbitrarily produced by an editing session or by integrating the document editor with electronic mail. Detecting changes on a document is a general problem, considered in [14, 12, 11]. We assume that the problem can be solved by executing an XML di algorithm, which produces an optional (i.e. unde ned on certain nodes) one to one identity relationship between nodes of the old and new version of the document, so that any two related nodes must be considered as two versions of ....

S. Chawathe. Comparing Hierarchical Data in External Memory. In Proc. of 25th VLDB, pages 90-101, Edinburgh, Scotland, UK, September 1999.

....and inserts links between the contents and the body. The type of the result is the full HTML type. Total: 224 lines) Html2Latex takes an HTML file (of type HTML) and converts it into LaTeX (a value of type String) 264 lines) Diff implements the tree diff algorithm described by Chawathe [Cha99] It takes a pair of XML files of type Xml, which is the type of all XML documents, and returns a tree with annotations indicating whether each subtree has been retained, inserted, deleted, or changed between the two inputs. 300 lines) The first two applications are written as straightforward ....

Sudarshan S. Chawathe. Comparing hierarchical data in external memory. In Proceedings of the Twentyfifth International Conference on Very Large Data Bases, pages 90--101, Edinburgh, Scotland, U.K., September 1999.

....document, adds a table of contents at the front, and inserts links between the contents and the body. The type of the result is the full HTML type. Html2Latex takes an HTML file (of type HTML) and converts it into LaTeX (a value of type String) Diff implements Chawathe s tree diff algorithm [8]. It takes a pair of XML files of type Xml, which is the type of all XML documents, and returns a tree with annotations indicating whether each subtree has been retained, inserted, deleted, or changed between the two inputs. The first two applications are written as straightforward traversals of ....

S. S. Chawathe. Comparing hierarchical data in external memory. In Proceedings of the Twenty-fifth International Conference on Very Large Data Bases, pages 90--101, Edinburgh, Scotland, U.K., Sept. 1999.

....the front, and inserts links between the contents and the body. The result has type the full HTML type. Total: 224 lines) Html2Latex takes an HTML file (of type HTML) and converts it into LaTeX format (of type String) 264 lines) Diff implements the tree diff algorithm proposed by Chawathe [3]. It takes a pair of XML files of generic Xml type and returns a tree with annotations indicating whether each subtree has been retained, inserted, deleted, or changed between the two inputs. 300 lines) The first two applications are written in the way that traverses the input tree by several ....

S. S. Chawathe. Comparing hierarchical data in external memory. In Proceedings of the Twenty-fifth International Conference on Very Large Data Bases, pages 90--101, Edinburgh, Scotland, U.K., Sept. 1999.

No context found.

S. Chawathe, "Comparing hierarchical data in external memory" Proceedings of the Twenty-fifth International Conference on Very Large Data Bases (1999), Edinburgh, Scotland, p. 90-101.

No context found.

S. Chawathe, "Comparing hierarchical data in external memory" Proceedings of the Twenty-fifth International Conference on Very Large Data Bases (1999), Edinburgh, Scotland, p. 90-101.

No context found.

S. Chawathe. Comparing hierarchical data in external memory. In Twenty-fifth International Conference on Very Large Data Bases, pages 90--101, 1999.

No context found.

Chawathe, S. S. 1999. Comparing hierarchical data in external memory. In Proceedings of the Twenty- fth International Conference on Very Large Data Bases. Edinburgh, Scotland, U.K., 90-101.

No context found.

S. S. Chawathe. Comparing hierarchical data in external memory. In Proceedings of the 25th International Conference on Very Large Data Bases, pages 90--101, Edinburgh, Scotland, U.K., 1999.

No context found.

S. Chawathe. "Comparing hierarchical data in external memory", Proceeding of the 25 International Conference on VLDB, Philadelphia, 1999.

No context found.

CHAWATHE S., "Comparing Hierarchical Data in External Memory", VLDB, 1999.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC