{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T01:13:16Z","timestamp":1778807596492,"version":"3.51.4"},"reference-count":31,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3827,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s0304-3975(02)00736-3","type":"journal-article","created":{"date-parts":[[2003,3,4]],"date-time":"2003-03-04T17:20:43Z","timestamp":1046798443000},"page":"379-404","source":"Crossref","is-referenced-by-count":37,"title":["Expressive power of SQL"],"prefix":"10.1016","volume":"296","author":[{"given":"Leonid","family":"Libkin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00736-3_BIB1","series-title":"Foundations of Databases","author":"Abiteboul","year":"1995"},{"key":"10.1016\/S0304-3975(02)00736-3_BIB2","series-title":"Principles of Programming Languages","first-page":"110","article-title":"Universality of data retrieval languages","author":"Aho","year":"1979"},{"key":"10.1016\/S0304-3975(02)00736-3_BIB3","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0022-0000(90)90022-D","article-title":"On uniformity within NC1","volume":"41","author":"Barrington","year":"1990","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(02)00736-3_BIB4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(95)00024-Q","article-title":"Principles of programming with complex objects and collection types","volume":"149","author":"Buneman","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00736-3_BIB5","series-title":"SQL for Smarties: Advanced SQL Programming","author":"Celko","year":"2000"},{"key":"10.1016\/S0304-3975(02)00736-3_BIB6","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(93)90221-E","article-title":"Low complexity aggregation in GraphLog and Datalog","volume":"116","author":"Consens","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00736-3_BIB7","series-title":"A Guide to the SQL Standard","author":"Date","year":"1997"},{"key":"10.1016\/S0304-3975(02)00736-3_BIB8","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0304-3975(99)00223-6","article-title":"Local properties of query languages","volume":"239","author":"Dong","year":"2000","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00736-3_BIB9","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1145\/343369.343386","article-title":"Locality of order-invariant first-order formulas","volume":"1","author":"Grohe","year":"2000","journal-title":"ACM Trans. Comput. Logic"},{"key":"10.1016\/S0304-3975(02)00736-3_BIB10","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1006\/jcss.1997.1485","article-title":"Counting quantifiers, successor relations, and logarithmic space","volume":"54","author":"Etessami","year":"1997","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(02)00736-3_BIB11","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1006\/inco.1995.1100","article-title":"On monadic NP vs monadic co-NP","volume":"120","author":"Fagin","year":"1995","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(02)00736-3_BIB12","unstructured":"S. Finkelstein, N. Mattos, I.S. Mumick, H. Pirahesh, Expressing recursive queries in SQL, ANSI Document X3H2-96-075r1, 1996."},{"key":"10.1016\/S0304-3975(02)00736-3_BIB13","series-title":"On local and non-local properties, Proc. Herbrand Symp., Logic Colloquium \u201981","author":"Gaifman","year":"1982"},{"key":"10.1016\/S0304-3975(02)00736-3_BIB14","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1006\/inco.1997.2675","article-title":"Metafinite model theory","volume":"140","author":"Gr\u00e4del","year":"1998","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(02)00736-3_BIB15","series-title":"The Theory of Models","first-page":"132","article-title":"Model-theoretic methods in the study of elementary logic","author":"Hanf","year":"1965"},{"key":"10.1016\/S0304-3975(02)00736-3_BIB16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1996.0070","article-title":"Logical hierarchies in PTIME","volume":"129","author":"Hella","year":"1996","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(02)00736-3_BIB17","doi-asserted-by":"crossref","first-page":"1751","DOI":"10.2307\/2586810","article-title":"Notions of locality and their logical characterizations over finite models","volume":"64","author":"Hella","year":"1999","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0304-3975(02)00736-3_BIB18","doi-asserted-by":"crossref","first-page":"880","DOI":"10.1145\/502090.502100","article-title":"Logics with aggregate operators","volume":"48","author":"Hella","year":"2001","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(02)00736-3_BIB19","series-title":"Descriptive Complexity","author":"Immerman","year":"1998"},{"key":"10.1016\/S0304-3975(02)00736-3_BIB20","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1145\/322326.322332","article-title":"Equivalence of relational algebra and relational calculus query languages having aggregate functions","volume":"29","author":"Klug","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(02)00736-3_BIB21","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1142\/S0129054199000228","article-title":"On grouping in relational algebra","volume":"10","author":"Larsen","year":"1999","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00736-3_BIB22","series-title":"IEEE Symp. on Logic in Computer Science","first-page":"204","article-title":"On the forms of locality over finite models","author":"Libkin","year":"1997"},{"key":"10.1016\/S0304-3975(02)00736-3_BIB23","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1145\/343369.343376","article-title":"Logics with counting and local properties","volume":"1","author":"Libkin","year":"2000","journal-title":"ACM Trans. Comput. Logic"},{"key":"10.1016\/S0304-3975(02)00736-3_BIB24","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1006\/jcss.1997.1523","article-title":"Query languages for bags and aggregate functions","volume":"55","author":"Libkin","year":"1997","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(02)00736-3_BIB25","first-page":"260","article-title":"On the power of aggregation in relational query languages","volume":"Vol. 1369","author":"Libkin","year":"1997"},{"key":"10.1016\/S0304-3975(02)00736-3_BIB26","series-title":"Database: Principles, Programming, Performance","author":"O'Neil","year":"1994"},{"key":"10.1016\/S0304-3975(02)00736-3_BIB27","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0022-0000(88)90030-X","article-title":"Parallel computation and threshold functions","volume":"36","author":"Parberry","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(02)00736-3_BIB28","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1145\/128765.128768","article-title":"Converting nested algebra expressions into flat algebra expressions","volume":"17","author":"Paredaens","year":"1992","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/S0304-3975(02)00736-3_BIB29","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1006\/jcss.1997.1494","article-title":"Natural proofs","volume":"55","author":"Razborov","year":"1997","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(02)00736-3_BIB30","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1017\/S0960129500001560","article-title":"Comprehending monads","volume":"2","author":"Wadler","year":"1992","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00736-3_BIB31","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1006\/jcss.1996.0037","article-title":"Normal forms and conservative extension properties for query languages over collection types","volume":"52","author":"Wong","year":"1996","journal-title":"J. Comput. System Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502007363?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502007363?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T00:50:01Z","timestamp":1553907001000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502007363"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0304397502007363"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00736-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}