{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,3]],"date-time":"2026-10-03T08:29:26Z","timestamp":1791016166991,"version":"4.1.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1994,5,1]],"date-time":"1994-05-01T00:00:00Z","timestamp":767750400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[1994,5]]},"DOI":"10.1007\/bf00872109","type":"journal-article","created":{"date-parts":[[2004,12,27]],"date-time":"2004-12-27T14:10:02Z","timestamp":1104156602000},"page":"205-218","source":"Crossref","is-referenced-by-count":3,"title":["An efficient database transitive closure algorithm"],"prefix":"10.1007","volume":"4","author":[{"given":"I. H.","family":"Toroslu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G. Z.","family":"Qadah","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"L.","family":"Henschen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"R. Agrawal and H. V. Jagadish, ?Hybrid transitive closure algorithms,? inProc. 16th VLDB Conf., Brisbane, Australia, 1990, pp. 326?334."},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"R. Agrawal and H. V. Jagadish, ?Multiprocessor transitive closure algorithms,? inProc. Int. Symp. Databases in Parallel and Distributed Syst., Austin, TX, 1988, pp. 56?66.","DOI":"10.1109\/DPDS.1988.675002"},{"key":"CR3","unstructured":"R. Agrawal and H. V. Jagadish, ?Direct algorithms for the transitive closure of database relations,? inProc. 13th Int. Conf. Very Large Databases, San Francisco, CA, September 1987, pp. 255?266."},{"key":"CR4","series-title":"Technical Report","volume-title":"Proc. Islamorada Workshop on Large Scale Knowledge Base and Reasoning Systems","author":"F. Banchilon","year":"1985","unstructured":"F. Banchilon, ?Naive evaluations of recurively defined relations,? inProc. Islamorada Workshop on Large Scale Knowledge Base and Reasoning Systems Technical Report DB-004-85, MCC, Austin, TX, February 1985."},{"key":"CR5","unstructured":"F. Bancilhon and R. Ramakrishnan, ?An amateur's introduction to recursive query processing strategies,? inProc. 1986 ACM-SIGMOD Conf., Washington, DC, 1986, pp. 16?52."},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"J. Biskup and H. Stiefeling, ?Transitive closure algorithms for very large databases,? inWorkshop on Graph Theoretical Concepts in Computer Sci., Amsterdam, June 1988.","DOI":"10.1007\/3-540-50728-0_39"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"S. Dar and H. V. Jagadish, ?A spanning tree transitive closure algorithm,?Proc. Eighth Data Eng., pp. 2?11, 1992.","DOI":"10.1109\/ICDE.1992.213213"},{"key":"CR8","unstructured":"J. Han, G. Qadah, and C. Chaou, ?The processing of the transitive closure queries,? inProc. 1988 Int. Conf. Extending Database Technol., Venice, Italy, 1988, pp. 48?75."},{"key":"CR9","unstructured":"Y. E. Ioannidis, ?On the computation of the transitive closure of relational operators,? inProc. 12th Int. Conf. VLDB, Kyoto, Japan, 1986, pp. 403?411."},{"key":"CR10","unstructured":"Y. E. Ioannidis and R. Ramakrishnan, ?Efficient transitive closure algorithms,? inProc. 14th VLDB Conf., Long Beach, CA, 1988, pp. 382?394."},{"issue":"3","key":"CR11","first-page":"296","volume":"17","author":"G. Z. Qadah","year":"1991","unstructured":"G. Z. Qadah, L. Henschen, and J. Kim, ?Efficient algorithms for the instantiated transitive closure queries,?IEEE TSE vol. 17, no. 3, pp. 296?309, March 1991.","journal-title":"IEEE TSE"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0169-023X(92)90005-V","volume":"8","author":"G. Z. Qadah","year":"1992","unstructured":"G. Z. Qadah and J. Kim, ?The processing of instantiated transitive-closure queries on uniprocessor and shared-nothing multiprocessor systems,?J. Data Knowledge Eng. vol. 8, pp. 57?89, August 1992.","journal-title":"J. Data Knowledge Eng."},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"I. H. Toroslu and G. Z. Qadah, ?New transitive closure algorithm for recursive query processing in deductive databases,? inProc. Fourth Int. Conf. Tools with AI, Washington, DC, 1992, pp. 268?275.","DOI":"10.1109\/TAI.1992.246414"},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"I. H. Toroslu and G. Z. Qadah, ?The efficient computation of strong partial transitive closures,? inProc. Ninth Data Eng., Vienna, Austria, pp. 530?537, 1993.","DOI":"10.1109\/ICDE.1993.344027"},{"key":"CR15","unstructured":"I. H. Toroslu and L. Henchen, ?An efficient transitive closure algorithm for distributed databases,? inFifth Int. Conf. Comput. Inf., Sudbory, Canada, 1993."},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"J. D. Ullman and M. Yannakakis, ?The input\/output complexity of transitive closure,? inProc. ACM-SIGMOD Int. Conf. Management of Data, Atlantic City, NJ, 1990, pp. 44?53.","DOI":"10.1145\/93605.93620"},{"key":"CR17","unstructured":"P. Valduriez and H. Boral, ?Evaluation of recursive queries using join indices,? inProc. 1st Int. Expert Database Syst. Conf., Charleston, SC, April 1986, pp. 197?208."},{"issue":"1","key":"CR18","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01379321","volume":"17","author":"P. Valduriez","year":"1988","unstructured":"P. Valduriez and S. Khoshafian, ?Parallel evaluation of the transitive closure of a database relation,?Int. J. Parallel Programming vol. 17, no. 1, pp. 19?37, February 1988.","journal-title":"Int. J. Parallel Programming"},{"issue":"2","key":"CR19","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/356924.356929","volume":"16","author":"H. Gallaire","year":"1984","unstructured":"H. Gallaire, J. Minker, and J. Nicolas, ?Logic and databases: A deductive approach,?Comput. Surv. vol. 16, no. 2, pp. 153?185, June 1984.","journal-title":"Comput. Surv."},{"issue":"4","key":"CR20","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1145\/360715.360746","volume":"18","author":"H. S. Warren","year":"1975","unstructured":"H. S. Warren, ?A modification of Warshall's algorithm for the transitive closure of binary relation,?CACM vol. 18, no. 4, pp. 218?220, April 1975.","journal-title":"CACM"},{"issue":"1","key":"CR21","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/321105.321107","volume":"9","author":"S. Warshall","year":"1962","unstructured":"S. Warshall, ?A theorem on Boolean matrices,?J. ACM vol. 9, no. 1, pp. 11?12, January 1962.","journal-title":"J. ACM"},{"issue":"5","key":"CR22","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0020-0190(81)90026-0","volume":"12","author":"J. Ebert","year":"1981","unstructured":"J. Ebert, ?A sensitive transitive closure algorithm,?Inf. Process. Lett. vol. 12, no. 5, pp. 255?258, 1981.","journal-title":"Inf. Process. Lett."},{"key":"CR23","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF00271339","volume":"8","author":"J. Eve","year":"1977","unstructured":"J. Eve and R. Kurki-Suonia, ?On computing the transitive closure of a relation,?Acta Inf. vol. 8, pp. 303?314, 1977.","journal-title":"Acta Inf."},{"key":"CR24","doi-asserted-by":"crossref","unstructured":"R. Tarjan, ?Depth-first search and linear graph algorithms,?SIAM J. Comput., no. 1, pp. 146?160, 1972.","DOI":"10.1137\/0201010"},{"key":"CR25","doi-asserted-by":"crossref","unstructured":"D. J. DeWitt et al., ?Implementation techniques for main memory database systems,? inProc. Third ACM-SIGMOD, Waterloo, Ontario, Canada, pp. 1?8, 1984.","DOI":"10.1145\/971697.602261"},{"issue":"3","key":"CR26","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1145\/6314.6315","volume":"11","author":"L. D. Shapiro","year":"1986","unstructured":"L. D. Shapiro, ?Join processing in database systems with large main memories,?ACM TODS vol. 11, no. 3, pp. 239?264, September 1986.","journal-title":"ACM TODS"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00872109.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00872109\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00872109","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,21]],"date-time":"2024-12-21T19:14:06Z","timestamp":1734808446000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00872109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,5]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,5]]}},"alternative-id":["BF00872109"],"URL":"https:\/\/doi.org\/10.1007\/bf00872109","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,5]]}}}