%\bibliographystyle{plain} 

\bibliographystyle{abbrv} 

\begin{thebibliography}{99} 

\bibitem{abiteboul97} 
S.~Abiteboul. 
\newblock Querying semi-structured data. 
\newblock In {\em ICDT}, pages 1--18, 1997. 



\bibitem{ABS-1999} 
S. Abiteboul, P. Buneman, and D. Suciu. 
{\em Data on the Web: From Relations to 
Semistructured Data and XML}. Morgan Kaufmann, 1999. 

\bibitem{AQM-1997} 
S. Abiteboul, D. Quass, J. McHugh, J. Widom, and J. L. Wiener. 
The Lorel query language for semistructured data. 
{\em International Journal on Digital Libraries}, 
1(1):68--88, 1997. 

\bibitem{AV-99} 
S. Abiteboul and V. Vianu. 
Regular path queries with constraints. 
{\em Journal of Computer and System Sciences}, 
58(3):428--452, 1999. 

\bibitem{AJK-2002} 
S. Al-Khalifa, H. V. Jagadish, N. Koudas, J. M. Patel, D. Srivastava, 
and Y. Wu. 
Structural joins: A primitive for efficient XML query pattern matching. 
In {\em Proceedings of the IEEE International Conference 
on Data Engineering}, 2002. 


\bibitem{almohamad93} 
H.~Almohamad and S.O.Duffuaa. 
\newblock A linear programming approach for the weighted graph matching 
  problem. 
\newblock {\em IEEE Transactions on pattern analysis and machine intelligence}, 
  15(5), 1993. 

\bibitem{AF-2000} 
M. Altinel and M. J. Franklin. 
Efficient filtering of XML documents for 
selective dissemination of information. 
In {\em Proceedings of the International 
Conference on Very Large Data Bases}, pages 53--64, 2000.               



\bibitem{ACL-2001} 
S. Amer-Yahia, S. Cho, L. V. S. Lakshmanan, and D. Srivastava. 
Minimization of tree pattern queries. 
In {\em Proceedings of the ACM SIGMOD International Conference 
on Management of Data}, pages 497--508, 2001. 


\bibitem{ACS-2002} 
S. Amer-Yahia, S. Cho, and D. Srivastava. 
Tree pattern relaxation. 
In {\em Proceedings of the International Conference on 
Extending Database Technology}, 2002. 

\bibitem{AJL-2000} 
S. Amer-Yahia, H. V. Jagadish, L. V. S. Lakshmanan, and D. Srivastava. 
On bounding-schemas for LDAP directories. 
In {\em Proceedings of the 
International Conference on Extending Database Technology}, 
pages 287--301, 2000. 

\bibitem{BA83}, 
 H. Bunke and G. Allermann. 
\newblock Inexact Graph Matching for Structural Pattern Recognition. 
\newblock {\em Pattern Recognition Letters}, pages 245--253, 1983. 


\bibitem{BY-89} 
R. Baeza-Yates. 
Algorithms for string searching: A survey. 
{\em SIGIR Forum}, 23(3-4):34--58, 1989. 

\bibitem{BG-96} 
R. Baeza-Yates and G. H. Gonnet. 
Fast text searching for regular expressions or 
automaton searching on tries. 
{\em Journal of the ACM}, 43(6):915--936, 1996. 

\bibitem{BR-99} 
R. Baeza-Yates and B. Ribeiro-Neto. 
{\em Modern Information Retrieval}. 
ACM Press/Addison-Wesley, 1999. 

\bibitem{BBM-2001} 
D. Barbosa, A. Barta, A. O. Mendelzon, G. A. Mihaila, 
F. Rizzolo, P. Rodriguez-Guianolli. 
ToX - The Toronto XML engine. 
In {\em Proceedings of the Workshop 
on Information Integration on the Web}, 
pages 66--73, 2001.       

\bibitem{barrow76} 
H.~Barrow and R. M. Burstall. 
\newblock Subgraph isomorphism, matching relational structures and maximal 
  cliques. 
\newblock {\em Information Processing Letters}, 4:83--84, 1976. 

\bibitem{BCF-2001} 
S. Boag, D. Chamberlin, M. F. Fernandez, 
D. Florescu, J. Robie, 
J. Simeon, and M. Stefanescu. 
XQuery 1.0: An XML Query Language; available at 
http://www.w3.org/TR/xquery/. 



\bibitem{Buneman-97} 
P. Buneman. 
Semistructured data. 
In {\em Proceedings of the ACM SIGMOD-SIGACT-SIGART Symposium on 
Principles of Database Systems}, pages 117--121, 1997. 

\bibitem{BDH-96} 
P. Buneman, S. B. Davidson, G. G. Hillebrand, and D. Suciu. 
A query language and optimization techniques for unstructured data. 
In {\em Proceedings of the ACM SIGMOD International Conference 
on Management of Data}, pages 505--516, 1996. 

\bibitem{BDS-95} 
P. Buneman, S. B. Davidson, and D. Suciu. 
Programming constructs for unstructured data. 
In {\em Proceedings of the 5th International Workshop on 
Database Programming Languages}, page 12, 1995. 

\bibitem{BFW-98} 
P. Buneman, W. Fan, and S. Weinstein. 
Path constraints in semistructured and structured databases. 
In {\em Proceedings of the ACM SIGMOD SIGACT SIGART Symposium on 
Principles of Database Systems}, pages 129--138, 1998. 

\bibitem{BFS-2000} 
P. Buneman, M. F. Fernandez, and D. Suciu. 
UnQL: A query language and algebra 
for semistructured data based on structural recursion. 
{\em VLDB Journal}, 9(1):76--110, 2000. 

%\bibitem{CHMW-01} 
%G. Chang, M. J. Healey, J. A. M. McHugh, and J. T. L. Wang. 
%{\em Mining the World Wide Web: An Information Search Approach}. 
%Kluwer Academic Publishers, Norwell, Massachusetts, 2001. 
% 


\bibitem{bunke99} 
H.~Bunke. 
\newblock Error correcting graph matching: On the influence of the underlying 
  cost function. 
\newblock {\em IEEE Transactions on Pattern Analysis and Machine Intelligence}, 
  21(9):917--922, 1999. 

\bibitem{bunke83} 
H.~Bunke and G.~Allermann. 
\newblock Inexact graph matching for structural pattern recognition. 
\newblock {\em Pattern Recognition Letters}, 1(4):245--253, 1983. 



\bibitem{cha-98} 
S. S. Chawathe, S. Abiteboul, and J. Widom. 
Representing and querying changes in semistructured data. 
In {\em Proceedings of the IEEE International Conference 
on Data Engineering}, 
pages 4--13, 1998. 

\bibitem{cha-97} 
S. S. Chawathe and H. Garcia-Molina. 
Meaningful change detection in structured data. 
In {\em Proceedings of the 
ACM SIGMOD International Conference on Management of Data}, 
pages 26--37, 1997. 

\bibitem{cha-96} 
S. S. Chawathe, A. Rajaraman, H. Garcia-Molina, and J. Widom. 
Change detection in hierarchically structured information. 
In {\em Proceedings of the 
ACM SIGMOD International Conference on Management of Data}, 
pages 493--504, 1996. 

\bibitem{CJK-2001} 
Z. Chen, H. V. Jagadish, F. Korn, N. Koudas, S. Muthukrishnan, 
R. T. Ng, and D. Srivastava. 
Counting twig matches in a tree. 
In {\em Proceedings of the 
IEEE International Conference on Data Engineering}, 
pages 595--604, 2001. 

\bibitem{CKK-2000} 
Z. Chen, F. Korn, N. Koudas, and S. Muthukrishnan. 
Selectivity estimation for boolean queries. 
In {\em Proceedings of the ACM SIGMOD-SIGACT-SIGART Symposium on 
Principles of Database Systems}, pages 216--225, 2000. 

\bibitem{christmas95} 
W.~J. Christmas, J.~Kittler, and M.~Petrou. 
\newblock Structural matching in computer vision using probabilistic 
  relaxation. 
\newblock {\em  IEEE Transactions on Pattern Analysis and Machine Intelligence}, 17(8):749--764,1995. 

\bibitem{CHI-99} 
R. Cole, R. Hariharan, and P. Indyk. 
Tree pattern matching and subset 
matching in deterministic $O(n \log^{3} n)$-time. 
In {\em Proceedings of the ACM-SIAM Symposium on Discrete Algorithms}, 
pages 245--254, 1999. 

\bibitem{graphlog} 
M. P. Consens and A. O. Mendelzon, 
\newblock GraphLog: a visual formalism for real life recursion. 
\newblock {\em Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART 
symposium on Principles of database systems}, pages 404--416, 1990. 


\bibitem{subdue94} 
D.~J. Cook and L.~B. Holder. 
\newblock Substructure discovery using minimum description length and 
  background knowledge. 
\newblock {\em In Journal of Artificial Intelligence Research}, 1:231--255, 
  1994. 

\bibitem{CF96} 
L.~Cordella, P.~Foggia, C.~Sansone, and M.~Vento. 
\newblock An efficient algorithm for the inexact matching of arg graphs using a 
  contextual transformational model. 
\newblock In {\em In proceedings of the 13th ICPR}, volume~3, pages 180--184. 
  IEEE Computer Society Press, 1996. 

\bibitem{CG70} 
D.~Corneil and C.~C. Gotlieb. 
\newblock An efficient algorithm for graph isomorphism. 
\newblock {\em {Journal} of the ACM}, 17(1):51--64, 1970. 

\bibitem{DTK-98} 
L. Dehaspe, H. Toivonen, and R. D. King. 
Finding frequent substructures in chemical compounds. 
In {\em Proceedings of the 4th International Conference 
on Knowledge Discovery and Data Mining}, pages 30--36, 1998. 

\bibitem{DFF-99} 
A. Deutsch, M. F. Fernandez, D. Florescu, A. Y. Levy, and D. Suciu. 
A query language for XML. 
{\em Computer Networks}, 31(11-16):1155--1169, 1999. 


\bibitem{subdue97} 
S.~Djoko, D.~J. Cook, and L.~B. Holder. 
\newblock An empirical study of domain knowledge and its benefits to 
  substructure discovery. 
\newblock {\em IEEE Transactions on Knowledge and Data Engineering}, 9(4), 
  1997. 


\bibitem{eshera84} 
M.~A. Eshera and K.-S. Fu. 
\newblock A graph distance measure for image analysis. 
\newblock {\em IEEE Transactions on Systems Man and Cybernetics}, 
  14(3):353--363, 1984. 

\bibitem{feng94} 
J.~Feng, M.~Laumy, and M.~Dhome. 
\newblock Inexact matching using neural networks. 
\newblock In E.~Gelsema and e.~L.N.~Kanal, editors, {\em Pattern recognition in 
  practice IV: Multiple Paradigms, Comparative Studies and Hybrid Systems}. 
  North--Holland, 1994. 


\bibitem{FFK-98} 
M. F. Fernandez, D. Florescu, J. Kang, A. Y. Levy, and D. Suciu. 
Catching the boat with strudel: Experiences with a 
Web-site management system. 
In {\em Proceedings of the ACM SIGMOD International Conference 
on Management of Data}, pages 414--425, 1998. 

\bibitem{valiente01} 
M.-L. Fernandez and G.~Valiente. 
\newblock A graph distance metric combining maximum common subgraph and minimum 
  common supergraph. 
\newblock {\em Pattern Recognition Letters}, pages 753--758, 2001. 



\bibitem{FGG+2001} 
A. Ferro, G. Gallo, R. Giugno, and A. Pulvirenti. 
\newblock Best-match retrieval for structured images. 
{\em IEEE Transactions on Pattern Analysis and 
Machine Intelligence}, 23(7):707--718, 2001. 

\bibitem{FB-92} 
W. B. Frakes and R. Baeza-Yates. 
{\em Information Retrieval: Data Structures and Algorithms}. 
Prentice Hall, 1992. 

\bibitem{GJ79} 
M.~Garey and D.~Johnson. 
\newblock {\em Computers and Intractability: A Guide to the Theory of 
  NP-Completeness}. 
\newblock Freeman and Company, 1979. 

\bibitem{gold96} 
S.~Gold and A.~Rangarajan. 
\newblock A graduated assignment algorithm for graph matching. 
\newblock {\em IEEE Transactions on Pattern Analysis and Machine Intelligence}, 
  18(4):377--388, 1996. 

\bibitem{GW-97} 
R. Goldman and J. Widom. 
DataGuides: Enabling query formulation and 
optimization in semistructured databases. 
In {\em Proceedings of the International 
Conference on Very Large Data Bases}, pages 436--445, 1997. 

\bibitem{GT-87} 
G. H. Gonnet and F. W. Tompa. 
Mind your grammar: A new approach to modeling text. 
In {\em Proceedings of the International 
Conference on Very Large Data Bases}, pages 339--346, 1987. 

\bibitem{Gut-94} 
R. H. Guting. 
GraphDB: Modeling and querying graphs in databases. 
In {\em Proceedings of the International 
Conference on Very Large Data Bases}, 
pages 297--308, 1994. 

\bibitem{GPG-90} 
M. Gyssens, J. Paredaens, and D. V. Gucht. 
A graph-oriented object database model. 
In {\em Proceedings of the ACM SIGMOD-SIGACT-SIGART Symposium on 
Principles of Database Systems}, pages 417--424, 1990. 

\bibitem{henderson90} 
T.~C. Henderson. 
\newblock Discrete relaxation techniques. 
\newblock {\em Oxford University Press}, 1990. 

\bibitem{HO-82} 
C. M. Hoffman and M. J. O'Donnell. 
Pattern matching in trees. 
{\em Journal of the ACM}, 29(1):68--95, 1982. 

\bibitem{skordas89} 
R.~Horaud and T.~Skordas. 
\newblock Stereo correspondence through feature grouping and maximal cliques. 
\newblock {\em IEEE Transactions on Pattern Analysis and Machine Intelligence}, 
  11(11):1168--1180, 1989. 


\bibitem{jaak96} 
J. Jaakkola and P. Kilpelainen. 
\newblock Using sgrep for querying structured text files. 
University of Helsinki, Department of Computer Science, Report C-1996-83, 
November 1996; available at 
{\tt http://www.cs.helsinki.fi/u/jjaakkol/sgrep.html}. 

%\bibitem{JKS-98} 
%G. Jacobson, B. Krishnamurthy, D. Srivastava, and D. Suciu. 
%Focusing search in hierarchical structures with directory sets. 
%In {\em Proceedings of the 
%7th International Conference on Information and Knowledge Management}, 
%pages 1--9, 1998. 
% 
\bibitem{JKN-99} 
H. V. Jagadish, O. Kapitskaia, R. T. Ng, and D. Srivastava. 
Multi-Dimensional substring selectivity estimation. 
In {\em Proceedings of the International 
Conference on Very Large Data Bases}, pages 387--398, 1999. 

\bibitem{JLM-99} 
H. V. Jagadish, L. V. S. Lakshmanan, T. Milo, D. Srivastava, and D. Vista. 
Querying network directories. 
In {\em Proceedings of the ACM SIGMOD 
International Conference on Management of Data}, pages 133--144, 1999. 

\bibitem{JNS-99} 
H. V. Jagadish, R. T. Ng, and D. Srivastava. 
Substring selectivity estimation. 
In {\em Proceedings of the ACM SIGMOD-SIGACT-SIGART Symposium on 
Principles of Database Systems}, pages 249--260, 1999. 


\bibitem{daylight} 
C. A. James, D. Weininger, and J. Delany. 
\newblock {\em Daylight Theory Manual-Daylight 4.71}. 
\newblock Daylight Chemical Information Systems, www.daylight.com, 2000. 

\bibitem{sagiv} 
Y. Kanza and Y. Sagiv. 
\newblock Flexible queries over semistructured data. 
\newblock In {\em Proceedings of the ACM 
SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems}, 2001. 

\bibitem{KI-92} 
P. Kilpelainen. 
Tree matching problems with applications to structured text databases. 
Report A-1992-6, University of Helsinki, Finland, November 1992. 

\bibitem{KM-93} 
P. Kilpelainen and H. Mannila. 
Retrieval from hierarchical texts by partial patterns. 
In {\em Proceedings of the 16th Annual International ACM SIGIR 
Conference on Research and Development in Information Retrieval}, 
pages 214--222, 1993. 

\bibitem{KM-94} 
P. Kilpelainen and H. Mannila. 
Query primitives for tree-structured data. 
In {\em Proceedings of the Annual Symposium on Combinatorial 
Pattern Matching}, pages 213--225, 1994. 

\bibitem{KM-95} 
P. Kilpelainen and H. Mannila. 
Ordered and unordered tree inclusion. 
{\em SIAM J. Comput.}, 24(2):340--356, 1995. 

%\bibitem{KMS-2000} 
%N. Koudas, S. Muthukrishnan, and D. Srivastava. 
%Optimal histograms for hierarchical range queries. 
%In {\em Proceedings of the ACM SIGMOD-SIGACT-SIGART Symposium on 
%Principles of Database Systems}, pages 196--204, 2000. 
% 
\bibitem{KVI-96} 
P. Krishnan, J. S. Vitter, and B. R. Iyer. 
Estimating alphanumeric selectivity in the presence of wildcards. 
In {\em Proceedings of the ACM SIGMOD International Conference 
on Management of Data}, pages 282--293, 1996. 

\bibitem{KRR-2000} 
R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, 
A. Tomkins, and E. Upfal. 
The Web as a graph. 
In {\em Proceedings of the ACM SIGMOD SIGACT SIGART Symposium on 
Principles of Database Systems}, pages 1--10, 2000. 

\bibitem{leung-93} 
T. W. Leung, G. Mitchell, B. Subramanian, B. Vance, S. L. Vandenberg, 
and S. B. Zdonik. 
The AQUA data model and algebra. 
In {\em Proceedings of the 
4th Workshop on Database Programming Languages}, 
pages 157--175, 1993. 

\bibitem{levi72} 
G.~Levi. 
\newblock A note on the derivation of maximal common subgraphs of two directed 
  or undirected graphs. 
\newblock {\em Calcols 9}, pages 341--354, 1972. 


\bibitem{li01} 
Q.~Li and B.~Moon. 
\newblock Indexing and querying {XML} data for regular path expressions. 
\newblock In {\em Proceedings of the 27th International Conference on Very Large Databases}, pages 361--370, 2001. 


\bibitem{llados01} 
J.~Lladss, E.~Mart?, and J.~Villanueva. 
\newblock Symbol recognition by error-tolerant subgraph matching between region 
  adjacency graphs. 
\newblock {\em IEEE Transactions on Pattern Analysis and Machine Intelligence}, 
  23(10):1137--1143, 2001. 


\bibitem{MM-90} 
U.~Manber and G.~Myers. 
\newblock Suffix arrays: A new method for on-line string searches. 
\newblock In {\em Proceedings of the 1st Annual ACM-SIAM Symposium on 
Discrete Algorithms}, pages 319--327, 1990. 

\bibitem{MN-99} 
S. Maneth and F. Neven. 
Structured document transformations based on XSL. 
In {\em Proceedings of the 
7th Workshop on Database Programming Languages}, 
pages 80--98, 1999. 

\bibitem{websubdue} 
N.~Manocha, D.~J. Cook, and L.~B. Holder. 
\newblock Structural web search using a graph-based discovery system. 
\newblock In {\em Proceedings of the Florida Artificial Intelligence Research 
  Symposium}, 2001. 

\bibitem{MW-99} 
J. McHugh and J. Widom. 
Query optimization for XML. 
In {\em Proceedings of the International Conference 
on Very Large Data Bases}, pages 315--326, 1999. 

\bibitem{MMM-97} 
A. O. Mendelzon, G. A. Mihaila, and T. Milo. 
Querying the World Wide Web. 
{\em International Journal on Digital Libraries}, 
1(1):54--67, 1997. 

\bibitem{MW-95} 
A. O. Mendelzon and P. T. Wood. 
Finding regular simple paths in graph databases. 
{\em SIAM J. Comput.}, 24(6):1235--1258, 1995. 

\bibitem{MS-99} 
T. Milo and D. Suciu. 
Index structures for path expressions. 
In {\em Proceedings of the 
International Conference on Database Theory}, 
pages 277--295, 1999. 
%http://www.cs.washington.edu/homes/suciu/NodeInternal,proj.genoid_1.html 

\bibitem{MS-2002} 
G. Miklau and D. Suciu. 
%Containment and equivalence of tree pattern queries. 
Containment and equivalence of XPath expressions. 
In {\em Proceedings of the ACM SIGMOD-SIGACT-SIGART Symposium on 
Principles of Database Systems}, 2002. 

\bibitem{myaeng92} 
S.~H. Myaeng and A.~Lopez-Lopez. 
\newblock Conceptual graph matching: a flexible algorithm and experiments. 
\newblock {\em Journal of Experimental Theoretical Artificial Intelligence}, 
  4:107--126, 1992. 


\bibitem{hancock98} 
R.~Myers, R.~Wilson, and E.~R. Hancock. 
\newblock Bayesian graph edit distance. 
\newblock In {\em 10th Int. Conf. on Image Analysis and Processing, IEEE}, 
  1998. 

\bibitem{nci} 
National Cancer Institute 
\newblock http://www.nci.nih.gov/ 


\bibitem{NUW-97} 
S. Nestorov, J. D. Ullman, J. L. Wiener, and S. S. Chawathe. 
Representative objects: Concise representations of semistructured, 
hierarchical data. 
In {\em Proceedings of the International Conference on Data Engineering}, 
pages 79--90, 1997. 

\bibitem{NS-2000} 
F. Neven and T. Schwentick. 
Expressive and efficient pattern languages for tree-structured data. 
In {\em Proceedings of the ACM SIGMOD-SIGACT-SIGART Symposium on 
Principles of Database Systems}, pages 145--156, 2000. 

\bibitem{nilsson80} 
N.~Nilsson. 
\newblock {\em Principles of Artificial Intelligence}. 
\newblock Tioga, Palo Alto, California, 1980. 

\bibitem{PDS-00} 
W. H. Piel, M. J. Donoghue, and M. J. Sanderson. 
TreeBASE: A database of phylogenetic information. 
In {\em Proceedings of the 2nd International 
Workshop of Species 2000}, Tsukuba, Japan, 2000. 

\bibitem{RR-92} 
R. Ramesh and I. V. Ramakrishnan. 
Nonlinear pattern matching in trees. 
{\em Journal of the ACM}, 39(2):295--316, 1992. 

\bibitem{fu83} 
A.~Sanfeliu and K.~Fu. 
\newblock A distace measure between attributed relational graphs for pattern 
  recognition. 
\newblock {\em IEEE Transactions on Systems Man and Cybernetics}, 
  13(3):353--362, 1983. 

\bibitem{SN-2000} 
T. Schlieder and F. Naumann, 
Approximate tree embedding for querying XML data. 
In {\em Proceedings of the ACM SIGIR Workshop on XML and 
Information Retrieval}, Athens, Greece, July 2000. 

\bibitem{SWSZ-02} 
D. Shasha, J. T. L. Wang, H. Shan, and K. Zhang. 
ATreeGrep: Approximate searching in unordered trees. 
Submitted, 2002. 

\bibitem{SKR-01} 
H. Su, H. Kuno, and E. Rundensteiner. 
Automating the transformation of XML documents. 
In {\em Proceedings of the 
Workshop on Web Information and Data Management}, 2001. 


\bibitem{subra-95} 
B. Subramanian, T. W. Leung, S. L. Vandenberg, and S. B. Zdonik. 
The AQUA approach to querying lists and trees in object-oriented databases. 
In {\em Proceedings of the 
IEEE International Conference on Data Engineering}, 
pages 80--89, 1995. 

\bibitem{subra-93} 
B. Subramanian, S. B. Zdonik, T. W. Leung, and S. L. Vandenberg. 
Ordered types in the AQUA data model. 
In {\em Proceedings of the 
4th Workshop on Database Programming Languages}, 
pages 115--135, 1993. 

\bibitem{suciu} 
D.~Suciu. 
\newblock An overview of semistructured data. 
\newblock {\em SIGACTN: SIGACT News (ACM Special Interest Group on Automata and 
  Computability Theory)}, 29, 1998. 

\bibitem{tsai79} 
W.~H. Tsai and K.~S. Fu. 
\newblock Error-correcting isomorphism of attributed relational graphs for 
  pattern analysis. 
\newblock {\em IEEE Transactions on Systems Man and Cybernetics}, 9:757--768, 1979. 

\bibitem{U76} 
J.~Ullmann. 
\newblock An algorithm for subgraph isomorphism. 
\newblock {\em Journal of the Association for Computing Machinery}, 23:31--42, 
  1976. 

\bibitem{umeyama88} 
S.~Umeyama. 
\newblock An eigendecomposition approach to weighted graph matching problems. 
\newblock {\em IEEE Transactions Pattern Analysis and Machine Intelligence}, 
  10(5):695--703, 1988. 

\bibitem{vianu01} 
V.~Vianu. 
\newblock A web odyssey: from {Codd} to {XML}. 
\newblock In {\em Symposium on Principles of Database Systems}, 2001. 


\bibitem{WZJS-94} 
J.~T.~L. Wang, K.~Jeong, K.~Zhang, and D.~Shasha. 
\newblock A system for approximate tree matching. 
\newblock {\em IEEE Transactions on Knowledge and Data Engineering}, 
6(4):559--571, 1994. 

\bibitem{WSC-97} 
J. T. L. Wang, D. Shasha, G. J.-S. Chang, L. Relihan, K. Zhang, and G. Patel. 
Structural matching and discovery in document databases. 
In {\em Proceedings of the ACM SIGMOD 
International Conference on Management of Data}, pages 560--563, 1997. 

\bibitem{WSS-99} 
J. T. L. Wang, B. A. Shapiro, and D. Shasha (eds). 
{\em Pattern Discovery in Biomolecular Data: 
Tools, Techniques and Applications}. 
Oxford University Press, New York, 1999. 

\bibitem{WSS-96} 
J. T. L. Wang, B. A. Shapiro, D. Shasha, K. Zhang, and C.-Y. Chang. 
Automated discovery of active motifs in multiple RNA secondary structures. 
In {\em Proceedings of the 2nd International Conference on 
Knowledge Discovery and Data Mining}, 
pages 70--75, 1996. 

\bibitem{WWS-97} 
X. Wang, J. T. L. Wang, D. Shasha, B. A. Shapiro, 
S. Dikshitulu, I. Rigoutsos, and K. Zhang. 
Automated discovery of active motifs in three dimensional molecules. 
In {\em Proceedings of the 3rd International Conference 
on Knowledge Discovery and Data Mining}, pages 89--95, 1997. 

\bibitem{WVI-97} 
M. Wang, J. S. Vitter, and B. R. Iyer. 
Selectivity estimation in the presence of alphanumeric correlations. 
In {\em Proceedings of the IEEE International 
Conference on Data Engineering}, pages 169--180, 1997. 

\bibitem{wilson96} 
R.~Wilson and E.~Hancock. 
\newblock Bayesian compatibility model for graph matching. 
\newblock {\em Pattern Recognition Letters}, 17:263--276, 1996. 

\bibitem{wong85} 
A.~Wong and M.~You. 
\newblock Entropy and distance of random graphs with application to structural 
  pattern recognition. 
\newblock {\em IEEE Transactions Pattern Analysis and Machine Intelligence}, 
  7(5):599--609, 1985. 

\bibitem{Wu-92} 
S. Wu and U. Manber. 
Fast text searching allowing errors. 
{\em Communications of the ACM}, 35(10):83--91, 1992. 


\bibitem{XMLTreediff} 
XML TreeDiff. http://www.alphaworks.ibm.com/aw.nsf/FAQs/xmltreediff. 

\bibitem{yannakakis90} 
M.~Yannakakis. 
\newblock Graph theoretic methods in database theory. 
\newblock In {\em Proc. 9th ACM Symp. on Principles of Database Systems}, pages 
  230--242, 1990. 
\newblock (Invited paper). 

\bibitem{ZSW-94} 
K. Zhang, D. Shasha, and J. T. L. Wang. 
Approximate tree matching in the presence 
of variable length don't cares. 
{\em Journal of Algorithms}, 16(1):33--66, 1994. 

\bibitem{ZSS-92:paper} 
K.~Zhang, R.~Statman, and D.~Shasha. 
\newblock On the editing distance between unordered labeled trees. 
\newblock {\em Information Processing Letters}, 42:133--139, 1992. 








\end{thebibliography} 

\end{document}