The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Change detection in hierarchically structured information
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, generalpurpose algorithms. We study the performance of our algorithms both analytically and empirically, and we describe the application of our techniques to hierarchically structured documents. 1 Introduction We study the problem of detecting and representing changes to hierarchically stru...
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
Zhang, K., & Shasha, D. (1989) · SIAM Journal on Computing · doi:10.1137/0218082 · Cited by 1,310
AnO(ND) difference algorithm and its variations
Myers, E. W. (1986) · Algorithmica · doi:10.1007/bf01840446 · Cited by 893
Object exchange across heterogeneous information sources
Papakonstantinou, Y., Garcia-Molina, H., & Widom, J. (2002) · Proceedings of the Eleventh International Conference on Data Engineering · doi:10.1109/icde.1995.380386 · Cited by 751
Self-citationActive Database Systems: Triggers and Rules for Advanced Database Processing
Dayal, U., Widom, J., & Ceri, S. (1994) · Morgan Kaufmann Publishers Inc. eBooks · Cited by 644
Self-citationView maintenance in a warehousing environment
Zhuge, Y., García-Molina, H., Hammer, J., & Widom, J. (1995) · Proceedings of the 1995 ACM SIGMOD international conference on Management of data - SIGMOD '95 · doi:10.1145/223784.223848 · Cited by 430
Self-citationThe Stanford Data Warehousing Project
Hammer, J., García-Molina, H., Widom, J., Labio, W. J., & Zhuge, Y. (1995) · IEEE Data(base) Engineering Bulletin · Cited by 201
Self-citationFast algorithms for the unit cost editing distance between trees
Shasha, D. E., & Zhang, K. (1990) · Journal of Algorithms · doi:10.1016/0196-6774(90)90011-3 · Cited by 135
Cited by
A survey on tree edit distance and related problems
Bille, P. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2004.12.030 · Cited by 751
“Some extensions of the tree edit distance problem have been considered [6,5,24].”
BackgroundChange Distilling:Tree Differencing for Fine-Grained Source Code Change Extraction
Fluri, B., Wursch, M., PInzger, M., & Gall, H. (2007) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2007.70731 · Cited by 607
Fine-grained and accurate source code differencing
Falleri, J.-R., Morandat, F., Blanc, X., Martinez, M., & Monperrus, M. (2014) · Proceedings of the 29th ACM/IEEE International Conference on Automated Software Engineering · doi:10.1145/2642937.2642982 · Cited by 549
Detecting changes in XML documents
Cobena, G., Abiteboul, S., & Marian, A. (2003) · Proceedings 18th International Conference on Data Engineering · doi:10.1109/icde.2002.994696 · Cited by 422
Algorithmics and applications of tree and graph searching
Shasha, D., Wang, J. T. L., & Giugno, R. (2002) · Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems · doi:10.1145/543613.543620 · Cited by 387
X-Diff: an effective change detection algorithm for XML documents
Wang, Y., DeWitt, D. J., & Cai, J.-Y. (2004) · Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405) · doi:10.1109/icde.2003.1260818 · Cited by 348
Continual queries for Internet scale event-driven information delivery
Liu, L., Pu, C., & Tang, W. (1999) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.790816 · Cited by 332
Crawling Ajax-Based Web Applications through Dynamic Analysis of User Interface State Changes
Mesbah, A., van Deursen, A., & Lenselink, S. (2012) · ACM Transactions on the Web · doi:10.1145/2109205.2109208 · Cited by 296
ShowMeHow: translating user interface instructions between applications
Ramesh, V., Hsu, C., Agrawala, M., & Hartmann, B. (2011) · Proceedings of the 24th annual ACM symposium on User interface software and technology · doi:10.1145/2047196.2047212 · Cited by 27
Metadata
- Authors
- Chawathe, S. S., Rajaraman, A., Garcia-Molina, H., & Widom, J.
- Venue
- Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96
- Publisher
- ACM Press
- Published
- 1996
- Pages
- 493-504
- ISSN
- 0730-8078 (ISSN-L)
- OpenAlex
- W2024797550
- Cited by
- 484
- References
- 7
- FWCI
- 7.25
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.