{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T15:28:29Z","timestamp":1672241309214},"reference-count":30,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5676,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,1]]},"DOI":"10.1016\/s0304-3975(97)00091-1","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"211-239","source":"Crossref","is-referenced-by-count":5,"title":["A probabilistic view of Datalog parallelization"],"prefix":"10.1016","volume":"190","author":[{"given":"S\u00e9rgio","family":"Lifschitz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Vianu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00091-1_BIB1","series-title":"Proc. ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems","first-page":"23","article-title":"Queries are easier than you thought (probably)","author":"Abiteboul","year":"1992"},{"key":"10.1016\/S0304-3975(97)00091-1_BIB2","series-title":"Foundations of Databases","author":"Abiteboul","year":"1995"},{"key":"10.1016\/S0304-3975(97)00091-1_BIB3","series-title":"Proc. Internat. Conf. on Database Theory","first-page":"171","article-title":"Optimizing active databases using the split technique","author":"Abiteboul","year":"1992"},{"key":"10.1016\/S0304-3975(97)00091-1_BIB4","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"439","article-title":"Performance evaluation of data intensive logic programs","author":"Bancilhon","year":"1988"},{"issue":"5","key":"10.1016\/S0304-3975(97)00091-1_BIB5","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/0169-023X(91)90008-L","article-title":"A pipelined strategy for processing recursive queries in parallel","volume":"6","author":"Bell","year":"1991","journal-title":"Data Knowledge Eng."},{"key":"10.1016\/S0304-3975(97)00091-1_BIB6","series-title":"Random Graphs","author":"Bollob\u00e1s","year":"1985"},{"key":"10.1016\/S0304-3975(97)00091-1_BIB7","series-title":"Proc. ACM Symp. on Principles of Programming Languages","first-page":"50","article-title":"Programming primitives for database languages","author":"Chandra","year":"1981"},{"issue":"1","key":"10.1016\/S0304-3975(97)00091-1_BIB8","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0022-0000(82)90012-5","article-title":"Structure and complexity of relational queries","volume":"25","author":"Chandra","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(97)00091-1_BIB9","series-title":"Proc. Internat Symp. on Database Systems for Advanced Applications","first-page":"279","article-title":"A database rule language compiler supporting parallelism","author":"Cheiney","year":"1993"},{"key":"10.1016\/S0304-3975(97)00091-1_BIB10","series-title":"Proc. ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems","first-page":"200","article-title":"Why a single parallelization strategy is not enough in knowledge bases","author":"Cohen","year":"1989"},{"key":"10.1016\/S0304-3975(97)00091-1_BIB11","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1002\/malq.19750210112","article-title":"Monadic generalized spectra","volume":"21","author":"Fagin","year":"1975","journal-title":"Z. Math. Logik"},{"key":"10.1016\/S0304-3975(97)00091-1_BIB12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(93)90218-I","article-title":"Finite-model theory: a personal perspective","volume":"116","author":"Fagin","year":"1993","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00091-1_BIB13","series-title":"Proc. ACM-SIGMOD Internat. Conf. on Management of Data","first-page":"143","article-title":"A framework for the parallel processing of datalog queries","author":"Ganguly","year":"1990"},{"key":"10.1016\/S0304-3975(97)00091-1_BIB14","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/S0019-9958(83)80043-6","article-title":"Complexity of the first-order theory of almost all structures","volume":"52","author":"Grandjean","year":"1983","journal-title":"Inform. Control"},{"key":"10.1016\/S0304-3975(97)00091-1_BIB15","series-title":"Proc. Internat. Conf. on Very Large Data Bases","first-page":"87","article-title":"Parallel processing of recursive queries in distributed architectures","author":"Hulin","year":"1989"},{"key":"10.1016\/S0304-3975(97)00091-1_BIB16","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/S0019-9958(86)80029-8","article-title":"Relational queries computable in polynomial time","volume":"68","author":"Immerman","year":"1986","journal-title":"Inform. and Control"},{"issue":"2","key":"10.1016\/S0304-3975(97)00091-1_BIB17","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0169-023X(91)90001-E","article-title":"A rule language compiler for SQL database servers","volume":"7","author":"Kiernan","year":"1991","journal-title":"Data knowledge Eng."},{"key":"10.1016\/S0304-3975(97)00091-1_BIB18","series-title":"Proc. IEEE Symp. on Logic in Computer Science","first-page":"425","article-title":"The Decision Problem for the Probabilities of Higher-Order Properties","author":"Kolaitis","year":"1987"},{"key":"10.1016\/S0304-3975(97)00091-1_BIB19","series-title":"Proc. IEEE Symp. on Logic in Computer Science","first-page":"156","article-title":"0\u20131 Laws for Infinitary Logics","author":"Kolaitis","year":"1990"},{"key":"10.1016\/S0304-3975(97)00091-1_BIB20","article-title":"Strat\u00e9gies d'\u00e9valuation parall\u00e8le de requ\u00eates Datalog r\u00e9cursives","author":"Lifschitz","year":"1994"},{"key":"10.1016\/S0304-3975(97)00091-1_BIB21","doi-asserted-by":"crossref","first-page":"331","DOI":"10.4064\/aa-9-4-331-340","article-title":"Universal graphs and universal functions","volume":"9","author":"Rado","year":"1964","journal-title":"Acta Arith."},{"key":"10.1016\/S0304-3975(97)00091-1_BIB22","series-title":"Proc. ACM Symp. on Principles of Database Systems","first-page":"78","article-title":"Parallelizing datalog programs by generalized pivoting","author":"Seib","year":"1991"},{"key":"10.1016\/S0304-3975(97)00091-1_BIB23","volume":"vols. I and II","author":"Ullman","year":"1989"},{"key":"10.1016\/S0304-3975(97)00091-1_BIB24","series-title":"Proc. ACM Symp. on Principles of Database Systems","first-page":"140","article-title":"Bottom-up beats top-down for datalog","author":"Ullman","year":"1989"},{"key":"10.1016\/S0304-3975(97)00091-1_BIB25","series-title":"Proc. ACM-SIGMOD Internat. Conf. on Management of Data","first-page":"155","article-title":"A message passing framework for logical query evaluation","author":"Van Gelder","year":"1986"},{"key":"10.1016\/S0304-3975(97)00091-1_BIB26","series-title":"Proc. ACM SIGACT Symp. on the Theory of Computing","first-page":"137","article-title":"The complexity of relational query languages","author":"Vardi","year":"1982"},{"key":"10.1016\/S0304-3975(97)00091-1_BIB27","series-title":"Proc. Internat. Symp. on Databases in Parallel and Distributed Systems","first-page":"46","article-title":"Sharing the load of logic-programming evaluation","author":"Wolfson","year":"1988"},{"key":"10.1016\/S0304-3975(97)00091-1_BIB28","series-title":"Proc. ACM-SIGMOD Internat. Conf. on Management of Data","first-page":"133","article-title":"A new paradigm for parallel and distributed rule-processing","author":"Wolfson","year":"1990"},{"key":"10.1016\/S0304-3975(97)00091-1_BIB29","series-title":"Proc. ACM-SIGMOD Internat. Conf. on Management of Data","first-page":"329","article-title":"Distributed processing of logic programming","author":"Wolfson","year":"1988"},{"key":"10.1016\/S0304-3975(97)00091-1_BIB30","series-title":"Proc. Internat. Conf. on Parallel and Distributed Information Systems","first-page":"98","article-title":"Data partition: a practical parallel evaluation of datalog programs","author":"Zhang","year":"1991"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000911?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000911?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T04:57:29Z","timestamp":1555390649000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597000911"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0304397597000911"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00091-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}