{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T07:34:14Z","timestamp":1648884854107},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1992,8,1]],"date-time":"1992-08-01T00:00:00Z","timestamp":712627200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[1992,8]]},"DOI":"10.1007\/bf01421676","type":"journal-article","created":{"date-parts":[[2005,4,11]],"date-time":"2005-04-11T23:49:57Z","timestamp":1113263397000},"page":"269-302","source":"Crossref","is-referenced-by-count":2,"title":["Parallel processing of graph reachability in databases"],"prefix":"10.1007","volume":"21","author":[{"given":"Ouri","family":"Wolfson","sequence":"first","affiliation":[]},{"given":"Weining","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Harish","family":"Butani","sequence":"additional","affiliation":[]},{"given":"Akira","family":"Kawaguchi","sequence":"additional","affiliation":[]},{"given":"Kui","family":"Mok","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","unstructured":"O. Wolfson, Weining Zhang, Harish Butani, Akira Kawaguchi, and Kui Mok, A Methodology for Evaluating Parallel Graph Algorithms and Its Application to Single Source Reachability,Parallel and Distributed Information Systems (1993)."},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"R. Agarawal and H. V. Jagadish, Multiprocessor Transitive Closure Algorithms,Proc. Int'l. Symp. on Databases in Parallel and Distr. Syst. (December 1988).","DOI":"10.1109\/DPDS.1988.675002"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"J. Cheiney and C. De Maindreville, A Parallel Strategy for the Transitive Closure Using Double Hash-based Clustering,Proc. of VLDB Conf. (August 1990).","DOI":"10.1007\/3-540-51324-8_43"},{"key":"CR4","unstructured":"M. Houtsma, P. Apers, and S. Ceri, Distributed Transitive Closure Computation: the Disconnection Set Approach,Proc. of VLDB Conf. (August 1990)."},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"P. Valduriez and S. Khoshafian, Parallel Evaluation of the Transitive Closure of a Database Relation.IJPP,17(1) (February 1988).","DOI":"10.1007\/BF01379321"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"F. Cacace, S. Ceri, and M. Houtsma, A Survey of Parallel Execution Strategies for Transitive Closure and Logic Programs, Manuscript (October 1991).","DOI":"10.1007\/3-540-54132-2_49"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"F. Bancilhon, D. Maier, Y. Sagiv, and J. Ullman, Magic Sets and Other Strange Ways to Implement Logic Programs,Proc. 5th ACM Symp. on PODS, pp. 1?15 (1986).","DOI":"10.1145\/6012.15399"},{"key":"CR8","unstructured":"R. J. Lipton and J. F. Naughton, Estimating the size of generalized transitive closures,Proc. Fifteenth Very Large Data Bases, pp. 165?172 (August 1989)."},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"O. Wolfson and A. Silberschatz, Distributed processing of logic programs,Proc. of ACM Sigmod Conf., Chicago, Illinois, pp. 329?336 (1988).","DOI":"10.1145\/50202.50242"},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"O. Wolfson, Sharing the load of logic program evaluation,Proc. Int'l. Symp. on Databases in Parallel and Distributed Systems (December 1988).","DOI":"10.1109\/DPDS.1988.675001"},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"S. R. Cohen and O. Wolfson, Why a single parallelization strategy is not enough in knowledge bases,Proc. of ACM Symp. on PODS, Philadelphia, Pennsylvania, pp. 200?216 (March 1989).","DOI":"10.1145\/73721.73742"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"G. Dong, On distributed processibility of logic programs by decomposing databases,Proc. of ACM Sigmod Conf., Portland, Oregon, pp. 26?35 (June 1989).","DOI":"10.1145\/66926.66929"},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"S. Ganguly, A. Silberschatz, and S. Tsur, A framework for the parallel processing of datalog queries,Proc. of ACM Sigmod Conf., Atlantic City, New Jersey, pp. 143?152 (May 1990).","DOI":"10.1145\/93597.98724"},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"O. Wolfson and A. Ozeri, A new paradigm for parallel and distributed rule-processing,Proc. of ACM Sigmod Conf., Atlantic City, New Jersey, pp. 133?142 (May 1990).","DOI":"10.1145\/93597.98723"},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"J. Seib and G. Lausen, Parallelizing Datalog programs by generalized pivoting,Proc. of ACM Symp. on PODS, Denver, Colorado, pp. 241?251 (May 1991).","DOI":"10.1145\/113413.113435"},{"key":"CR16","unstructured":"W. Zhang, K. Wang, and S. C. Chau, Data partition: a practical parallel evaluation of Datalog programs,Proc. of the First Int'l Conf. on Parallel and Distributed Information Systems, Miami Beach, Florida, pp. 98?105 (1991)."},{"key":"CR17","unstructured":"S. Stolfo, D. Miranker, and R. Mills, A simple processing scheme to extract and load balance implicit parallelism in the concurrent match of production rules,Proc. of the AFIPS Symp. on Fifth Generation Computing (1985)."},{"key":"CR18","unstructured":"Q. Yang and C. Yu, A Parallel Scheme Using the Divide and Conquer Method,Workshop on Deductive Databases in Conjunction with ILPS'91, San Diego, California. Journal version submitted for publication."},{"key":"CR19","volume-title":"Principles of Database and Knowledge-Base Systems","author":"J. D. Ullman","year":"1989","unstructured":"J. D. Ullman,Principles of Database and Knowledge-Base Systems, Vol. 2, Computer Science Press, Rockville, Maryland (1989)."},{"key":"CR20","volume-title":"Applied Probability and Statistical Methods","author":"G. C. Canavos","year":"1984","unstructured":"G. C. Canavos,Applied Probability and Statistical Methods, Little Brown & Company, Boston (1984)."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579172","volume":"1","author":"M. Ajtai","year":"1981","unstructured":"M. Ajtai, J. Koml\u00f3s, and E. Szemer\u00e9di, The longest path in a random graph,Combinatorica,1:1?12 (1981).","journal-title":"Combinatorica"},{"key":"CR22","doi-asserted-by":"crossref","unstructured":"F. Bancilhon and R. Ramakrishnan, An amateur's introduction to recursive query processing strategies,Proc. of ACM Sigmod Conf., pp. 16?52 (1986).","DOI":"10.1145\/16894.16859"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/B978-0-934613-40-8.50016-6","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"F. Bancilhon","year":"1988","unstructured":"F. Bancilhon and R. Ramakrishnan, Performance evaluation of data intensive logic programs,Foundations of Deductive Databases and Logic Programming, J. Minker (ed.), Morgan Kaufmann, Los Altos, California, pp. 439?517 (1988)."},{"key":"CR24","volume-title":"Random Graphs","author":"B. Bollob\u00e1s","year":"1985","unstructured":"B. Bollob\u00e1s,Random Graphs, Academic Press, London (1985)."},{"key":"CR25","doi-asserted-by":"crossref","unstructured":"S. Ganguly, R. Krishnamurthy, and A. Silberschatz, An analysis technique for transitive closure algorithms: a statistical approach,Proc. IEEE Data Engineering Conference, Kobe, Japan, pp. 728?735 (April 1991).","DOI":"10.1109\/ICDE.1991.131522"},{"key":"CR26","doi-asserted-by":"crossref","unstructured":"J. Han and H. Lu, Some performance results on recursive query processing in relational database systems,Proc. IEEE Data Engineering Conf., Los Angeles, California, pp. 533?541 (1986).","DOI":"10.1109\/ICDE.1986.7266260"},{"issue":"1","key":"CR27","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1002\/rsa.3240010106","volume":"1","author":"R. M. Karp","year":"1990","unstructured":"R. M. Karp, The transitive closure of a random graph,Random Structure and Algorithms,1(1):73?93 (1990).","journal-title":"Random Structure and Algorithms"},{"key":"CR28","doi-asserted-by":"crossref","unstructured":"A. Marchetti-Spaccamela, A. Pelaggi, and D. Sacca, Worstcase complexity analysis of methods for logic query implementation,Proc. ACM Symp. on PODS, San Diego, California, pp. 294?301 (March 1987).","DOI":"10.1145\/28659.28691"},{"key":"CR29","doi-asserted-by":"crossref","unstructured":"S. Seshadri and J. F. Naughton, On the estimated size of recursive Datalog queries,Proc. of ACM Symp. on PODS, Denver, Colorado, pp. 268?279 (1991).","DOI":"10.1145\/113413.113438"},{"key":"CR30","volume-title":"Principles of Database and Knowledge-Base Systems","author":"J. D. Ullman","year":"1988","unstructured":"J. D. Ullman, Principles of Database and Knowledge-Base Systems, Vol. 1, Computer Science Press, Rockville, Maryland (1988)."}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01421676.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01421676\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01421676","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T19:20:24Z","timestamp":1586200824000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01421676"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,8]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,8]]}},"alternative-id":["BF01421676"],"URL":"https:\/\/doi.org\/10.1007\/bf01421676","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,8]]}}}