{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:10:55Z","timestamp":1725455455577},"publisher-location":"Berlin\/Heidelberg","reference-count":12,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540522913"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0022168","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T05:40:43Z","timestamp":1131860443000},"page":"136-152","source":"Crossref","is-referenced-by-count":1,"title":["File access level optimization using page access graph on recursive query evaluation"],"prefix":"10.1007","author":[{"given":"Yuki","family":"Kusumi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shojiro","family":"Nishio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshiharu","family":"Hasegawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","volume-title":"Technical Memorandum, AT&T Bell Laboratories","author":"R. Agrawal","year":"1987","unstructured":"R. Agrawal and H.V. Jagadish, \u201cDirect Transitive Closure Algorithms: Design and Performance Evaluation\u201d, Technical Memorandum, AT&T Bell Laboratories, Murray Hill, New Jersey, 1987."},{"key":"9_CR2","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/978-1-4612-4980-1_17","volume-title":"On Knowledge-base Management Systems","author":"F. Bancilhon","year":"1986","unstructured":"F. Bancilhon, \u201cNaive Evaluation of Recursively Defined Relations\u201d, On Knowledge-base Management Systems (M. Brodie and J. Mylopoulos eds.), Springer-Verlag, New York, 1986, pp.165\u2013178."},{"doi-asserted-by":"crossref","unstructured":"F.Bancilhon, D.Maier, Y.Sagiv and J.Ullman, \u201cMagic Set and Other Strange Ways to Implement Logic Programs\u201d, Proc. 5th ACM SIGMOD-SIGACT Symposium on Principles of Database Systems, Cambridge, Massachusetts, 1986, pp.1\u201315.","key":"9_CR3","DOI":"10.1145\/6012.15399"},{"doi-asserted-by":"crossref","unstructured":"F.Bancilhon and R.Ramakrishnan, \u201cAn Amateur's Introduction to Recursive Query Processing Strategies\u201d, Proc. ACM-SIGMOD Int'l Conf. on Management of Data, Washington D.C., 1986, pp.16\u201352.","key":"9_CR4","DOI":"10.1145\/16894.16859"},{"key":"9_CR5","series-title":"Tech. Rep.","volume-title":"Processing Linear Recursive Database Queries by Level and Cycle Marging","author":"J. Han","year":"1987","unstructured":"J. Han and L.J. Henschen, \u201cProcessing Linear Recursive Database Queries by Level and Cycle Marging\u201d, Tech. Rep. 87-05-DBM-01, North Western Univ., Chicago, 1987."},{"doi-asserted-by":"crossref","unstructured":"J.Han and L.J.Henschen, \u201cHandling Redundancy in the Processing of Database Queries\u201d, Proc. of ACM SIGMOD Int'l Conf. on Management of Data, San Francisco, California, 1987, pp.73\u201381.","key":"9_CR6","DOI":"10.1145\/38713.38727"},{"key":"9_CR7","series-title":"LCCR Tech. Rep.","volume-title":"The Processing and Evaluation of Transitive Closure Queries","author":"J. Han","year":"1988","unstructured":"J. Han, G. Qadah and C. Chaou, \u201cThe Processing and Evaluation of Transitive Closure Queries\u201d, LCCR Tech. Rep. 88-1, Simon Fraser Univ., Canada, 1988."},{"issue":"1","key":"9_CR8","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/2422.2423","volume":"31","author":"L.J. Henschen","year":"1984","unstructured":"L.J. Henschen and S. Naqvi, \u201cOn Compiling Queries in Recursive First-Order Databases\u201d, J.ACM, 31(1), 1984, pp.47\u201385.","journal-title":"J.ACM"},{"unstructured":"Y.E. Ioannidis and R. Ramakrishnan, \u201cEfficient Transitive Closure Algorithms\u201d, Proc. 14th Int'l Conf. Very Large Data Bases, Los Angels, California, 1988, pp. 382\u2013394.","key":"9_CR9"},{"unstructured":"H. Lu, \u201cNew Strategies for Computing the Transitive Closure of Database Relation\u201d, Proc. 13th Int'l Conf. on Very Large Data Bases, Brighton, England, 1987, pp.255\u2013266.","key":"9_CR10"},{"unstructured":"P.Valduriez and H.Boral, \u201cEvaluation of Recursive Queries Using Join Indices\u201d, Proc. the 1st Int'l Conf. on Expert Database Systems, Charleston, South Carolina, 1986, pp.197\u2013208.","key":"9_CR11"},{"issue":"2","key":"9_CR12","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1145\/22952.22955","volume":"12","author":"P. Valduriez","year":"1987","unstructured":"P. Valduriez, \u201cJoin Indices\u201d, ACM Transactions on Database Systems, 12(2), 1987, pp.218\u2013246.","journal-title":"ACM Transactions on Database Systems"}],"container-title":["Lecture Notes in Computer Science","Advances in Database Technology \u2014 EDBT '90"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022168.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:47:47Z","timestamp":1607550467000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022168"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540522913"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0022168","relation":{},"subject":[]}}