{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T04:20:30Z","timestamp":1782879630312,"version":"3.54.5"},"publisher-location":"New York, New York, USA","reference-count":19,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Millenium Institute for Foundational Research on Data"},{"name":"ENLACE-Fondecyt VID-UChile"},{"name":"CENIIT program at Linköping University","award":["17.05"],"award-info":[{"award-number":["17.05"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1145\/3178876.3186014","type":"proceedings-article","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T15:53:48Z","timestamp":1523634828000},"page":"1155-1164","source":"Crossref","is-referenced-by-count":68,"title":["Semantics and Complexity of GraphQL"],"prefix":"10.1145","author":[{"given":"Olaf","family":"Hartig","sequence":"first","affiliation":[{"name":"Link\u00f6ping University, Link\u00f6ping, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jorge","family":"P\u00e9rez","sequence":"additional","affiliation":[{"name":"Universidad de Chile, Santiago, Chile"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","reference":[{"key":"key-10.1145\/3178876.3186014-1","unstructured":"4Catalyzer Corporation. 2017. GraphQL Validation Complexity. https:\/\/github.com\/4Catalyzer\/graphql-validation-complexity\/. (2017)."},{"key":"key-10.1145\/3178876.3186014-2","unstructured":"Guillaume Bagan, Arnaud Durand, and Etienne Grandjean. 2007. On Acyclic Conjunctive Queries and Constant Delay Enumeration Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11--15, 2007, Proceedings. 208--222."},{"key":"key-10.1145\/3178876.3186014-3","doi-asserted-by":"crossref","unstructured":"Nadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, and Heribert Vollmer. 2017. On the Complexity of Hard Enumeration Problems. In Language and Automata Theory and Applications - 11th International Conference, LATA 2017, Umeå, Sweden, March 6--9, 2017, Proceedings. 183--195.","DOI":"10.1007\/978-3-319-53733-7_13"},{"key":"key-10.1145\/3178876.3186014-4","unstructured":"Arnaud Durand, Nicole Schweikardt, and Luc Segoufin. 2014. Enumerating answers to first-order queries over databases of low degree Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS'14, Snowbird, UT, USA, June 22--27, 2014. 121--131."},{"key":"key-10.1145\/3178876.3186014-5","unstructured":"Facebook, Inc.. 2016. GraphQL. Working Draft, Oct. 2016. Online at: http:\/\/facebook.github.io\/graphql, retrieved on Dec. 12, 2016. (Oct.. 2016)."},{"key":"key-10.1145\/3178876.3186014-6","doi-asserted-by":"crossref","unstructured":"Georg Gottlob, Nicola Leone, and Francesco Scarcello. 2001. The complexity of acyclic conjunctive queries. J. ACM Vol. 48, 3 (2001), 431--498.","DOI":"10.1145\/382780.382783"},{"key":"key-10.1145\/3178876.3186014-7","unstructured":"Olaf Hartig and Jorge Pérez. 2017. An Initial Analysis of Facebook's GraphQL Language Proceedings of the 11th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW)."},{"key":"key-10.1145\/3178876.3186014-8","doi-asserted-by":"crossref","unstructured":"D. S. Johnson. 1990. A catalog of complexity classes. In Handbook of Theoretical Computer Science, J. van Leeuwen (Ed.). Vol. Vol. A. Elsevier, Chapter 2.","DOI":"10.1016\/B978-0-444-88071-0.50007-2"},{"key":"key-10.1145\/3178876.3186014-9","unstructured":"Wojciech Kazana and Luc Segoufin. 2013. Enumeration of first-order queries on classes of structures with bounded expansion Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2013, New York, NY, USA - June 22 - 27, 2013. 297--308."},{"key":"key-10.1145\/3178876.3186014-10","unstructured":"Markus Kröll, Reinhard Pichler, and Sebastian Skritek. 2016. On the Complexity of Enumerating the Answers to Well-designed Pattern Trees 19th International Conference on Database Theory, ICDT 2016, Bordeaux, France, March 15--18, 2016. 22:1--22:18."},{"key":"key-10.1145\/3178876.3186014-11","unstructured":"Ivo Meißner. 2017. GraphQL Query Complexity Analysis for graphql-js. https:\/\/github.com\/ivome\/graphql-query-complexity\/. (2017)."},{"key":"key-10.1145\/3178876.3186014-12","doi-asserted-by":"crossref","unstructured":"Reinhard Pichler and Sebastian Skritek. 2013. Tractable counting of the answers to conjunctive queries. J. Comput. Syst. Sci. Vol. 79, 6 (2013), 984--1001.","DOI":"10.1016\/j.jcss.2013.01.012"},{"key":"key-10.1145\/3178876.3186014-13","unstructured":"Leonard Richardson, Mike Amundsen, and Sam Ruby. 2013. RESTful Web APIs. O'Reilly Media, Inc."},{"key":"key-10.1145\/3178876.3186014-14","unstructured":"Luc Segoufin. 2013. Enumerating with constant delay the answers to a query Joint 2013 EDBT\/ICDT Conferences, ICDT '13 Proceedings, Genoa, Italy, March 18--22, 2013. 10--20."},{"key":"key-10.1145\/3178876.3186014-15","unstructured":"Luc Segoufin and Alexandre Vigny. 2017. Constant Delay Enumeration for FO Queries over Databases with Local Bounded Expansion 20th International Conference on Database Theory, ICDT 2017, March 21--24, 2017, Venice, Italy. 20:1--20:16."},{"key":"key-10.1145\/3178876.3186014-16","unstructured":"Stem Disintermedia, Inc.. 2016. Join Monster. https:\/\/github.com\/stems\/join-monster. (2016)."},{"key":"key-10.1145\/3178876.3186014-17","unstructured":"Stem Disintermedia, Inc.. 2017. GraphQL Depth Limit. https:\/\/github.com\/stems\/graphql-depth-limit\/. (2017)."},{"key":"key-10.1145\/3178876.3186014-18","unstructured":"Moshe Y. Vardi. 1982. The Complexity of Relational Query Languages (Extended Abstract) Proceedings of the 14th Annual ACM Symposium on Theory of Computing, May 5--7, 1982, San Francisco, California, USA. 137--146."},{"key":"key-10.1145\/3178876.3186014-19","unstructured":"Mihalis Yannakakis. 1981. Algorithms for Acyclic Database Schemes. In Very Large Data Bases, 7th International Conference, September 9--11, 1981, Cannes, France, Proceedings. 82--94."}],"event":{"name":"the 2018 World Wide Web Conference","location":"Lyon, France","acronym":"WWW '18","number":"2018","sponsor":["SIGWEB, ACM Special Interest Group on Hypertext, Hypermedia, and Web","IW3C2, International World Wide Web Conference Committee"],"start":{"date-parts":[[2018,4,23]]},"end":{"date-parts":[[2018,4,27]]}},"container-title":["Proceedings of the 2018 World Wide Web Conference on World Wide Web  - WWW '18"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3178876.3186014","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3186014&ftid=1957382&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:26:59Z","timestamp":1750213619000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3178876.3186014"}},"subtitle":[],"proceedings-subject":"World Wide Web","short-title":[],"issued":{"date-parts":[[2018]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1145\/3178876.3186014","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}