{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:05:16Z","timestamp":1725663916191},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540540090"},{"type":"electronic","value":"9783540473480"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54009-1_11","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:21:20Z","timestamp":1330190480000},"page":"146-159","source":"Crossref","is-referenced-by-count":0,"title":["A direct algorithm for computing the transitive closure of a two-dimensionally structured file"],"prefix":"10.1007","author":[{"given":"Stephen","family":"Taylor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nabil I.","family":"Hachem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"11_CR1","unstructured":"R. Agrawal, S. Dar, & H.V. Jagadish, \u201cComposition of Database Relations\u201d Data Engineering '89."},{"key":"11_CR2","unstructured":"R. Agrawal & H.V. Jagadish, \u201cDirect Algorithms for Computing the Transitive Closure of Database Relations\u201d VLDB '87."},{"key":"11_CR3","unstructured":"R. Agrawal and H.V. Jagadish, \u201cHybrid Transitive Closure Algorithms\u201d VLDB '90."},{"key":"11_CR4","unstructured":"R. Agrawal, \u201cAlpha: An extension of Relational Algebra to Express a Class of Recursive Queries\u201d Data Engineering '87"},{"key":"11_CR5","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"A. V. Aho, J. E. Hopcroft, & J. D. Ullman, \u201cThe Design and Analysis of Computer Algorithms\u201d, Addison-Wesley, Reading, MA, 1974."},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Bancilhon F, and Ramakrishna R., \u201cAn Amateur Introduction to Recursive Query Processing,\u201d ACM SIGMOD'86, Washington D.C, May 1986, pp 16\u201352.","DOI":"10.1145\/16856.16859"},{"issue":"1","key":"11_CR7","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1109\/69.43410","volume":"1","author":"S. Ceri","year":"1989","unstructured":"S. Ceri, G. Gottlob, L. Tanca, \u201cWhat You Always Wanted to Know About Datalog (And Never Dared To Ask),\u201d IEEE Transactions on Knowledge and Data Engineering, Vol. 1, No. 1, March 1989, pp 146\u2013166.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"J.P Cheiney & C. de Maindreville, \u201cA Parallel Transitive Closure Algorithm using hashs-based clustering\u201d Proceedings of the 6th Int. Conf. Database Machines, in Lecture Notes in Computer Science, Nb. 368, Springer-Verlag, June, 1989.","DOI":"10.1007\/3-540-51324-8_43"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"D. Coppersmith & S. Winograd, \u201cMatrix Multiplication via Arithmetic Progressions\u201d Proc. Nineteenth Annual ACM Symposium on the Theory of Computing, pp 1\u20136, 1987.","DOI":"10.1145\/28395.28396"},{"key":"11_CR10","unstructured":"Nabil Hachem, \u201cImplementation of an Efficient Transitive Closure Operation for Main Memory (Very Large) Deductive Databases\u201d, WPI Computer Science Technical Report WPI-CS TR-90-13, May, 1990, pp 17."},{"key":"11_CR11","unstructured":"J. Han, G. Qadeh, & C. Chaou, \u201cThe Processing and Evaluation of Transitive Closure Queries\u201d EDBT '88."},{"key":"11_CR12","unstructured":"Y. E. Ioannidis, \u201cOn the Computation of the Transitive Closure of Relational Operators\u201d VLDB '86."},{"key":"11_CR13","unstructured":"Y. E. Ioannidis & R. Ramakrishnan, \u201cEfficient Transitive Closure Algorithms\u201d VLDB '88."},{"issue":"3","key":"11_CR14","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1145\/38714.38750","volume":"16","author":"H.V. Jagadish","year":"1987","unstructured":"H.V. Jagadish, R. Agrawal, & L. Ness \u201cA Study of Transitive Closure as a Recursion mechanism\u201d SIGMOD Record 16,#3, December 1987, pp 331\u2013344.","journal-title":"SIGMOD Record"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"S.C. Kleene, \u201cRepresentation of Events in Nerve Nets and Finite Automata,\u201d in Automata Studies, C.E. Shannon and J. McCarthy, eds., Princeton Univ. Press, 1956, pp 3\u201340.","DOI":"10.1515\/9781400882618-002"},{"key":"11_CR16","unstructured":"H. Lu, \u201cNew Strategies for Computing the Transitive Closure of a Database Relation\u201d VLDB '87."},{"key":"11_CR17","volume-title":"Database and Knowledge-base Systems Vol II","author":"J. D. Ullman","year":"1989","unstructured":"J. D. Ullman, \u201cDatabase and Knowledge-base Systems Vol II\u201d, Computer Science Press, Rockville, MD 1989."},{"key":"11_CR18","unstructured":"J. D. Ullman & M. Yannakakis, \u201cThe Input\/Output Complexity of Transitive Closure\u201d SIGMOD '90."},{"key":"11_CR19","unstructured":"P. Valduriez and H. Boral, \u201dEvaluation of Recursive Queries Using Join Indices,\u201d Proceedings of the First International Conference on Expert Databases, April 1986, pp 197\u2013208."},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Henry S. Warren, \u201cA Modification of Warshall's Algorithm for the Transitive Closure of Binary Relations\u201d CACM April 1975 p 218\u2013220","DOI":"10.1145\/360715.360746"},{"issue":"1","key":"11_CR21","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/321105.321107","volume":"9","author":"S. Warshall","year":"1962","unstructured":"Stephen Warshall, \u201cA Theorem on Boolean Matrices\u201d J. ACM 9, 1 January 1962, pp 11\u201312.","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","MFDBS 91"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54009-1_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:51:55Z","timestamp":1605628315000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54009-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540540090","9783540473480"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-54009-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}