Affiliation:
1. Department of Computer Science, Stanford University, Stanford, California
Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Information Systems,Software
Cited by
128 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. EsArCost: Estimating repair costs of software architecture erosion using slice technology;Journal of Systems and Software;2024-02
2. On the methodology of three-way structured merge in version control systems: Top-down, bottom-up, or both;Journal of Systems Architecture;2023-12
3. HyperDiff: Computing Source Code Diffs at Scale;Proceedings of the 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering;2023-11-30
4. Diagnosing Compiler Performance by Comparing Optimization Decisions;Proceedings of the 20th ACM SIGPLAN International Conference on Managed Programming Languages and Runtimes;2023-10-19
5. Aardvark: Comparative Visualization of Data Analysis Scripts;2023 IEEE Visualization in Data Science (VDS);2023-10-15