N. Alechina and N. Immerman, Reachability logic: an efficient fragment of transitive closure logic, Logic Journal of IGPL, vol.8, issue.3, pp.325-337, 2000.
DOI : 10.1093/jigpal/8.3.325

P. Barceló, J. Pérez, and J. L. Reutter, Relative expressiveness of nested regular expressions, Proceedings of the 6th Alberto Mendelzon International Workshop on Foundations of Data Management, pp.180-195, 2012.

B. Bogaert and S. Tison, Equality and disequality constraints on direct subterms in tree automata, Annual Symposium on Theoretical Aspects of Computer Science, pp.159-171, 1992.
DOI : 10.1007/3-540-55210-3_181

B. Bogaert and S. Tison, Equality and disequality constraints on direct subterms in tree automata, STACS 92, 9th Annual Symposium on Theoretical Aspects of Computer Science Proceedings, pp.161-171, 1992.
DOI : 10.1007/3-540-55210-3_181

A. Boiret, V. Hugot, J. Niehren, and R. Treinen, Deterministic Automata for Unordered Trees, Proceedings Fifth International Symposium on Games, Automata, Logics and Formal Verification, pp.189-202, 2014.
DOI : 10.4204/EPTCS.161.17
URL : https://hal.archives-ouvertes.fr/hal-01020236

M. Boja´nczykboja´nczyk, A. Muscholl, T. Schwentick, and L. Segoufin, Two-variable logic on data trees and xml reasoning, Journal of the ACM (JACM), vol.56, issue.3, p.13, 2009.

E. Botoeva, D. Calvanese, B. Cogrel, M. Rezk, and G. Xiao, A formal presentation of mongodb (extended version). CoRR, abs, 1603.

T. Bray, The JavaScript Object Notation (JSON) Data Interchange Format, 2014.

R. Cleaveland and B. Steffen, A linear-time model-checking algorithm for the alternation-free modal mu-calculus, Formal Methods in System Design, pp.121-147, 1993.

D. Figueira, Reasoning on words and trees with data. (Raisonnement sur mots et arbres avec données), 2010.
URL : https://hal.archives-ouvertes.fr/tel-00718605

G. Gottlob, C. Koch, and R. Pichler, Efficient algorithms for processing xpath queries
DOI : 10.1145/1071610.1071614

G. Gottlob, C. Koch, and K. U. Schulz, Conjunctive queries over trees, Journal of the ACM, vol.53, issue.2, pp.238-272, 2006.
DOI : 10.1145/1131342.1131345

W. Karianto and C. Löding, Unranked Tree Automata with Sibling Equalities and Disequalities, International Colloquium on Automata, Languages, and Programming, pp.875-887, 2007.
DOI : 10.1007/978-3-540-73420-8_75
URL : http://www-i7.informatik.rwth-aachen.de/download/papers/karianto/kalo06.pdf

L. Libkin, W. Martens, and D. Vrgo?, Querying Graphs with Data, Journal of the ACM, vol.63, issue.2, p.14, 2016.
DOI : 10.1145/2206869.2206879

B. C. Zhen-hua-liu, D. Hammerschmidt, and . Mcmahon, JSON data management: supporting schema-less development in RDBMS, International Conference on Management of Data, SIGMOD 2014, pp.1247-1258, 2014.

N. Nurseitov, M. Paulson, R. Reynolds, and C. Izurieta, Comparison of json and xml data interchange formats: A case study, pp.157-162, 2009.

. Kian-win, Y. Ong, R. Papakonstantinou, and . Vernoux, The SQL++ semi-structured data model and query language: A capabilities survey of sql-on-hadoop, nosql and newsql databases, 1405.

L. Orientdb, The OrientDB database, 2016.

P. Parys, XPath evaluation in linear time with polynomial combined complexity, Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, PODS '09, pp.55-64, 2009.
DOI : 10.1145/1559795.1559805

F. Pezoa, J. L. Reutter, F. Suarez, M. Ugarte, and D. Vrgo?, Foundations of JSON Schema, Proceedings of the 25th International Conference on World Wide Web, WWW '16, pp.263-273, 2016.
DOI : 10.1145/2629489

J. Robie, G. Fourny, M. Brantner, D. Florescu, T. Westmann et al., JSONiq: The JSON Query Language, 2016.

L. Segoufin and C. Sirangelo, Constant-Memory Validation of Streaming XML Documents Against DTDs, International Conference on Database Theory, pp.299-313, 2007.
DOI : 10.1007/11965893_21

K. Wong and C. Löding, Unranked tree automata with sibling equalities and disequalities, Automata, Languages and Programming, 34th International Colloquium Proceedings, pp.875-887, 2007.