{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T19:54:24Z","timestamp":1672343664497},"reference-count":26,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"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":["Information Systems"],"published-print":{"date-parts":[[1989,1]]},"DOI":"10.1016\/0306-4379(89)90038-0","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T21:31:39Z","timestamp":1060291899000},"page":"93-105","source":"Crossref","is-referenced-by-count":10,"title":["A method for hierarchy processing in relational systems"],"prefix":"10.1016","volume":"14","author":[{"given":"Paolo","family":"Ciaccia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dario","family":"Maio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Tiberio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0306-4379(89)90038-0_BIB1","series-title":"Expert Database Systems\u2014Proc. First Int.","year":"1986"},{"key":"10.1016\/0306-4379(89)90038-0_BIB2","series-title":"Expert Database Systems\u2014Proc. First Int. Workshop. Benjamin\/Cummings","year":"1986"},{"key":"10.1016\/0306-4379(89)90038-0_BIB3","article-title":"A summary of user experience with the SQL data sublanguage","author":"Chamberlin","year":"1980"},{"key":"10.1016\/0306-4379(89)90038-0_BIB4","series-title":"Proc. ACM SIGMOD Int. Conf. Mgmt Data","first-page":"16","article-title":"An amateur's introduction to recursive query processing strategies","author":"Bancilhon","year":"1986"},{"key":"10.1016\/0306-4379(89)90038-0_BIB5","article-title":"PROBE: a research project in knowledge-oriented database systems: preliminary analysis","author":"Dayal","year":"1985"},{"issue":"1","key":"10.1016\/0306-4379(89)90038-0_BIB6","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/2422.2423","article-title":"On compiling queries in recursive first-order databases","volume":"31","author":"Henschen","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/0306-4379(89)90038-0_BIB7","series-title":"Expert Database Systems\u2014Proc. First Int. Conf.","first-page":"209","article-title":"An algebraic approach to recursive inference","author":"Ioannidis","year":"1986"},{"key":"10.1016\/0306-4379(89)90038-0_BIB8","article-title":"An algebraic approach to recursive queries in relational databases","author":"Spyratos","year":"1986"},{"key":"10.1016\/0306-4379(89)90038-0_BIB9","series-title":"Expert Database Systems\u2014Proc. First Int. Conf.","first-page":"197","article-title":"Evaluation of recursive queries using join indices","author":"Valduriez","year":"1986"},{"key":"10.1016\/0306-4379(89)90038-0_BIB10","series-title":"Expert Database Systems\u2014Proc. First Int. Workshop","first-page":"3","article-title":"Prolog: a database query language for all seasons","author":"Zaniolo","year":"1986"},{"key":"10.1016\/0306-4379(89)90038-0_BIB11","series-title":"Proc. ACM SIGMOD Int. Conf. Mgmt Data","first-page":"23","article-title":"Access path selection in a relational database system","author":"Selinger","year":"1979"},{"key":"10.1016\/0306-4379(89)90038-0_BIB12","series-title":"Expert Database Systems\u2014Proc. First Int. Workshop","first-page":"3","article-title":"Expert database systems: a database perspective","author":"Smith","year":"1986"},{"key":"10.1016\/0306-4379(89)90038-0_BIB13","series-title":"Proc. ACM SIGMOD Int. Conf. Mgmt Data","first-page":"356","article-title":"A DBMS prototype to support extended NF2 relations: an integrated view on flat tables and hierarchies","author":"Dadam","year":"1986"},{"key":"10.1016\/0306-4379(89)90038-0_BIB14","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0306-4379(89)90038-0_BIB15","series-title":"G\u00f6del's Proof","author":"Nagel","year":"1958"},{"key":"10.1016\/0306-4379(89)90038-0_BIB16","series-title":"Continued Fractions. New Mathematical Library","author":"Olds","year":"1963"},{"key":"10.1016\/0306-4379(89)90038-0_BIB17","series-title":"Die Lehre von den Kettenbruchen","author":"Perron","year":"1929"},{"key":"10.1016\/0306-4379(89)90038-0_BIB18","series-title":"Analytic Theory of Continued Fractions","author":"Wall","year":"1948"},{"issue":"2","key":"10.1016\/0306-4379(89)90038-0_BIB19","doi-asserted-by":"crossref","DOI":"10.1145\/356770.356776","article-title":"The ubiquitous B-tree","volume":"11","author":"Comer","year":"1979","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"10.1016\/0306-4379(89)90038-0_BIB20","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1145\/3857.3863","article-title":"Estimating the cost of updates in relational databases","volume":"10","author":"Schkolnick","year":"1985","journal-title":"ACM TODS"},{"key":"10.1016\/0306-4379(89)90038-0_BIB21","series-title":"Data Base Design","author":"Wiederhold","year":"1983"},{"issue":"5","key":"10.1016\/0306-4379(89)90038-0_BIB22","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1145\/360762.360766","article-title":"Analysis and performance of inverted database structures","volume":"18","author":"Cardenas","year":"1975","journal-title":"Commun. ACM"},{"issue":"3","key":"10.1016\/0306-4379(89)90038-0_BIB23","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0020-0190(84)90096-6","article-title":"On estimating access costs in relational databases","volume":"19","author":"Maio","year":"1984","journal-title":"Inform. Process. Lett."},{"issue":"11","key":"10.1016\/0306-4379(89)90038-0_BIB24","doi-asserted-by":"crossref","first-page":"940","DOI":"10.1145\/182.358452","article-title":"Estimating block accesses in database organizations\u2014a closed noniterative formula","volume":"26","author":"Whang","year":"1983","journal-title":"Commun. ACM"},{"issue":"4","key":"10.1016\/0306-4379(89)90038-0_BIB25","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1145\/359461.359475","article-title":"Approximating block accesses in database organizations","volume":"20","author":"Yao","year":"1977","journal-title":"Commun. ACM"},{"key":"10.1016\/0306-4379(89)90038-0_BIB26","article-title":"A recursive query processing method based on hierarchy encoding via simple continued fractions","author":"Ciaccia","year":"1986"}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306437989900380?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306437989900380?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T00:53:58Z","timestamp":1552611238000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0306437989900380"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,1]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,1]]}},"alternative-id":["0306437989900380"],"URL":"https:\/\/doi.org\/10.1016\/0306-4379(89)90038-0","relation":{},"ISSN":["0306-4379"],"issn-type":[{"value":"0306-4379","type":"print"}],"subject":[],"published":{"date-parts":[[1989,1]]}}}