A System for Approximate Tree Matching.

@article{DBLP:journals/tkde/WangZJS94,
  author    = {Jason Tsong-Li Wang and
               Kaizhong Zhang and
               Karpjoo Jeong and
               Dennis Shasha},
  title     = {A System for Approximate Tree Matching},
  journal   = {IEEE Trans. Knowl. Data Eng.},
  volume    = {6},
  number    = {4},
  year      = {1994},
  pages     = {559-571},
  ee        = {db/journals/tkde/WangZJS94.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1994 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

Joint ACM SIGMOD / IEEE Computer Society Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An3-3 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD2 or /dvd

References

[1]

Alfred V. Aho, Mahadevan Ganapathi, Steven W. K. Tjiang: Code Generation Using Tree Matching and Dynamic Programming. ACM Trans. Program. Lang. Syst. 11(4): 491-516(1989)

[2]

A. M. Alashqur, Stanley Y. W. Su, Herman Lam: OQL: A Query Language for Manipulating Object-oriented Databases. VLDB 1989: 433-442

[3]

Morton M. Astrahan, Mike W. Blasgen, Donald D. Chamberlin, Kapali P. Eswaran, Jim Gray, Patricia P. Griffiths, W. Frank King III, Raymond A. Lorie, Paul R. McJones, James W. Mehl, Gianfranco R. Putzolu, Irving L. Traiger, Bradford W. Wade, Vera Watson: System R: Relational Approach to Database Management. ACM Trans. Database Syst. 1(2): 97-137(1976)

[4]

Robert S. Boyer, J. Strother Moore: A Fast String Searching Algorithm. Commun. ACM 20(10): 762-772(1977)

[5]

...

[6]

Shi-Kuo Chang, Tosiyasu L. Kunii: Pictorial Data-Base Systems. IEEE Computer 14(11): 13-21(1981)

[7]

...

[8]

...

[9]

...

[10]

...

[11]

Larry S. Davis, Nick Roussopoulos: Approximate pattern matching in a pattern database system. Inf. Syst. 5(2): 107-119(1980)

[12]

...

[13]

Roger W. Ehrich, Jörgen P. Foith: Representation of Random Waveforms by Relational Trees. IEEE Trans. Computers 25(7): 725-736(1976)

[14]

Christoph M. Hoffmann, Michael J. O'Donnell: Pattern Matching in Trees. J. ACM 29(1): 68-95(1982)

[15]

Barry E. Jacobs, Cynthia A. Walczak: A Generalized Query-by-Example Data Manipulation Language Based on Database Logic. IEEE Trans. Software Eng. 9(1): 40-57(1983)

[16]

Rangasami L. Kashyap, B. John Oommen: The Noisy Substring Matching Problem. IEEE Trans. Software Eng. 9(3): 365-370(1983)

[17]

S. Rao Kosaraju: Efficient Tree Pattern Matching (Preliminary Version). FOCS 1989: 178-183

[18]

Gad M. Landau, Uzi Vishkin: Introducing Efficient Parallelism into Approximate String Matching and a New Serial Algorithm. STOC 1986: 220-230

[19]

...

[20]

...

[21]

...

[22]

...

[23]

...

[24]

Jack A. Orenstein, Frank Manola: PROBE Spatial Data Modeling and Query Processing in an Image Database Application. IEEE Trans. Software Eng. 14(5): 611-629(1988)

[25]

Gultekin Özsoyoglu, Victor Matos, Z. Meral Özsoyoglu: Query Processing Techniques in the Summary-Table-by-Example Database Query Language. ACM Trans. Database Syst. 14(4): 526-573(1989)

[26]

...

[27]

Edward M. Reingold, John S. Tilford: Tidier Drawings of Trees. IEEE Trans. Software Eng. 7(2): 223-228(1981)

[28]

Nick Roussopoulos, Christos Faloutsos, Timos K. Sellis: An Efficient Pictorial Database System for PSQL. IEEE Trans. Software Eng. 14(5): 639-650(1988)

[29]

...

[30]

...

[31]

...

[32]

Dennis Shasha, Jason Tsong-Li Wang: New Techniques for Best-Match Retrieval. ACM Trans. Inf. Syst. 8(2): 140-158(1990)

[33]

Michael Stonebraker, Eugene Wong, Peter Kreps, Gerald Held: The Design and Implementation of INGRES. ACM Trans. Database Syst. 1(3): 189-222(1976)

[34]

...

[35]

Kuo-Chung Tai: The Tree-to-Tree Correction Problem. J. ACM 26(3): 422-433(1979)

[36]

Abdullah Uz Tansel, M. Erol Arkun, Gultekin Özsoyoglu: Time-by-Example Query Language for Historical Databases. IEEE Trans. Software Eng. 15(4): 464-478(1989)

[37]

Esko Ukkonen: Finding Approximate Patterns in Strings. J. Algorithms 6(1): 132-137(1985)

[38]

Prashant D. Vaidya, Linda G. Shapiro, Robert M. Haralick, Gary J. Minden: Design and Architectural Implications of a Spatial Information System. IEEE Trans. Computers 31(10): 1025-1031(1982)

[39]

Jason Tsong-Li Wang, Dennis Shasha: Query Processing for Distance Metrics. VLDB 1990: 602-613

[40]

...

[41]

...

[42]

...

[43]

Charles Wetherell, Alfred Shannon: Tidy Drawings of Trees. IEEE Trans. Software Eng. 5(5): 514-520(1979)

[44]

...

[45]

...

[46]

Kaizhong Zhang, Dennis Shasha: Simple Fast Algorithms for the Editing Distance Between Trees and Related Problems. SIAM J. Comput. 18(6): 1245-1262(1989)

[47]

Kaizhong Zhang, Dennis Shasha, Jason Tsong-Li Wang: Fast Serial and Parallel Algorithms for Approximate Tree Matching with VLDC's. CPM 1992: 151-161

[48]

Kaizhong Zhang, Richard Statman, Dennis Shasha: On the Editing Distance Between Unordered Labeled Trees. Inf. Process. Lett. 42(3): 133-139(1992)

[49]

Moshé M. Zloof: Query by Example. AFIPS National Computer Conference 1975: 431-438

[50]

Moshé M. Zloof: Office-by-Example: A Business Language that Unifies Data and Word Processing and Electronic Mail. IBM Systems Journal 21(3): 272-304(1982)