{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T03:40:08Z","timestamp":1752464408751,"version":"3.41.2"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1997,10,1]],"date-time":"1997-10-01T00:00:00Z","timestamp":875664000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,10,1]],"date-time":"1997-10-01T00:00:00Z","timestamp":875664000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distributed and Parallel Databases"],"published-print":{"date-parts":[[1997,10]]},"DOI":"10.1023\/a:1008688512013","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T10:12:40Z","timestamp":1040551960000},"page":"405-438","source":"Crossref","is-referenced-by-count":1,"title":["A Parallel Scheme Using the Divide-and-Conquer Method"],"prefix":"10.1007","volume":"5","author":[{"given":"Qi","family":"Yang","sequence":"first","affiliation":[]},{"given":"Son","family":"Dao","sequence":"additional","affiliation":[]},{"given":"Clement","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Naphtali","family":"Rishe","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"140026_CR1","doi-asserted-by":"crossref","unstructured":"R. Agrawal and H.V. Jagadish, \"Multiprocessor transitive closure algorithms,\" Proc. Int'l. Symp. on Databases in Parallel and Distributed Systems, Austin, Tex., Dec. 1988, pp. 56\u201366.","DOI":"10.1109\/DPDS.1988.675002"},{"key":"140026_CR2","unstructured":"R. Agrawal and H.V. Jagadish, \"Hybrid transitive closure algorithms,\" Proc. 16th Int'l. Conf. Very Large Data Bases, Brisbane, Australia, Aug. 1990, pp. 326\u2013334."},{"key":"140026_CR3","unstructured":"A.V. Aho, J.E. Hopcropt, and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974."},{"key":"140026_CR4","unstructured":"S. Baase, Computer Algorithms: Introduction to Design and Analysis, 2nd ed., Addison-Wesley, 1988."},{"key":"140026_CR5","doi-asserted-by":"crossref","unstructured":"F. Bancilhon and R. Ramakrishnan, \"An amateur's introduction to recursive query processing strategies,\" Proc. ACM-SIGMOD Intel. Conf. on the Management of Data, 1986.","DOI":"10.1145\/16894.16859"},{"key":"140026_CR6","doi-asserted-by":"crossref","unstructured":"B. Baugst\u00f8 and J. Greipsland, \"Parallel sorting methods for large data on a hypercube database computer,\" Proc. the Sixth Int'l Workshop on Database Machine, pp. 127\u2013141. 1989.","DOI":"10.1007\/3-540-51324-8_32"},{"issue":"7","key":"140026_CR7","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1109\/12.2222","volume":"37","author":"M. Beck","year":"1988","unstructured":"M. Beck, D. Bitton, and W.K. Wilkinson, \"Sorting large files on a backend multiprocessor,\" IEEE Trans. on Computers, vol. 37, no. 7, pp. 769\u2013778, 1988.","journal-title":"IEEE Trans. on Computers"},{"key":"140026_CR8","doi-asserted-by":"crossref","unstructured":"J.L. Bentley and M.I. Shamos, \"Divide-and-conquer for linear expected time,\" Info. Proc. Letts, pp. 87\u201391, Feb. 1978.","DOI":"10.1016\/0020-0190(78)90051-0"},{"key":"140026_CR9","doi-asserted-by":"crossref","unstructured":"D. Bitton, H. Boral, D.J. DeWitt, and W.K. Wilkinson, \"Parallel algorithms for the execution of relational database operations,\" ACM Trans. on Database Systems, vol. 8, no. 3, 1983.","DOI":"10.1145\/319989.319991"},{"key":"140026_CR10","doi-asserted-by":"crossref","unstructured":"G.E. Blelloch, C.E. Leiserson, B.M. Maggs, C.G. Plaxton, S.J. Smith, and M. Zagha, \"A comparison of sorting algorithms for the connection machine CM-2,\" Proc. the 3rd Annual ACM SPAA, 1991.","DOI":"10.1145\/113379.113380"},{"key":"140026_CR11","doi-asserted-by":"crossref","unstructured":"S. Bondeli, \"Divide and conquer: A parallel algorithm for the solution of a tridiagonal linear system of equations,\" Parallel Computing, vol. 17, July 1991.","DOI":"10.1016\/S0167-8191(05)80145-0"},{"key":"140026_CR12","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0165-0114(88)90039-5","volume":"28","author":"P. Bosc","year":"1988","unstructured":"P. Bosc, M. Galibourg, and G. Hamon, \"Fuzzy querying with SQL: Extensions and implementation aspects,\" Fuzzy Sets and Systems, vol. 28, pp. 333\u2013349, 1988.","journal-title":"Fuzzy Sets and Systems"},{"key":"140026_CR13","doi-asserted-by":"crossref","unstructured":"S.S. Cosmadakis and P.C. Kanellakis, \"Parallel evaluation of recursive rule queries,\" Proc. 5th ACM Symp. on Principles of Database Systems, 1986.","DOI":"10.1145\/6012.15421"},{"key":"140026_CR14","doi-asserted-by":"crossref","unstructured":"S. Dar and H.V. Jagadish, \"Aspanning tree transitive closure algorithm,\" Proc. 8th Int'l Conf. Data Engineering, Tempe, Arizona, Feb. 1992, pp. 2\u201311.","DOI":"10.1109\/ICDE.1992.213213"},{"key":"140026_CR15","unstructured":"D. DeWitt, J. Naughton, and D.A. Schneider, \"An evaluation of non-equijoin algorithms,\" VLDB 1991, pp. 443\u2013452."},{"key":"140026_CR16","doi-asserted-by":"crossref","unstructured":"D. DeWitt, J. Naughton, and D.A. Schneider, \"Parallel sorting on a shared-nothing architecture using probabilistic splitting,\" IEEE PDIS, pp. 280\u2013291, 1991.","DOI":"10.1109\/PDIS.1991.183115"},{"key":"140026_CR17","doi-asserted-by":"crossref","unstructured":"D. DeWitt and J. Gray, \"Parallel database systems: The future of high performance database systems,\" CACM, pp. 85\u201398, July 1992.","DOI":"10.1145\/129888.129894"},{"key":"140026_CR18","unstructured":"D. DeWitt, J. Naughton, D.A. Schneider, and S. Seshadri, \"Practical skew handling in parallel joins,\" VLDB, 1992, pp. 27\u201340."},{"issue":"3","key":"140026_CR19","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1145\/321592.321600","volume":"17","author":"W.D. Frazer","year":"1970","unstructured":"W.D. Frazer and A.C. McKellar, \"Samplesort: A sampling approach to minimal storage tree sorting,\" JACM, vol. 17, no. 3, pp. 496\u2013507, July 1970.","journal-title":"JACM"},{"key":"140026_CR20","unstructured":"\"Fuzzy LUNA-Fuzzy database system library user's manual and fuzzy LUNA-fuzzy database system library reference manual,\" OMRON Corporation, 1992."},{"key":"140026_CR21","doi-asserted-by":"crossref","unstructured":"S. Ganguly, A. Silberschatz, and S. Tsur, \"A framework for the parallel processing of datalog queries,\" Proc. ACM SIGMOD Intel. Conf. on the Management of Data, Atlantic City, NJ, 1990.","DOI":"10.1145\/93597.98724"},{"issue":"4","key":"140026_CR22","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1109\/69.149932","volume":"4","author":"K.-C. Guh","year":"1992","unstructured":"K.-C. Guh and C. Yu, \"Efficient management of materialized generalized transitive closure in centralized and parallel environment,\" IEEE Transaction on Knowledge and Data Engineering, vol. 4, no. 4, pp. 371\u2013381, August 1992.","journal-title":"IEEE Transaction on Knowledge and Data Engineering"},{"key":"140026_CR23","doi-asserted-by":"crossref","unstructured":"L.J. Henschen and S.A. Nagvi, \"On compiling queries in recursive first-order databases,\" JACM, vol. 31, no. 1, 1984.","DOI":"10.1145\/2422.2423"},{"key":"140026_CR24","unstructured":"D.E. Knuth, The Art of Computer Programming: Sorting and Searching, Reading, Mass., vol. 3, Addison-Wesley, 1973."},{"key":"140026_CR25","unstructured":"F.T. Leighton, Introduction to Parallel Algorithms and Architectures, Morgan Kaufmann, 1991."},{"key":"140026_CR26","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd, Foundations of Logic Programming, 2nd edition, Springer-Verlag, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"140026_CR27","volume-title":"The Theory of Relational Databases","author":"D. Maier","year":"1983","unstructured":"D. Maier, The Theory of Relational Databases, Computer Science Press: Rockvill, MD, 1983."},{"key":"140026_CR28","unstructured":"S. Nagvi and S. Tsur, A Logical Language for Data and Knowledge Bases, Computer Science Press, 1989."},{"key":"140026_CR29","doi-asserted-by":"crossref","unstructured":"H. Nakajima, T. Sogoh, and M. Arao, \"Fuzzy database language and library: Fuzzy extension to SQL,\" Proc. of the Second IEEE International Conference on Fuzzy Systems, pp. 477\u2013482, 1993.","DOI":"10.1109\/FUZZY.1993.327514"},{"key":"140026_CR30","unstructured":"D.S. Parker, E. Simon, and P. Valduriez, \"SVP-a model capturing sets, streams, and parallelism,\" Proc. 18th VIDB, pp. 115\u2013126, 1992."},{"key":"140026_CR31","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/0167-8191(88)90075-0","volume":"6","author":"M.J. Quinn","year":"1988","unstructured":"M.J. Quinn, \"Parallel sorting algorithms for tightly coupled multiprocessors,\" Parallel Computing, vol. 6, pp. 349\u2013367, 1988.","journal-title":"Parallel Computing"},{"key":"140026_CR32","unstructured":"G. Salton, Automatic Text Processing, Addison Wesley, 1989."},{"key":"140026_CR33","doi-asserted-by":"crossref","unstructured":"B. Salzberg, A. Tsukerman, J. Gray, M. Stewart, S. Uren, and B.Vaughan, \"FastSort: A distributed single-input single-output external sort,\" SIGMOD, pp. 94\u2013101, 1990.","DOI":"10.1145\/93597.98719"},{"key":"140026_CR34","doi-asserted-by":"crossref","unstructured":"D.A. Schneider and D.J. DeWitt, \"A performance evaluation of four parallel algorithms in a shared-nothing multiprocessor environment,\" Proc. ACM SIGMOD, pp. 110\u2013121, 1989.","DOI":"10.1145\/66926.66937"},{"key":"140026_CR35","unstructured":"J. Ullman, Database and Knowledge-Base Systems, Computer Science Press, Inc., 1988."},{"issue":"1","key":"140026_CR36","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1145\/348.318590","volume":"9","author":"P. Valduriez","year":"1984","unstructured":"P. Valduriez and G. Gardarin, \"Join and semijoin algorithms for a multiprocessor database machine,\" ACM TODS, vol. 9, no. 1, pp. 133\u2013161, March 1984.","journal-title":"ACM TODS"},{"key":"140026_CR37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-7315(90)90001-6","volume":"10","author":"B.W. Wah","year":"1990","unstructured":"B.W. Wah and G. Li, \"Optimal parallel evaluation of AND trees,\" Journal of Parallel and Distributed Computing, vol. 10, pp. 1\u201317, 1990.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"140026_CR38","doi-asserted-by":"crossref","unstructured":"O.Wolfson and A. Silberschatz, \"Distributed processing of logic programs,\" Proc. ACM-SIGMOD Intl. Conf. on the Management of Data, 1988.","DOI":"10.1145\/50202.50242"},{"key":"140026_CR39","doi-asserted-by":"crossref","unstructured":"O.Wolfson and A. Ozeri, \"A new paradigm for parallel and distributed rule-processing,\" Proc.ACMSIGMOD Intel. Conf. on the Management of Data, 1990.","DOI":"10.1145\/93597.98723"},{"key":"140026_CR40","doi-asserted-by":"crossref","unstructured":"Q. Yang and C. Yu, \"Parallelization by the divide-and-conquer method,\" IEEE Systems, Man and Cybernetics Conference, Chicago, 1992, pp. 1265\u2013dy1270.","DOI":"10.1109\/ICSMC.1992.271612"},{"key":"140026_CR41","unstructured":"Q. Yang, C. Yu, C. Liu, S. Dao, and T. Pham, \"A hybrid transitive closure algorithm for sequential and parallel processing,\" IEEE Data Engineering, Houston, pp. 348\u2013355, 1994."},{"key":"140026_CR42","doi-asserted-by":"crossref","unstructured":"Q. Yang, C. Liu, J. Wu, C. Yu, S. Dao, and H. Nakajima, \"Efficient processing of nested fuzzy SQL queries,\" IEEE 11th International Conference on Data Engineering, Taiwan, 1995, pp. 131\u2013138.","DOI":"10.1109\/ICDE.1995.380400"},{"key":"140026_CR43","doi-asserted-by":"crossref","unstructured":"L.A. Zadeh, \" Fuzzy logic,\" IEEE Computer, pp. 83\u201393, April, 1988.","DOI":"10.1109\/2.53"},{"key":"140026_CR44","unstructured":"W. Zhang, C.Yu, G. Wang, T. Pham, and H. Nakajima, \"A relational model for imprecise queries,\" International Symposium on Methodologies in Intelligent Systems, Trondheim, Norway, 1993."}],"container-title":["Distributed and Parallel Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008688512013.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008688512013\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008688512013.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T03:00:29Z","timestamp":1752462029000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008688512013"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,10]]},"references-count":44,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1997,10]]}},"alternative-id":["140026"],"URL":"https:\/\/doi.org\/10.1023\/a:1008688512013","relation":{},"ISSN":["0926-8782","1573-7578"],"issn-type":[{"type":"print","value":"0926-8782"},{"type":"electronic","value":"1573-7578"}],"subject":[],"published":{"date-parts":[[1997,10]]}}}