{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:09:14Z","timestamp":1710335354032},"reference-count":28,"publisher":"Elsevier BV","issue":"1-4","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[1996,7]]},"DOI":"10.1016\/0020-0255(96)00053-9","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T17:32:55Z","timestamp":1053365575000},"page":"109-135","source":"Crossref","is-referenced-by-count":2,"title":["Parallel transitive closure computation in relational databases"],"prefix":"10.1016","volume":"92","author":[{"given":"Xiaofang","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Yanchun","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Maria E.","family":"Orlowska","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0255(96)00053-9_BIB1","series-title":"Proc. 5th Internat. Conf. Data Engng.","first-page":"102","article-title":"Composition of database relations","author":"Agrawal","year":"1989"},{"key":"10.1016\/0020-0255(96)00053-9_BIB2","series-title":"Proc. 13th Internat. Conf. Very Large Data Bases","first-page":"255","article-title":"Direct algorithm for computing the transitive closure of database relations","author":"Agrawal","year":"1987"},{"key":"10.1016\/0020-0255(96)00053-9_BIB3","series-title":"Proc. 16th Internat. Conf. Very Large Data Bases","first-page":"326","article-title":"Hybrid transitive closure algorithms","author":"Agrawal","year":"1990"},{"key":"10.1016\/0020-0255(96)00053-9_BIB4","series-title":"The Design and Analysis of Parallel Algorithms","author":"Akl","year":"1989"},{"key":"10.1016\/0020-0255(96)00053-9_BIB5","series-title":"ACM SIGMOD'86","article-title":"An amateur's introduction to recursive query processing strategies","author":"Bancilhon","year":"1986"},{"key":"10.1016\/0020-0255(96)00053-9_BIB6","series-title":"LNCS 503: Parallel database systems: PRISMA Workshop","first-page":"44","article-title":"An overview of parallel strategies for transitive closure on algebraic machines","author":"Cacace","year":"1990"},{"issue":"1","key":"10.1016\/0020-0255(96)00053-9_BIB7","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1109\/69.43410","article-title":"What you always wanted to know about datalog (and never dared to ask)","volume":"1","author":"Ceri","year":"1989","journal-title":"IEEE Trans. Knowl. Data Engng."},{"key":"10.1016\/0020-0255(96)00053-9_BIB8","series-title":"Logic Programming and Databases","author":"Ceri","year":"1990"},{"key":"10.1016\/0020-0255(96)00053-9_BIB9","series-title":"Proc. 16th Internat. Conf. Very Large Data Bases","first-page":"347","article-title":"A parallel strategy for transitive closure using double hash-based clustering","author":"Cheiney","year":"1990"},{"key":"10.1016\/0020-0255(96)00053-9_BIB10","author":"MasPar Computer Corporation","year":"1991"},{"issue":"5","key":"10.1016\/0020-0255(96)00053-9_BIB11","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1007\/BF01383882","article-title":"Practical parallel union-find algorithms for transitive closure and clustering","volume":"17","author":"Cybenko","year":"1988","journal-title":"Internat. J. Parallel Programming"},{"issue":"5","key":"10.1016\/0020-0255(96)00053-9_BIB12","article-title":"Extending SQL with generalized transitive closure","volume":"5","author":"Dar","year":"1993","journal-title":"Data Knowl. Engng."},{"key":"10.1016\/0020-0255(96)00053-9_BIB13","series-title":"Proc. 7th Australia Database Conf.","first-page":"61","article-title":"Efficient matrix-based transactive closure algorithms for fd-graphs","author":"Ewald","year":"1996"},{"key":"10.1016\/0020-0255(96)00053-9_BIB14","series-title":"Proc. 16th Internat. Conf. Very Large Data Bases","first-page":"335","article-title":"Distributed transitive closure computations: The disconnection set approach","author":"Houtsma","year":"1990"},{"key":"10.1016\/0020-0255(96)00053-9_BIB15","series-title":"Proc. 19th Internat. Conf. Very Large Data Bases","first-page":"206","article-title":"Implementation and performance evaluation of a parallel transitive closure algorithm on Prisma\/DB","author":"Houtsma","year":"1993"},{"key":"10.1016\/0020-0255(96)00053-9_BIB16","series-title":"Proc. 7th Internat. Conf. Data Engng.","first-page":"192","article-title":"Parallel computation of direct transitive closures","author":"Huang","year":"1991"},{"key":"10.1016\/0020-0255(96)00053-9_BIB17","series-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes","author":"Leighton","year":"1992"},{"issue":"3","key":"10.1016\/0020-0255(96)00053-9_BIB18","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/71.139200","article-title":"A processor-time-minimal systolic array for transitive closure","volume":"3","author":"Scheiman","year":"1992","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/0020-0255(96)00053-9_BIB19","article-title":"Expert database system: Efficient support for engineering environments","volume":"3","author":"Sellis","year":"1988","journal-title":"Data Knowl. Engng."},{"key":"10.1016\/0020-0255(96)00053-9_BIB20","volume":"Vol. 1","author":"Ullman","year":"1988"},{"key":"10.1016\/0020-0255(96)00053-9_BIB21","volume":"Vol. 2","author":"Ullman","year":"1989"},{"key":"10.1016\/0020-0255(96)00053-9_BIB22","series-title":"ACM SIGMOD'90","first-page":"44","article-title":"The input\/output complexity of transitive closure","author":"Ullman","year":"1990"},{"key":"10.1016\/0020-0255(96)00053-9_BIB23","series-title":"Second Internat. Conf. Expert Database Systems","article-title":"Transitive closure of transitively closed relations","author":"Valduriez","year":"1988"},{"issue":"1","key":"10.1016\/0020-0255(96)00053-9_BIB24","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01379321","article-title":"Parallel evaluation of the transitive closure of a database relation","volume":"17","author":"Valdurize","year":"1988","journal-title":"Internat. J. Parallel Programming"},{"issue":"4","key":"10.1016\/0020-0255(96)00053-9_BIB25","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1145\/360715.360746","article-title":"A modification of Warshall's algorithm for the transitive closure of the binary relations","volume":"18","author":"Warren","year":"1975","journal-title":"Commun. ACM"},{"issue":"1","key":"10.1016\/0020-0255(96)00053-9_BIB26","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/321105.321107","article-title":"A theorem on boolean matrices","volume":"9","author":"Warshall","year":"1962","journal-title":"J. ACM"},{"key":"10.1016\/0020-0255(96)00053-9_BIB27","article-title":"Parallel processing in relational database systems","author":"Zhou","year":"1994"},{"issue":"2","key":"10.1016\/0020-0255(96)00053-9_BIB28","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0169-023X(94)90003-5","article-title":"A new fragmentation scheme for recursive query processing","volume":"13","author":"Zhou","year":"1994","journal-title":"Inernat. J. Data Knowl. Engng."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025596000539?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025596000539?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:26:26Z","timestamp":1556058386000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020025596000539"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":28,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["0020025596000539"],"URL":"https:\/\/doi.org\/10.1016\/0020-0255(96)00053-9","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1996,7]]}}}