11/25/2022 0 Comments Json query languageZhen Hua Liu, Beda Christoph Hammerschmidt, and Doug McMahon.Leonid Libkin, Wim Martens, and Domagoj Vrgo\vc.In International Colloquium on Automata, Languages, and Programming, pages 875-887. Unranked tree automata with sibling equalities and disequalities. The JavaScript Object Notation (JSON) Data Interchange Format. Internet Engineering Task Force (IETF).Georg Gottlob, Christoph Koch, and Klaus U.Efficient algorithms for processing xpath queries. Georg Gottlob, Christoph Koch, and Reinhard Pichler.PhD thesis, École normale supérieure de Cachan, France, 2010. (Raisonnement sur mots et arbres avec données). A linear-time model-checking algorithm for the alternation-free modal mu-calculus. A formal presentation of mongodb (extended version). Elena Botoeva, Diego Calvanese, Benjamin Cogrel, Martin Rezk, and Guohui Xiao.Two-variable logic on data trees and xml reasoning. Mikoaj Bojaínczyk, Anca Muscholl, Thomas Schwentick, and Luc Segoufin.In Proceedings Fifth International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2014, Verona, Italy, September 10-12, 2014., pages 189-202, 2014. Deterministic automata for unordered trees. Adrien Boiret, Vincent Hugot, Joachim Niehren, and Ralf Treinen. In STACS 92, 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992, Proceedings, pages 161-171, 1992. Equality and disequality constraints on direct subterms in tree automata. In Annual Symposium on Theoretical Aspects of Computer Science, pages 159-171. In Proceedings of the 6th Alberto Mendelzon International Workshop on Foundations of Data Management, Ouro Preto, Brazil, June 27-30, 2012, pages 180-195, 2012. Relative expressiveness of nested regular expressions. Pablo Barceló, Jorge Pérez, and Juan L.Reachability logic: An efficient fragment of transitive closure logic.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |