{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T23:50:02Z","timestamp":1673481002062},"reference-count":25,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Languages"],"published-print":{"date-parts":[[1990,1]]},"DOI":"10.1016\/0096-0551(90)90011-d","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T19:04:53Z","timestamp":1060283093000},"page":"65-82","source":"Crossref","is-referenced-by-count":9,"title":["An extension of SQL for querying graph relations"],"prefix":"10.1016","volume":"15","author":[{"given":"Joachim","family":"Biskup","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uwe","family":"R\u00e4sch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Holger","family":"Stiefeling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/0096-0551(90)90011-D_BIB1","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1145\/362384.362685","article-title":"A relational model for large shared data banks","volume":"13","author":"Codd","year":"1970","journal-title":"Commun. ACM"},{"key":"10.1016\/0096-0551(90)90011-D_BIB2","series-title":"Data Base Systems","first-page":"65","article-title":"Relational completeness of data base sublanguages","author":"Codd","year":"1972"},{"key":"10.1016\/0096-0551(90)90011-D_BIB3","series-title":"Proceedings of the 6th ACM Symposium on Principles of Programming Languages","first-page":"110","article-title":"Universality of data retrieval languages","author":"Aho","year":"1979"},{"key":"10.1016\/0096-0551(90)90011-D_BIB4","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0022-0000(80)90032-X","article-title":"Computable queries for relational data bases","volume":"21","author":"Chandra","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0096-0551(90)90011-D_BIB5","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0022-0000(82)90012-5","article-title":"Structure and complexity of relational queries","volume":"25","author":"Chandra","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0096-0551(90)90011-D_BIB6","series-title":"Proceedings of the 1st ACM SIGACT-SIGMOD Symposium on Principles of Database Systems","first-page":"158","article-title":"Horn clauses and the fixpoint hierarchy","author":"Chandra","year":"1982"},{"key":"10.1016\/0096-0551(90)90011-D_BIB7","series-title":"Proceedings of the 14th ACM Symposium on Theory of Computing","first-page":"147","article-title":"Relational queries computable in polynomial time","author":"Immerman","year":"1982"},{"key":"10.1016\/0096-0551(90)90011-D_BIB8","article-title":"Second order and inductive definability on finite structures","author":"Rougement","year":"1983","journal-title":"University of California, Los Angels: Ph.D. dissertation"},{"key":"10.1016\/0096-0551(90)90011-D_BIB9","series-title":"Proceedings of the 14th ACM Symposium on Theory of Computing","first-page":"137","article-title":"The complexity of relational query languages","author":"Vardi","year":"1982"},{"key":"10.1016\/0096-0551(90)90011-D_BIB10","series-title":"Logic and Databases","year":"1977"},{"key":"10.1016\/0096-0551(90)90011-D_BIB11","series-title":"Proceedings of the ACM SIGMOD'86 International Conference on Management of Data","first-page":"16","article-title":"An amateur's introduction to recursive query processing strategies","author":"Bancilhon","year":"1986"},{"key":"10.1016\/0096-0551(90)90011-D_BIB12","series-title":"Technical Annex for ESPRIT-Project 311","article-title":"Advanced data and knowledge management system","author":"Nixdorf Computer Corporation","year":"1984"},{"key":"10.1016\/0096-0551(90)90011-D_BIB13","series-title":"Proceedings of the 5th ESPRIT Conference","first-page":"592","article-title":"Data support for ADKMS","author":"Biskup","year":"1988"},{"key":"10.1016\/0096-0551(90)90011-D_BIB14","series-title":"Proceedings of the 14th Workshop on Graph-Theoretic Concepts in Computer Science","first-page":"122","article-title":"Transitive closure algorithms for very large databases","author":"Biskup","year":"1988"},{"key":"10.1016\/0096-0551(90)90011-D_BIB15","unstructured":"Biskup, J., R\u00e4sch, U. and Stiefeling, H. Report on structure and complexity of several augmented relational algebras. ESPRIT Project 311: ADKMS Deliverable D12."},{"key":"10.1016\/0096-0551(90)90011-D_BIB16","series-title":"American national standard database language SQL: Working draft","author":"ANSI-X3H2","year":"1985"},{"key":"10.1016\/0096-0551(90)90011-D_BIB17","series-title":"Data Structures and Algorithms 2","article-title":"Graph Algorithms and NP-Completeness","author":"Mehlhorn","year":"1984"},{"key":"10.1016\/0096-0551(90)90011-D_BIB18","series-title":"Proceedings of the International Colloquium on Automata, Languages and Programming","first-page":"425","article-title":"A note on the average time to compute transitive closures","author":"Bloniarz","year":"1976"},{"issue":"4","key":"10.1016\/0096-0551(90)90011-D_BIB19","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1145\/360715.360746","article-title":"A modification of Warshall's algorithm for transitive closure of binary relations","volume":"18","author":"Warren","year":"1975","journal-title":"Commun. ACM"},{"key":"10.1016\/0096-0551(90)90011-D_BIB20","series-title":"Proceedings of Mathematical Foundations of Computer Science","first-page":"301","article-title":"A reduct-and-closure algorithm for graphs","author":"Goralcikova","year":"1979"},{"key":"10.1016\/0096-0551(90)90011-D_BIB21","series-title":"Probe, a research project in knowledge-oriented database systems: Preliminary analysis","author":"Dayal","year":"1985"},{"key":"10.1016\/0096-0551(90)90011-D_BIB22","article-title":"Spatial data modeling and query processing in PROBE","author":"Orenstein","year":"1986","journal-title":"Computer Corporation of America: Technical Report CCA-86-05"},{"key":"10.1016\/0096-0551(90)90011-D_BIB23","series-title":"Proceedings of the ACM SIGMOD'86 International Conference on Management of Data","first-page":"166","article-title":"Traversal recursion: A practical approach to supporting recursive applications","author":"Rosenthal","year":"1986"},{"key":"10.1016\/0096-0551(90)90011-D_BIB24","series-title":"3rd International Conference on Data Engineering","first-page":"580","article-title":"Alpha: An extension of relational algebra to express a class of recursive queries","author":"Agrawal","year":"1987"},{"key":"10.1016\/0096-0551(90)90011-D_BIB25","series-title":"Proceedings of the ACM SIGMOD'87 Conference on Management of Data","first-page":"331","article-title":"A study of transitive closure as a recursion mechanism","author":"Jagadish","year":"1987"}],"container-title":["Computer Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009605519090011D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009605519090011D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T03:23:38Z","timestamp":1552620218000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/009605519090011D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,1]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,1]]}},"alternative-id":["009605519090011D"],"URL":"https:\/\/doi.org\/10.1016\/0096-0551(90)90011-d","relation":{},"ISSN":["0096-0551"],"issn-type":[{"value":"0096-0551","type":"print"}],"subject":[],"published":{"date-parts":[[1990,1]]}}}