{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:22Z","timestamp":1725663382629},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540507284"},{"type":"electronic","value":"9783540460763"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-50728-0_39","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:33:15Z","timestamp":1330201995000},"page":"122-147","source":"Crossref","is-referenced-by-count":5,"title":["Transitive closure algorithms for very large databases"],"prefix":"10.1007","author":[{"given":"Joachim","family":"Biskup","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Holger","family":"Stiefeling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., \"Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries,\" Proc. IEEE 3rd Int. Conf. Data Engineering, Los Angeles, Feb. 1987, pp. 580\u2013590.","DOI":"10.1109\/ICDE.1987.7272427"},{"key":"8_CR2","unstructured":"Agrawal, R., Dar, S., Jagadish, H.V., \"Transitive Closure Algorithms Revisited: The Case of Path Computations,\" Submitted for publication."},{"key":"8_CR3","unstructured":"Agrawal, R., Jagadish, H.V., \"Direct Algorithms for Computing the Transitive Closure of Database Relations,\" Proc. of the 13th VLDB Conf., Brighton 1987, pp. 255\u2013266."},{"key":"8_CR4","unstructured":"Biskup, J., Raesch, U., Stiefeling, H., \"An Extended Relational Query Language for Knowledgebase Support,\" Hildesheimer Informatik-Berichte, 1987, Hochschule Hildesheim."},{"key":"8_CR5","unstructured":"Biskup, J., Raesch, U., Stiefeling, H., \"Report on Structure and Complexity of Several Augmented Relational Algebras,\" ESPRIT Project 311: ADKMS, Deliverable D12."},{"key":"8_CR6","unstructured":"Biskup, J., Raesch, U., Stiefeling, H., \"Survey on Algorithms for Computing the Transitive Closure and Related Operators,\" ESPRIT Project 311: ADKMS, Deliverable D13."},{"key":"8_CR7","unstructured":"Bloniarz, P.A., Fischer, M.J., Meyer, A.R., \"A Note on the Average Time to Compute the Transitive Closure,\" Proc. of the Int. Colloquium on Automata, Languages and Programming, 1976, pp. 425\u2013434."},{"issue":"2","key":"8_CR8","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D. Comer","year":"1979","unstructured":"Comer, D., \"The Ubiquitous B-Tree,\" ACM Computing Surveys 11, 2, 1979, pp. 121\u2013138.","journal-title":"ACM Computing Surveys"},{"key":"8_CR9","unstructured":"Dayal, U. et al, \"PROBE \u2014 a Research Project in Knowledge-Oriented Database Systems: Preliminary Analysis,\" Technical Report CCA-85-03, 1985, Computer Corporation of America."},{"issue":"3","key":"8_CR10","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/320083.320092","volume":"4","author":"R. Fagin","year":"1979","unstructured":"Fagin, R. et al, \"Extendible Hashing \u2014 A Fast Access Method for Dynamic Files,\" ACM Transactions on Database Systems 4, 3, 1979, pp. 315\u2013344.","journal-title":"ACM Transactions on Database Systems"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Goralcikova, A., Koubek, V., \"A Reduct-and-Closure Algorithm for Graphs,\" Proc. Mathematical Foundations of Computer Science, 1979, pp. 301\u2013307.","DOI":"10.1007\/3-540-09526-8_27"},{"key":"8_CR12","unstructured":"Ioannidis, Y.F., \"On the Computation of the Transitive Closure of Relational Operators,\" Proc. of the 12th VLDB Conf., Kyoto 1986, pp. 403\u2013411."},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Jagadish, H.V., Agrawal, R., Ness, L., \"A Study of Transitive Closure as a Recursion Mechanism,\" Proc. ACM SIGMOD Int. Conf. on Management of Data, San Francisco, May 1987, pp. 331\u2013344.","DOI":"10.1145\/38713.38750"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Kim, W., \"A New Way to Compute the Product and Join of Relations,\" Proc. ACM SIGMOD Int. Conf. on Management of Data, Los Angeles, May 1980, pp. 179\u2013187.","DOI":"10.1145\/582250.582278"},{"key":"8_CR15","unstructured":"Lu, H., \"New Strategies for Computing the Transitive Closure of Database Relations,\" Proc. of the 13th VLDB Conf., Brighton 1987, pp. 267\u2013274."},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Lu, H., Mikkilineni, K., Richardson, J.P., \"Design and Evaluation of Algorithms to Compute the Transitive Closure of a Database Relation,\" Proc. IEEE 3rd Int. Conf. Data Engineering, Los Angeles, Feb. 1987, pp. 112\u2013119.","DOI":"10.1109\/ICDE.1987.7272364"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Rosenthal, A. et al, \"Traversal Recursion: A Practical Approach to Supporting Recursive Applications,\" Proc. ACM SIGMOD Int. Conf. on Management of Data, Washington, May 1986, pp. 166\u2013176.","DOI":"10.1145\/16894.16871"},{"key":"8_CR18","unstructured":"Scalas, M.R., Tiberio, P., \"The Use of the Nested-Block Method for Computing Joins,\" IEEE Int. Computer and Applications Conf. (COMPSAC), November 1983, pp. 455\u2013463."},{"key":"8_CR19","unstructured":"Valduriez, P., Boral, H., \"Evaluation of Recursive Queries Using Join Indices,\" Proc. of the 1st Int. Conf. on Expert Database Systems, pp. 197\u2013208."},{"issue":"4","key":"8_CR20","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1145\/360715.360746","volume":"18","author":"H.S. Warren","year":"1975","unstructured":"Warren, H.S., \"A Modification of Warshall's Algorithm for Transitive Closure of Binary Relations,\" Comm. ACM 18, 4, 1975, pp. 218\u2013220.","journal-title":"Comm. ACM"},{"key":"8_CR21","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/321105.321107","volume":"9","author":"S. Warshall","year":"1962","unstructured":"Warshall, S., \"A Theorem on Boolean Matrices,\" Journal of the ACM 9, 1962, pp. 11\u201312.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50728-0_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:18:45Z","timestamp":1605647925000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50728-0_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540507284","9783540460763"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-50728-0_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}