Meaningful Change Detection in Structured Data

SIGMOD Record (ACM Special Interest Group on Management of Data)

Volumn 26, Issue 2, 1997, Pages 26-37

  Chawathe, Sudarshan S ^a   Garcia Molina, Hector ^a  

^a Stanford University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; DATA PROCESSING; DATABASE SYSTEMS; HEURISTIC METHODS; NONLINEAR PROGRAMMING; TREES (MATHEMATICS);

NESTED OBJECT DATA;

DATA STRUCTURES;

EID: 0031167952     PISSN: 01635808     EISSN: None     Source Type: Journal    
DOI: 10.1145/253262.253266     Document Type: Article

References (17)

1. S. Chawathe and H. Garcia-Molina. Meaningful change detection in structured data. Available at URL http://www-db.stanford.edu, 1997. Extended version.
2. S. Chawathe, H. Garcia-Molina, J. Hammer, K. Ireland, Y. Papakonstantinou, J. Ullman, and J. Widom. The Tsimmis project: Integration of heterogeneous information sources. In Proceedings of 100th Anniversary Meeting of the Information Processing Society of Japan, pages 7-18, Tokyo, Japan, October 1994.
3. S. Chawathe, A. Rajaraman, H. Garcia-Molina, and J. Widom. Change detection in hierarchically structured information. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pages 493-504, Montréal, Québec, June 1996.
4. M. Haertel, D. Hayes, R. Stallman, L. Tower, P. Eggert., and W. Davison. The GNU diff program. Texinfo system documentation. Available by anonymous FTP from prep.ai.mit.edu.
5. E. Lawler. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, 1976.
6. W. Labio and H. Garcia-Molina. Efficient snapshot differential algorithms for data warehousing. In Proceedings of the International Conference on Very Large Data Bases, Bombay, India, September 1996.
7. E. Myers. An O(ND) difference algorithm and its variations. Algorithmica, 1(2):251-266, 1986.
8. C. Papadimitriou and K. Steiglitz. Combinatorial Optimization. Prentice-Hall, 1982.
9. E. Rothberg. The wmatch program for finding a maximum-weight matching for undirected graphs. Live OR collection. Available at URL http://www.orsoc.org.uk.
10. D. Shasha, J. Wang, K. Zhang, and F. Shih. Exact and approximate algorithms for unordered tree matching. IEEE Transactions on Systems, Man, and Cybernetics, 24(4):668-678, April 1994.
11. D. Shasha and K. Zhang. Fast algorithms for the unit cost editing distance between trees. Journal of Algorithms, 11:581-621, 1990.
12. R. Wagner. On the complexity of the extended string-to-string correction problem. In Seventh ACM Symposium on the Theory of Computation, 1975.
13. R. Wagner and M. Fischer. The string-to-string correction problem. Journal of the Association of Computing Machinery, 21(1):168-173, January 1974.
14. S. Wu, U. Manber, and G. Myers. An O(NP) sequence comparison algorithm. Information Processing Letters, 35:317-323, September 1990.
15. 3 project: Changes, consistency, and configurations in heterogeneous distributed information systems. Unpublished manuscript; available at URL http://www-db.stanford.edu, 1995.
16. K. Zhang and D. Shasha. Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal of Computing, 18(6):1245-1262, 1989.
17. K. Zhang, J. Wang, and D. Shasha. On the editing distance between undirected acyclic graphs. International Journal of Foundations of Computer Science, 1995.