JSON
- 9 May 2017
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 123-135
- https://doi.org/10.1145/3034786.3056120
Abstract
Despite the fact that JSON is currently one of the most popular formats for exchanging data on the Web, there are very few studies on this topic and there is no agreement upon a theoretical framework for dealing with JSON. Therefore in this paper we propose a formal data model for JSON documents and, based on the common features present in available systems using JSON, we define a lightweight query language allowing us to navigate through JSON documents. We also introduce a logic capturing the schema proposal for JSON and study the complexity of basic computational tasks associated with these two formalisms.Keywords
Funding Information
- The DeLTA project (ANR-16-CE40-0007)
- STIC AMSUD (Foundations of Graph Structured Data (Fog))
- Millennium Nucleus Center for Semantic Web Research (NC120004)
This publication has 14 references indexed in Scilit:
- Querying Graphs with DataJournal of the ACM, 2016
- Deterministic Automata for Unordered TreesElectronic Proceedings in Theoretical Computer Science, 2014
- Two-variable logic on data trees and XML reasoningJournal of the ACM, 2009
- Unranked Tree Automata with Sibling Equalities and DisequalitiesLecture Notes in Computer Science, 2006
- Conjunctive queries over treesJournal of the ACM, 2006
- Constant-Memory Validation of Streaming XML Documents Against DTDsLecture Notes in Computer Science, 2006
- Efficient algorithms for processing XPath queriesACM Transactions on Database Systems, 2005
- Reachability logic: an efficient fragment of transitive closure logicLogic Journal of the IGPL, 2000
- A linear-time model-checking algorithm for the alternation-free modal mu-calculusFormal Methods in System Design, 1993
- Equality and disequality constraints on direct subterms in tree automataLecture Notes in Computer Science, 1992