{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:18Z","timestamp":1725663678194},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540535041"},{"type":"electronic","value":"9783540466772"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-53504-7_74","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:07:05Z","timestamp":1330207625000},"page":"174-183","source":"Crossref","is-referenced-by-count":2,"title":["Computing the transitive closure of symmetric matrices"],"prefix":"10.1007","author":[{"given":"Anestis A.","family":"Toptsis","sequence":"first","affiliation":[]},{"given":"Clement T.","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Peter C.","family":"Nelson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"19_CR1","first-page":"1209","volume":"11","author":"V. L. Arlazarov","year":"1970","unstructured":"Arlazarov, V. L., Dinic, E. A., Kronrod, M. A., and Faradzev, I. A. \u201cOn Economical Construction of the Transitive Closure of an Oriented Graph\u201d, Soviet Math. Doklady 11, 1970, 1209\u20131210.","journal-title":"Soviet Math. Doklady"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Borgida A., and Jagadish, H., \u201cEfficient management of transitive relationships in large data and knowledge bases\u201d, ACM SIGMOD 1989, 253\u2013262.","DOI":"10.1145\/67544.66950"},{"key":"19_CR3","unstructured":"Agrawal, R. and Jagadish, H.V. \u201cDirect Algorithms For Computing the transitive closure Of Database Relations\u201d, Proc. 13-th VLDB, Brighton, England, Sept. 1987."},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Baker, J.J. \u201cA note on Multiplying Boolean Matrices\u201d, CACM, 1962, 102.","DOI":"10.1145\/366792.366825"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Bancilhon, F. \u201cNaive Evaluation of Recursively Defined Relations\u201d, On Knowledge Based Management Systems \u2014 Integrating Database and AI Systems, M. Brodie and J. Mylopoulos, eds., Springer-Verlag, 1985.","DOI":"10.1007\/978-1-4612-4980-1_17"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Bancilhon, F. and Ramakrishnan, R. \u201cAn Amateur's Introduction to Recursive Query Processing Strategies\u201d ACM SIGMOD 1986, 16\u201352.","DOI":"10.1145\/16894.16859"},{"key":"19_CR7","unstructured":"Ioannidis, Y.E.. \u201cOn the Computation of the transitive closure of Relational Operators\u201d, Proc. 12-th VLDB, Kyoto, Japan, 1986, 403\u2013411."},{"key":"19_CR8","unstructured":"Ioannidis, Y.E. and Ramakrishnan, R., \u201cEfficient Transitive Closure of Relational Operators\u201d, Proc. 14-th VLDB, Los Angeles, California, 1988, 382\u2013394."},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Jagadish, H.V., Agrawal, R., and Ness, L. \u201cA Study of transitive closure as a Recursion Mechanism\u201d, ACM SIGMOD 1987, 331\u2013344.","DOI":"10.1145\/38713.38750"},{"key":"19_CR10","unstructured":"Lu, H., \u201cNew Strategies for Computing the Transitive Closure of a Database Relation\u201d, Proc. 13-th VLDB, Brighton, England, 1987, 267\u2013247."},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Lu, H., Mikkilineni, K., and Richrardson, J.P. \u201cDesign and Evaluation of Algorithms to Compute the transitive closure of a Database Relation\u201d Proc. IEEE 3-rd Inter. Conf. Data Engineering, Los Angeles, Feb. 1987, 112\u2013119.","DOI":"10.1109\/ICDE.1987.7272364"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Naughton, J.F., Ramakrishnan, R., Sagiv, Y., and Ullman, J.D., \u201cEfficient evaluation of right-, left-, and multilinear rules\u201d, ACM SIGMOD 1989, 235\u2013242.","DOI":"10.1145\/66926.66948"},{"key":"19_CR13","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF02242140","volume":"30","author":"L. Schmitz","year":"1983","unstructured":"Schmitz, L., \u201cAn Improved Transitive Closure Algorithm\u201d, Computing 30, 1983, 359\u2013371.","journal-title":"Computing"},{"key":"19_CR14","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1137\/0207011","volume":"7","author":"C.P. Schnorr","year":"1978","unstructured":"Schnorr, C.P. \u201cAn Algorithm for transitive closure with Linear Expected Time\u201d, SIAM J. Computing 7, 1978, 127\u2013133.","journal-title":"SIAM J. Computing"},{"key":"19_CR15","unstructured":"Valduriez, P. and Boral, H. \u201cEvaluation of Recursive Queries Using Join Indices\u201d Proc. 1-st Inter. Conf. on Expert Database Systems, Charleston, 1986, 197\u2013208."},{"key":"19_CR16","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1145\/360715.360746","volume":"18","author":"H. Warren Jr.","year":"1975","unstructured":"Warren, H., Jr. \u201cA Modification of Warshall's Algorithm for the transitive closure of Binary Relations\u201d. CACM 18, 1975, 218\u2013220.","journal-title":"CACM"},{"key":"19_CR17","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/321105.321107","volume":"9","author":"W. S","year":"1962","unstructured":"Warshall, S., \u201cA Theorem on Boolean Matrices\u201d, Journal of the ACM 9, 1962, 11\u201312.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Advances in Computing and Information \u2014 ICCI '90"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53504-7_74.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:50:26Z","timestamp":1605646226000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53504-7_74"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540535041","9783540466772"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-53504-7_74","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}