J. Tekli, R. Chbeir, and K. Yétongnon, An overview on XML similarity: Background, current trends and future directions, Computer Science Review, vol.3, issue.3, pp.151-173, 2009.
DOI : 10.1016/j.cosrev.2009.03.001
URL : https://hal.archives-ouvertes.fr/hal-01093568

M. Lalmas and R. Baeza-yates, Structured document retrieval, in: Encyclopedia of Database Systems, pp.2867-2868, 2009.

G. Kazai, N. Govert, M. Lalmas, and N. Fuhr, The INEX Evaluation Initiative, pp.279-293, 2003.
DOI : 10.1007/978-3-540-45194-5_19

A. Trotman, Processing structural constraints, in: Encyclopedia of Database Systems, pp.2191-2195, 2009.

S. Amer-yahia and M. Lalmas, XML search, ACM SIGMOD Record, vol.35, issue.4, pp.16-23, 2006.
DOI : 10.1145/1228268.1228271

A. Trotman and B. Sigurbjornsson, Narrowed Extended XPath I (NEXI), Proceedings of the 3rd Workshop of the Initiative for the Evaluation of XML retrieval (INEX), pp.16-40, 2004.
DOI : 10.1007/11424550_2

A. Campi, E. Damiani, S. Guinea, S. Marrara, G. Pasi et al., A fuzzy extension of the XPath query language, Journal of Intelligent Information Systems, vol.8, issue.4, pp.285-305, 2009.
DOI : 10.1007/s10844-008-0066-3

C. Zhang, J. Naughton, D. Dewitt, Q. Luo, and G. Lohman, On supporting containment queries in relational database management systems, Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data, pp.425-426, 2001.

S. Al-khalifa, H. Jagadish, N. Koudas, J. Patel, D. Srivastava et al., Structural joins: a primitive for efficient XML query pattern matching, Proceedings 18th International Conference on Data Engineering, pp.141-152, 2002.
DOI : 10.1109/ICDE.2002.994704

N. Bruno, N. Koudas, and D. Srivastava, Holistic twig joins, Proceedings of the 2002 ACM SIGMOD international conference on Management of data , SIGMOD '02, pp.310-321, 2002.
DOI : 10.1145/564691.564727

J. Lu, T. Chen, and T. W. Ling, Efficient processing of XML twig patterns with parent child edges, Proceedings of the Thirteenth ACM conference on Information and knowledge management , CIKM '04, pp.533-542, 2004.
DOI : 10.1145/1031171.1031272

J. Lu, T. W. Ling, C. Y. Chan, and T. Chen, From region encoding to extended Dewey: on efficient processing of XML twig pattern matching, Proceedings of the 31st International Conference on Very Large Data Bases, VLDB, pp.193-204, 2005.

S. Chen, H. G. Li, J. Tatemura, W. P. Hsiung, D. Agrawal et al., Twig2Stack: bottom-up processing of generalizedtree-pattern queries over XML documents, Proceedings of the 32nd International Conference on Very Large Data Bases, pp.6-283, 2006.

L. Qin, J. X. Yu, and B. Ding, TwigList: Make Twig Pattern Matching Fast, Proceedings of the 12th International Conference on Database Systems for Advanced Applications, pp.850-862, 2007.
DOI : 10.1007/978-3-540-71703-4_70

S. C. Haw and C. S. Lee, TwigX-Guide: an efficient twig pattern matching system extending dataguide indexing and region encoding labeling, J. Inf. Sci. Eng, vol.25, issue.2, pp.603-617, 2009.

D. Shasha, J. T. Wang, H. Shan, and K. Zhang, ATreeGrep: approximate searching in unordered trees, Proceedings 14th International Conference on Scientific and Statistical Database Management, pp.89-98, 2002.
DOI : 10.1109/SSDM.2002.1029709

P. Zezula, F. Mandreoli, and R. Martoglia, Tree Signatures and Unordered XML Pattern Matching, 30th Conference on Current Trends in Theory and Practice of Computer Science, pp.122-139, 2004.
DOI : 10.1007/978-3-540-24618-3_10

X. Wu and G. Liu, XML twig pattern matching using version tree, Data Knowledge Eng, pp.580-599, 2008.

J. Yao and M. Z. , II, A fast tree pattern matching algorithm for XML query, ACM International Conference on Web Intelligence, pp.235-241, 2004.

P. Ogilvie, Retrieval using structure for question answering, Proceedings of the First Twente Data Management Workshop; XML databases and Information retrieval, pp.15-23, 2004.

P. Buneman, S. Davidson, G. Hillebrand, and D. Suciu, A query language and optimization techniques for unstructured data, Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, SIGMOD'96, pp.505-516, 1996.

A. Levy, M. Fernandez, D. Suciu, D. Florescu, and A. Deutsch, XMLQL: a query language for XML, Tech. Rep., World Wide Web Consortium technical report, Number NOTE-xml, 1998.

D. Chamberlin, J. Robie, and D. Florescu, Quilt: an XML query language for heterogeneous data sources, in: The World Wide Web and Databases, Lecture Notes in Computer Science, pp.1-25, 1997.

D. Chamberlin and P. Fankhauser, XML Query Use Cases, Tech. Rep., World Wide Web Consortium (W3C) Group Note, 2007.

C. Botev and J. Shanmugasundaram, XQuery Full-Text, pp.3665-3671, 2009.
DOI : 10.1007/978-1-4899-7993-3_775-2

R. Van-zwol, J. Baas, H. Van-oostendorp, and F. Wiering, Bricks: The Building Blocks to Tackle Query Formulation in Structured Document Retrieval, 28th European Conference on IR Research, pp.314-325, 2006.
DOI : 10.1007/11735106_28

S. Ceri, S. Comai, E. Damiani, P. Fraternali, S. Paraboschi et al., XML-GL: a graphical language for querying and restructuring XML documents, Proceedings of the Eighth International Conference on World Wide Web, WWW'99, pp.1171-1187, 1999.
DOI : 10.1016/S1389-1286(99)00014-6

C. M. Hoffmann and M. J. , Pattern Matching in Trees, Journal of the ACM, vol.29, issue.1, pp.68-95, 1982.
DOI : 10.1145/322290.322295

A. V. Aho and M. J. Corasick, Efficient string matching: an aid to bibliographic search, Communications of the ACM, vol.18, issue.6, pp.333-340, 1975.
DOI : 10.1145/360825.360855

D. R. Chase, An improvement to bottom-up tree pattern matching, Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '87, pp.168-177, 1987.
DOI : 10.1145/41625.41640

J. Cai, R. Paige, and R. E. Tarjan, More efficient bottom-up tree pattern matching, pp.72-86, 1990.
DOI : 10.1007/3-540-52590-4_41
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1028.4459

J. Burghardt, A tree pattern matching algorithm with reasonable space requirements, pp.1-15, 1988.
DOI : 10.1007/BFb0026092

S. R. Kosaraju, Efficient tree pattern matching, 30th Annual Symposium on Foundations of Computer Science, pp.178-183, 1989.
DOI : 10.1109/SFCS.1989.63475

M. Dubiner, Z. Galil, and E. Magen, Faster tree pattern matching, Journal of the ACM, vol.41, issue.2, pp.205-213, 1994.
DOI : 10.1145/174652.174653

R. Cole and R. Hariharan, Tree pattern matching and subset matching in randomized o(n log 3 m) time, Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp.66-75, 1997.

R. Cole and R. Hariharan, Tree Pattern Matching to Subset Matching in Linear Time, SIAM Journal on Computing, vol.32, issue.4, pp.1056-1066, 2003.
DOI : 10.1137/S0097539700382704

P. Bille, A survey on tree edit distance and related problems, Theoretical Computer Science, vol.337, issue.1-3, pp.217-239, 2005.
DOI : 10.1016/j.tcs.2004.12.030

T. Schlieder and H. Meuss, Querying and ranking XML documents, Journal of the American Society for Information Science and Technology, vol.26, issue.6, pp.489-503, 2002.
DOI : 10.1002/asi.10060
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.3071

L. H. Yang, M. L. Lee, and W. Hsu, Finding hot query patterns over an XQuery stream, The VLDB Journal, vol.12, issue.4, pp.318-332, 2004.
DOI : 10.1007/s00778-004-0134-4

T. Schlieder, Approximate tree embedding for querying XML data, Proceedings of ACM SIGIR workshop on XML and information retrieval, 2000.

K. C. Tai, The Tree-to-Tree Correction Problem, Journal of the ACM, vol.26, issue.3, pp.422-433, 1979.
DOI : 10.1145/322139.322143

K. Zhang and D. Shasha, Simple Fast Algorithms for the Editing Distance between Trees and Related Problems, SIAM Journal on Computing, vol.18, issue.6, pp.1245-1262, 1989.
DOI : 10.1137/0218082

P. N. Klein, Computing the Edit-Distance Between Unrooted Ordered Trees, Proceedings of the 6th Annual European Symposium on Algorithms ESA'98, pp.91-102, 1998.
DOI : 10.1007/3-540-68530-8_8

W. Chen, New Algorithm for Ordered Tree-to-Tree Correction Problem, Journal of Algorithms, vol.40, issue.2, pp.135-158, 2001.
DOI : 10.1006/jagm.2001.1170

S. Dulucq and H. Touzet, Decomposition algorithms for the tree edit distance problem, Journal of Discrete Algorithms, vol.3, issue.2-4, pp.448-471, 2005.
DOI : 10.1016/j.jda.2004.08.018
URL : https://hal.archives-ouvertes.fr/hal-00307523

E. D. Demaine, S. Mozes, B. Rossman, and O. Weimann, An optimal decomposition algorithm for tree edit distance, ICALP'07, pp.146-157, 2007.
DOI : 10.1145/1644015.1644017
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.5720

D. E. Knuth, The Art of Computer Programming, Volume i: Fundamental Algorithms, 1997.

P. Kilpelainen and H. Mannila, Ordered and Unordered Tree Inclusion, SIAM Journal on Computing, vol.24, issue.2, pp.340-356, 1995.
DOI : 10.1137/S0097539791218202

T. Richter, A new algorithm for the ordered tree inclusion problem, Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching, CPM'97, pp.150-166, 1997.
DOI : 10.1007/3-540-63220-4_57

W. Chen, More Efficient Algorithm for Ordered Tree Inclusion, Journal of Algorithms, vol.26, issue.2, pp.370-385, 1998.
DOI : 10.1006/jagm.1997.0899

P. Bille and I. L. Gortz, The Tree Inclusion Problem: In Optimal Space and Faster, 32nd International Colloquium on Automata, Languages and Programming, ICALP, pp.66-77, 2005.
DOI : 10.1007/11523468_6

Y. Chen and Y. Chen, A new tree inclusion algorithm, Information Processing Letters, vol.98, issue.6, pp.253-262, 2006.
DOI : 10.1016/j.ipl.2005.11.022

H. L. Cheng and B. F. Wang, On Chen and Chen's new tree inclusion algorithm, Information Processing Letters, vol.103, issue.1, pp.14-18, 2007.
DOI : 10.1016/j.ipl.2007.02.006

Y. Chen and Y. Chen, A New Top-Down Algorithm for Tree Inclusion, 2010 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, pp.293-300, 2010.
DOI : 10.1109/CyberC.2010.60

R. A. Wagner and M. J. Fischer, The String-to-String Correction Problem, Journal of the ACM, vol.21, issue.1, pp.168-173, 1974.
DOI : 10.1145/321796.321811

T. Jiang, L. Wang, and K. Zhang, Alignment of trees?an alternative to tree edit, Theoret. Comput. Sci, pp.137-148, 1995.

T. Kuboyama, K. Shin, T. Miyahara, and H. Yasuda, A Theoretical Analysis of Alignment and Edit Problems for Trees, ICTCS'05, pp.323-337, 2005.
DOI : 10.1007/11560586_26

J. Jansson and A. Lingas, A Fast Algorithm for Optimal Alignment between Similar Ordered Trees, Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, CPM'01, pp.232-240, 2001.
DOI : 10.1007/3-540-48194-X_22

L. Wang and J. Zhao, Parametric alignment of ordered trees, Bioinformatics, vol.19, issue.17, pp.2237-2245, 2003.
DOI : 10.1093/bioinformatics/btg305

T. Chen, J. Lu, and T. W. Ling, On boosting holism in XML twig pattern matching using structural indexing techniques, Proceedings of the 2005 ACM SIGMOD international conference on Management of data , SIGMOD '05, pp.455-466, 2005.
DOI : 10.1145/1066157.1066209

H. Jiang, W. Wang, H. Lu, and J. X. Yu, Holistic Twig Joins on Indexed XML Documents, Proceedings of VLDB, pp.273-284, 2003.
DOI : 10.1016/B978-012722442-8/50032-X

G. Li, J. F. Zhang, and L. Zhou, Efficient holistic twig joins in leafto-root combining with root-to-leaf way, pp.834-849, 2007.

J. Li and J. Wang, TwigBuffer: Avoiding Useless Intermediate Solutions Completely in Twig Joins, Proceedings of the 13th International Conference on Database Systems for Advanced Applications DASFAA'08, pp.554-561, 2008.
DOI : 10.1007/978-3-540-78568-2_46

P. Zezula, G. Amato, F. Debole, and F. Rabitti, Tree Signatures for XML Querying and Navigation, pp.149-163, 2003.
DOI : 10.1007/978-3-540-39429-7_10

H. Wang, S. Park, W. Fan, and P. S. Yu, ViST, Proceedings of the 2003 ACM SIGMOD international conference on on Management of data , SIGMOD '03, pp.110-121, 2003.
DOI : 10.1145/872757.872774

Z. Jiang, C. Luo, W. C. Hou, Q. Zhu, and D. Che, Efficient Processing of XML Twig Pattern: A Novel One-Phase Holistic Solution, pp.7-87, 2007.
DOI : 10.1007/978-3-540-74469-6_10

J. Li and J. Wang, Fast Matching of Twig Patterns, Proceedings of the 19th International Conference on Database and Expert Systems Applications, in: DEXA'08, pp.523-536, 2008.
DOI : 10.1007/978-3-540-85654-2_45

E. Popovici, G. Ménier, and P. Marteau, SIRIUS: a lightweight XML indexing and approximate search system at INEX, pp.321-335, 2005.

M. D. Le and K. Pinel-sauvagnat, Utilisation de la distance d'édition pour l'appariement sémantique de documents XML, 2010.

C. Laitang, M. Boughanem, and K. Pinel-sauvagnat, XML Information Retrieval through Tree Edit Distance and Structural Summaries, Asia Information Retrieval Society Conference, AIRS, vol.26, issue.11, pp.73-83, 2011.
DOI : 10.1007/11424550_2

E. Damiani, B. Oliboni, and L. Tanca, Fuzzy Techniques for XML Data Smushing, Fuzzy Days, pp.637-652, 2001.
DOI : 10.1007/3-540-45493-4_65

C. Laitang, K. Pinel-sauvagnat, and M. Boughanem, Utilisation de la théorie des graphes et de la distance d'édition pour la recherche d'information sur documents XML, Proceedings of the 8th Annual Conférence en Recherche d'Information et Applications, CORIA, 2011.

A. Alilaouar, Interrogation flexible de documents semistructurés, 2007.

J. Zhou, M. Xie, and X. Meng, TwigStack+: Holistic twig join pruning using extended solution extension, Wuhan University Journal of Natural Sciences, vol.12, issue.5, pp.855-860, 2007.
DOI : 10.1007/s11859-007-0032-x

D. B. Dao and J. Cao, A Glance on Current XML Twig Pattern Matching Algorithms, pp.8-307, 2008.
DOI : 10.1007/978-3-540-69848-7_25

J. Lu, X. Meng, and T. W. Ling, Indexing and querying XML using extended Dewey labeling scheme, Data & Knowledge Engineering, vol.70, issue.1, pp.35-59, 2011.
DOI : 10.1016/j.datak.2010.08.001

P. Rao and B. Moon, Prix: indexing and querying XML using prufer sequences, pp.288-300, 2004.

H. Wang and X. Meng, On the sequencing of tree structures for XML indexing, Proceeding of ICDE, pp.372-383, 2005.

S. C. Haw and C. S. Lee, Node labeling schemes in XML query optimization: a survey and trends, IETE Tech. Rev, vol.26, issue.2, pp.88-100, 2009.

S. K. Izadi, T. Harder, and M. S. Haghjoo, S 3 : evaluation of treepattern XML queries supported by structural summaries, Proceedings of Data and Knowledge Engineering, pp.126-145, 2009.

Y. Mass and M. Mandelbrod, Using the INEX environment as a test bed for various user models for XML retrieval, pp.187-195, 2005.

V. Mihajlovic, G. Ramirez, T. Westerveld, D. Hiemstra, H. Blok et al., TIJAH Scratches INEX 2005: Vague Element Selection, Image Search, Overlap, and Relevance Feedback, pp.72-87, 2005.
DOI : 10.1007/11424550_22

R. Van-zwol, B3-sdr and effective use of structural hints, pp.146-160, 2005.

M. Theobald, R. Schenkel, and G. Weikum, Topx and XXL at INEX, pp.282-295, 2005.
DOI : 10.1007/978-3-540-34963-1_21

G. Hubert, XML retrieval based on direct contribution of query components, pp.172-186, 2005.

K. Pinel-sauvagnat, M. Boughanem, and C. Chrisment, Answering content-and-structure-based queries on XML documents using relevance propagation, Information Systems Special Issue SPIRE, pp.172-186, 2004.

M. B. Aouicha, M. Tmar, M. Boughanem, and M. Abid, XML information retrieval based on tree matching, IEEE International Conference on Engineering of Computer Based Systems, pp.499-500, 2008.

M. B. Aouicha, Une approche algébrique pour la recherche d'information structurée, 2009.

A. Alilaouar and F. Sédes, Fuzzy querying of XML documents, ACM International Conference on Web Intelligence and Intelligent Agent Technology, pp.11-14, 2005.

T. L. Saito and S. Morishita, Amoeba join: overcoming structural fluctuations in XML data, Ninth International Workshop on the Web and Databases, pp.38-43, 2006.

E. Damiani, L. Tanca, and F. A. Fontana, Fuzzy XML queries via context-based choice of aggregations, Kybernetika, vol.36, issue.6, pp.635-655, 2000.

N. Fuhr, M. Lalmas, S. Malik, and G. Kazai, Advances in XML Information Retrieval and Evaluation, 4th International Workshop of the Initiative for the Evaluation of XML Retrieval, Lecture Notes in Computer Science, vol.3977, 2005.

N. Fuhr and M. , Comparative evaluation of XML information retrieval systems, in: 5th International Workshop of the Initiative for the Evaluation of XML Retrieval, Lecture Notes in Computer Science, vol.4518, 2006.
DOI : 10.1007/978-3-540-73888-6

N. Fuhr, J. Kamps, and M. Lalmas, Focused access to XML documents, in: 6th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2007, Lecture Notes in Computer Science, vol.4862, 2008.
DOI : 10.1007/978-3-540-85902-4

S. Geva and J. , Advances in focused retrieval, in: 7th International Workshop of the Initiative for the Evaluation of XML Retrieval, Lecture Notes in Computer Science, vol.5631, 2008.
DOI : 10.1007/978-3-642-03761-0

S. Geva and J. , Focused retrieval and evaluation, in: 8th International Workshop of the Initiative for the Evaluation of XML Retrieval, Lecture Notes in Computer Science, vol.6203, 2009.
DOI : 10.1007/978-3-642-14556-8

S. Geva, J. Kamps, and R. , Comparative evaluation of focused retrieval, in: 9th International Workshop of the Inititative for the Evaluation of XML Retrieval, INEX 2010, Vugh, The Netherlands, Lecture Notes in Computer Science, vol.6932, 2010.
DOI : 10.1007/978-3-642-23577-1

S. Amer-yahia, S. Cho, and D. Srivastava, Tree Pattern Relaxation, pp.2-496, 2002.
DOI : 10.1007/3-540-45876-X_32
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.8.2292

]. T. Dalamagas, T. Cheng, K. J. Winkel, and T. K. Sellis, A methodology for clustering XML documents by structure, Information Systems, vol.31, issue.3, pp.187-228, 2006.
DOI : 10.1016/j.is.2004.11.009

V. I. Levenshtein, Binary codes capable of correcting deletions, insertions, and reversals, Soviet Phys, Dokl, vol.10, issue.8, pp.707-710, 1966.

S. Dulucq and H. Touzet, Analysis of Tree Edit Distance Algorithms, Proceedings of Combinatorial Pattern Matching, 14th Annual Symposium, CPM 2003, pp.83-95, 2003.
DOI : 10.1007/3-540-44888-8_7
URL : https://hal.archives-ouvertes.fr/hal-00307516

A. Schmidt, F. Waas, M. L. Kersten, M. J. Carey, I. Manolescu et al., XMark, Proceedings of 28th International Conference on Very Large Data Bases, pp.974-985, 2002.
DOI : 10.1016/B978-155860869-6/50096-2

B. B. Yao, M. T. Özsu, and N. , XBench benchmark and performance testing of XML DBMSs, Proceedings. 20th International Conference on Data Engineering, pp.621-633, 2004.
DOI : 10.1109/ICDE.2004.1320032

K. Runapongsa, J. M. Patel, H. V. Jagadish, Y. Chen, and S. , The Michigan benchmark: towards XML query performance diagnostics, Information Systems, vol.31, issue.2, pp.73-97, 2006.
DOI : 10.1016/j.is.2004.09.004

L. Denoyer and P. Gallinari, The Wikipedia XML corpus, ACM SIGIR Forum, vol.40, issue.1, pp.64-69, 2006.
DOI : 10.1145/1147197.1147210
URL : https://hal.archives-ouvertes.fr/hal-01172244

R. Schenkel, F. Suchanek, and G. Kasneci, YAWN: a semantically annotated Wikipedia XML corpus, in: 12. GI-Fachtagung für Datenbanksysteme in Business, pp.277-291, 2007.

G. Kazai, M. Lalmas, and A. P. De-vries, The overlap problem in content-oriented XML retrieval evaluation, Proceedings of the 27th annual international conference on Research and development in information retrieval , SIGIR '04, pp.72-79, 2004.
DOI : 10.1145/1008992.1009008

G. Kazai and M. , eXtended cumulated gain measures for the evaluation of content-oriented XML retrieval, ACM Transactions on Information Systems, vol.24, issue.4, pp.503-542, 2006.
DOI : 10.1145/1185877.1185883

A. P. De-vries, G. Kazai, and M. Lalmas, Tolerance to irrelevance: a user-effort evaluation of retrieval systems without predefined retrieval unit, Proceedings of RIAO 2004, pp.463-473, 2004.

B. Piwowarski, P. Gallinari, and G. Dupret, Precision recall with user modeling (PRUM), ACM Transactions on Information Systems, vol.25, issue.1, 2007.
DOI : 10.1145/1198296.1198297
URL : https://hal.archives-ouvertes.fr/hal-01172395

J. Pehcevski and J. A. Thom, Hixeval: highlighting XML retrieval evaluation, pp.43-57, 2005.

J. Pehcevski and B. Piwowarski, Evaluation Metrics for Structured Text Retrieval, pp.1015-1024, 2009.
DOI : 10.1007/978-1-4899-7993-3_152-2

A. Trotman and Q. Wang, Overview of the INEX 2010 Data Centric Track, pp.128-137, 2010.
DOI : 10.1007/978-3-642-23577-1_15

D. V. Ayala, D. Pinto, C. Balderas, and M. Tovar, BUAP: a first approach to the data-centric track of INEX 2010, pp.159-168, 2010.

F. Hummel, A. Da-silva, M. Moro, and A. Laender, Automatically generating structured queries in XML keyword search, in: INEX 2010 pre-proceedings, pp.138-149, 2010.

Q. Li, Q. Wang, and S. Wang, Inferring query pattern for XML keyword retrieval, in: INEX 2010 pre-proceedings, pp.150-158, 2010.

Q. Wang, G. Ramírez, M. M. Marx, M. Theobald, and J. Kamps, Overview of the INEX 2011 Data-Centric Track, Lecture Notes in Computer Science, vol.7424, 2011.
DOI : 10.1007/978-3-642-35734-3_10

R. Schenkel and M. Theobald, Overview of the INEX, Efficiency Track, pp.200-212, 2009.

A. Trotman and M. Lalmas, Why structural hints in queries do not help XML-retrieval, Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval , SIGIR '06, pp.711-712, 2006.
DOI : 10.1145/1148170.1148330

]. K. Sauvagnat, M. Boughanem, and C. Chrisment, Why Using Structural Hints in XML Retrieval?, 7th International Conference, pp.197-209, 2006.
DOI : 10.1007/11766254_17

C. Laitang, K. Pinel-sauvagnat, and M. Boughanem, DTD based costs for TreeEdit distance in Structured Information Retrieval, European Conference on Information Retrieval (ECIR), pp.25-27, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01264568

S. Stahl, The embeddings of a graph???A survey, Journal of Graph Theory, vol.8, issue.4, pp.275-298, 1978.
DOI : 10.1002/jgt.3190020402

C. Dürr, M. Heiligman, P. Hoyer, and M. Mhalla, Quantum query complexity of some graph problems, Proceedings of ICALP'04, pp.481-493, 2004.