Comparing hierarchical data in external memory

DMCA

Comparing hierarchical data in external memory (1999)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Sudarshan S. Chawathe

Venue:	In 25th Very Large Data Base Conference (VLDB
Citations:	65 - 2 self

BibTeX

@INPROCEEDINGS{Chawathe99comparinghierarchical,
    author = {Sudarshan S. Chawathe},
    title = {Comparing hierarchical data in external memory},
    booktitle = {In 25th Very Large Data Base Conference (VLDB},
    year = {1999},
    pages = {90--101}
}

OpenURL

Abstract

We present an external-memory algorithm for computing a minimum-cost edit script between two rooted, ordered, labeled trees. The I/O, RAM, and CPU costs of our algorithm are, respectively, 4mn+7m+5n, 6S, andO(MN+(M+N)S1:5), whereMandNare the input tree sizes,Sis the block size,m=M=S, andn=N=S. This algorithm can make effective use of surplus RAM capacity to quadratically reduce I/O cost. We extend to trees the commonly used mapping from sequence comparison problems to shortest-path problems in edit graphs. 1

Keyphrases

hierarchical data external memory input tree size external-memory algorithm surplus ram capacity shortest-path problem effective use edit graph block size sequence comparison problem cpu cost minimum-cost edit script

DMCA