{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:41:46Z","timestamp":1774946506983,"version":"3.50.1"},"reference-count":92,"publisher":"Elsevier","isbn-type":[{"value":"9780934613408","type":"print"}],"license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"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":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1016\/b978-0-934613-40-8.50018-x","type":"book-chapter","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T16:06:13Z","timestamp":1404230773000},"page":"547-585","source":"Crossref","is-referenced-by-count":14,"title":["Logic Programming and Parallel Complexity"],"prefix":"10.1016","author":[{"given":"Paris C.","family":"Kanellakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib1","doi-asserted-by":"crossref","unstructured":"Afrati, F. and Papadimitriou, C. H. [1987] The Parallel Complexity of Simple Chain Queries, Proceedings of the 6th PODS, ACM, 210\u2013214","DOI":"10.1145\/28659.28682"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib2","doi-asserted-by":"crossref","unstructured":"Aho, A. V. and Ullman, J. D. [1979] Universality of Data Retrieval Languages, Proceedings of the 6th POPL, ACM, 110\u2013117","DOI":"10.1145\/567752.567763"},{"issue":"4","key":"10.1016\/B978-0-934613-40-8.50018-X_bib3","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/322326.322339","article-title":"Contributions to the Theory of Logic Programming","volume":"29","author":"Apt","year":"1982","journal-title":"JACM"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib4","unstructured":"Bancilhon, F. Maier D., Sagiv, Y., and Ullman, J. D. [1986] Magic Sets and Other Strange Ways to Implement Logic Programs, Proceedings of the 5th PODS, ACM, 1\u201314"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib5","doi-asserted-by":"crossref","unstructured":"Bancilhon, F. and Ramakrishnan, R., [1986] An Amateur's Introduction to Recursive Query Processing Strategies, Proceedings of the 86 SIGMOD, ACM, 16\u201352","DOI":"10.1145\/16856.16859"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib6","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":"3","key":"10.1016\/B978-0-934613-40-8.50018-X_bib7","doi-asserted-by":"crossref","first-page":"521","DOI":"10.2307\/2273529","article-title":"Global Inductive Definability","volume":"43","author":"Barwise","year":"1978","journal-title":"Journal of Symbolic Logic"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib8","doi-asserted-by":"crossref","unstructured":"Beeri, C., Kanellakis, P. C., Bancilhon, F., and Ramakrishnan, R. [1987] Bounds on the Propagation of Selection into Logic Programs, Proceedings of the 6th PODS, ACM, 214\u2013227","DOI":"10.1145\/28659.28683"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib9","series-title":"Maximal Parallelism in Matrix Multiplication","author":"Chandra","year":"1976"},{"issue":"1","key":"10.1016\/B978-0-934613-40-8.50018-X_bib10","first-page":"99","article-title":"Structure and Complexity of Relational Queries","volume":"25","author":"Chandra","year":"1982","journal-title":"JCSS"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(85)90002-0","article-title":"Horn Clause Programs and Generalizations","volume":"2","author":"Chandra","year":"1985","journal-title":"J. Logic Programming"},{"issue":"1","key":"10.1016\/B978-0-934613-40-8.50018-X_bib12","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alteration","volume":"28","author":"Chandra","year":"1981","journal-title":"JACM"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib13","series-title":"Logic and Databases","first-page":"293","article-title":"Negation as Failure","author":"Clark","year":"1978"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib14","unstructured":"Clark, K. L. and Gregory, S. [1981] A Relational Language for Parallel Programming, Proceedings of the ACM Conference on Functional Programming Languages and Computer Architecture, ACM"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib15","series-title":"Programming in Prolog","author":"Clocksin","year":"1981"},{"issue":"6","key":"10.1016\/B978-0-934613-40-8.50018-X_bib16","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/362384.362685","article-title":"A Relational Model for Large Shared Data Banks","volume":"13","author":"Codd","year":"1970","journal-title":"CACM"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib17","doi-asserted-by":"crossref","unstructured":"Cole, R. and Vishkin, U. [1986] Deterministic Coin Tossing and Accelerating Cascades: Micro and Macro Techniques for Designing Parallel Algorithms, Proceedings of the 17th STOC, ACM, 206\u2013219","DOI":"10.1145\/12130.12151"},{"issue":"3","key":"10.1016\/B978-0-934613-40-8.50018-X_bib18","first-page":"308","article-title":"An Observation on a Time-Storage Trade-off","volume":"9","author":"Cook","year":"1974","journal-title":"JCSS"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib19","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","article-title":"A Taxonomy of Problems with Fast Parallel Algorithms","volume":"64","author":"Cook","year":"1985","journal-title":"Information and Control"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib20","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1137\/0211038","article-title":"On the Asymptotic Complexity of Matrix Multiplication","volume":"11","author":"Coppersmith","year":"1982","journal-title":"SIAM J. of Computing"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib21","unstructured":"Coppersmith, D. and Winograd, S. [1987] Matrix Multiplication via Behrend's Theorem, Proceedings of the 19th STOC, ACM (to appear)"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib22","doi-asserted-by":"crossref","unstructured":"Cosmadakis, S. S. and Kanellakis, P. C. [1986] Parallel Evaluation of Recursive Rule Queries, Proceedings of the 5th PODS, ACM, 280\u2013293","DOI":"10.1145\/6012.15421"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib23","doi-asserted-by":"crossref","unstructured":"deRougemont, M. [1984] Uniform Definability of Finite Structures with Successor, Proceedings of the 16th STOC, ACM, 409\u2013417","DOI":"10.1145\/800057.808707"},{"issue":"4","key":"10.1016\/B978-0-934613-40-8.50018-X_bib24","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1145\/322217.322228","article-title":"Variations on the Common Subexpression Problem","volume":"27","author":"Downey","year":"1980","journal-title":"JACM"},{"issue":"1","key":"10.1016\/B978-0-934613-40-8.50018-X_bib25","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0743-1066(84)90022-0","article-title":"On the Sequential Nature of Unification","volume":"1","author":"Dwork","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib26","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kanellakis, P. C., and Stockmeyer, L. J. [1986] Parallel Algorithms for Term Matching, Proceedings of the 8th International Conference on Automated Deduction, Springer Verlag LNCS, 416\u2013430","DOI":"10.1007\/3-540-16780-3_109"},{"issue":"4","key":"10.1016\/B978-0-934613-40-8.50018-X_bib27","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","article-title":"The Semantics of Predicate Logic as a Programming Language","volume":"23","author":"Emden","year":"1976","journal-title":"JACM"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib28","first-page":"89","article-title":"Monadic Generalized Spectra","volume":"21","author":"Fagin","year":"1975","journal-title":"Zeitschr. f. math. logik"},{"issue":"1","key":"10.1016\/B978-0-934613-40-8.50018-X_bib29","first-page":"43","article-title":"Generalized First-Order Spectra and Polynomial-Time Recognizable Sets","volume":"7","author":"Fagin","year":"1974","journal-title":"SIAM-AMS Proc."},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib30","doi-asserted-by":"crossref","unstructured":"Fortune, S. and Wyllie, J. [1978] Parallelism in Random Access Machines, Proceedings of the 10th STOC, ACM, 114\u2013118","DOI":"10.1145\/800133.804339"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib31","unstructured":"Gaifman, H., Mairson, H., Sagiv, Y., and Vardi, M. [1987] Undecidable Optimization Problems for Database Logic Programs, Proceedings of the 2nd LICS, IEEE"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib32","first-page":"44","article-title":"A Simple Proof that Connectivity of Finite Graphs Is Not First-Order Definable","volume":"26","author":"Gaifman","year":"1985","journal-title":"Bulletin of the EATCS"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib33","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/356924.356929","article-title":"Logic and Databases: A Deductive Approach","volume":"16","author":"Gallaire","year":"1984","journal-title":"Computing Surveys"},{"issue":"2","key":"10.1016\/B978-0-934613-40-8.50018-X_bib34","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/1008354.1008356","article-title":"The Monotone and Planar Circuit Value Problems are Logspace-Complete for P","volume":"9","author":"Goldschlager","year":"1977","journal-title":"SIGACT News"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib35","doi-asserted-by":"crossref","unstructured":"Gurevich, Y. [1983] Algebra of Feasible Functions, Proceedings of the 24th FOCS, IEEE, 210\u2013214","DOI":"10.1109\/SFCS.1983.5"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib36","doi-asserted-by":"crossref","unstructured":"Gurevich, Y. and Shelah S. [1985] Fixed-Point Extensions of First-Order Logic, Proceedings of the 26th FOCS, IEEE, 346\u2013353","DOI":"10.1109\/SFCS.1985.27"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib37","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/S0019-9958(84)80045-5","article-title":"A Programming Language for the Inductive Sets, and Applications","volume":"63","author":"Harel","year":"1984","journal-title":"Information and Control"},{"issue":"1","key":"10.1016\/B978-0-934613-40-8.50018-X_bib38","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/2422.2423","article-title":"On Compiling Queries in Recursive First-Order Databases","volume":"31","author":"Henschen","year":"1984","journal-title":"JACM"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib39","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib40","series-title":"Formal Languages: Perspectives and Open Problems","first-page":"349","article-title":"Equations and Rewrite Rules: A Survey","author":"Huet","year":"1980"},{"issue":"3","key":"10.1016\/B978-0-934613-40-8.50018-X_bib41","first-page":"65","article-title":"Number of Quantifiers Is Better than Number of Tape Cells","volume":"22","author":"Immerman","year":"1981","journal-title":"JCSS"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib42","doi-asserted-by":"crossref","unstructured":"Immerman, N. [1982] Relational Queries Computable in Polynomial Time, Proceedings of the 14th STOC, ACM, 147\u2013152","DOI":"10.1145\/800070.802187"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib43","doi-asserted-by":"crossref","unstructured":"Immerman, N. [1983] Languages which Capture Complexity Classes, Proceedings of the 15th STOC, ACM, 347\u2013354","DOI":"10.1145\/800061.808765"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib44","unstructured":"Ioannidis, Y. E. [1985] A Time Bound on the Materialization of Some Recursively Defined Views, Proceedings of the 85 VLDB, Stockholm"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib45","unstructured":"Ioannidis, Y. E. [1986] On the Computation of the Transitive Closure of Relational Operators, Proceedings of the 86 VLDB, Tokyo"},{"issue":"2","key":"10.1016\/B978-0-934613-40-8.50018-X_bib46","first-page":"105","article-title":"Complete Problems for Deterministic Polynomial Time","volume":"3","author":"Jones","year":"1977","journal-title":"TCS"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib47","unstructured":"Kanellakis, P. C. and Papadimitriou, C. H. [1986] Notes on Monadic Sirups\u2014unpublished"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib48","doi-asserted-by":"crossref","unstructured":"Karp, R. M., Upfal, E., and Wigderson, A. Constructing a Perfect Matching Is in Random NC, Proceedings of the 17th STOC, ACM, 22\u201332","DOI":"10.1145\/22145.22148"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib49","series-title":"Computational Problems in Abstract Algebra","first-page":"263","article-title":"Simple Word Problems in Universal Algebras","author":"Knuth","year":"1970"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib50","unstructured":"Kowalski, R. A. [1974] Predicate Logic as a Programming Language, Proceedings IFIP 74, Amsterdam, 569\u2013574"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib51","series-title":"Logic for Problem-Solving","author":"Kowalski","year":"1979"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib52","doi-asserted-by":"crossref","unstructured":"Kozen, D. [1977] Complexity of Finitely Presented Algebras, Proceedings of the 9th STOC, ACM, 164\u2013177","DOI":"10.1145\/800105.803406"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib53","unstructured":"Maluszynski, J. and Komorowski, H. J. [1985] Unification-free Execution of Horn-clause Programs, Proceedings of the 2nd Logic Programming Symposium, IEEE"},{"issue":"2","key":"10.1016\/B978-0-934613-40-8.50018-X_bib54","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1145\/357162.357169","article-title":"An Efficient Unification Algorithm","volume":"4","author":"Martelli","year":"1982","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib55","doi-asserted-by":"crossref","unstructured":"Miller, G. L. and Reif, J. H. [1985] Parallel Tree Contraction and Its Applications, Proceedings of the 26th FOCS, IEEE, 478\u2013489","DOI":"10.1109\/SFCS.1985.43"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib56","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0306-4379(83)90024-8","article-title":"On Recursive Axioms in Relational Databases","volume":"8","author":"Minker","year":"1982","journal-title":"Information Systems"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib57","series-title":"Elementary Induction on Abstract Structures","author":"Moschovakis","year":"1974"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib58","doi-asserted-by":"crossref","unstructured":"Naughton, J. [1986] Data Independent Recursion in Deductive Databases, Proceedings of the 5th PODS, ACM, 267\u2013279","DOI":"10.1145\/6012.15420"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib59","doi-asserted-by":"crossref","unstructured":"Naughton, J. and Sagiv, Y. [1987] A Decidable Class of Bounded Recursions, Proceedings of the 6th PODS, ACM, 227\u2013237","DOI":"10.1145\/28659.28684"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib60","first-page":"21","article-title":"A Note on the Expressive Power of PROLOG","volume":"26","author":"Papadimitriou","year":"1985","journal-title":"Bulletin of the EATCS"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib61","first-page":"158","article-title":"Linear Unification","volume":"16","author":"Paterson","year":"1978","journal-title":"JCSS"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib62","doi-asserted-by":"crossref","unstructured":"Pippenger, N. [1979] On Simultaneous Resource Bounds, Proceedings of the 20th FOCS, IEEE, 307\u2013331","DOI":"10.1109\/SFCS.1979.29"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib63","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/0022-314X(80)90084-0","article-title":"Probabilistic Algorithm for Testing Primality","volume":"12","author":"Rabin","year":"1980","journal-title":"J. Number Theory"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib64","series-title":"Term Matching on Parallel Computers","author":"Ramesh","year":"1986"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib65","doi-asserted-by":"crossref","unstructured":"Reif, J. [1985] Optimal Parallel Algorithms for Integer Sorting and Graph Connectivity, Proceedings of the 26th FOCS, IEEE, 496\u2013503","DOI":"10.1109\/SFCS.1985.9"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib66","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","article-title":"A Machine Oriented Logic Based on the Resolution Principle","volume":"12","author":"Robinson","year":"1985","journal-title":"JACM"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib67","series-title":"PROLOG: Manuel de Reference et d' Utilisation, Groupe de IA, UER Luminy","author":"Roussel","year":"1975"},{"issue":"2","key":"10.1016\/B978-0-934613-40-8.50018-X_bib68","first-page":"218","article-title":"Tree-size Bounded Alternation","volume":"21","author":"Ruzzo","year":"1980","journal-title":"JCSS"},{"issue":"3","key":"10.1016\/B978-0-934613-40-8.50018-X_bib69","first-page":"365","article-title":"On Uniform Circuit Complexity","volume":"22","author":"Ruzzo","year":"1981","journal-title":"JCSS"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib70","doi-asserted-by":"crossref","unstructured":"Sacca. D. and Zaniolo C. [1986] On the Implementation of a Simple Class of Logic Queries for Databases, Proceedings of the 5th PODS, ACM, 16\u201323","DOI":"10.1145\/6012.6013"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib71","doi-asserted-by":"crossref","unstructured":"Sagiv, Y. [1985] On Computing Restricted Projections of Representative Instances, Proceedings of the 4th PODS, ACM, 171\u2013180","DOI":"10.1145\/325405.325427"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib72","doi-asserted-by":"crossref","unstructured":"Sagiv, Y. [1987] Optimizing Datalog Programs, Proceedings of the 6th PODS, ACM, 349\u2013362; also in Foundations of Deductive Databases and Logic Programming (J. Minker, Ed.), Morgan Kaufmann, Los Altos, CA, 659\u2013698","DOI":"10.1016\/B978-0-934613-40-8.50021-X"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib73","first-page":"319","article-title":"Polynomial Computability and Recursivity in Finite Domains","volume":"16","author":"Sazonov","year":"1980","journal-title":"Electronische Informationsverarbeitung and Kybernetik"},{"issue":"4","key":"10.1016\/B978-0-934613-40-8.50018-X_bib74","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/322217.322225","article-title":"Fast Probabilistic Algorithms for the Verification of Polynomial Identities","volume":"27","author":"Schwartz","year":"1980","journal-title":"JACM"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib75","series-title":"A Subset of Concurrent PROLOG and its Interpreter","author":"Shapiro","year":"1983"},{"issue":"1","key":"10.1016\/B978-0-934613-40-8.50018-X_bib76","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0743-1066(84)90021-9","article-title":"Alternation and the Computational Complexity of Logic Progams","volume":"1","author":"Shapiro","year":"1984","journal-title":"J. of Logic Programming"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib77","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"19","article-title":"Negation in Logic Programming","author":"Shepherdson","year":"1988"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib78","doi-asserted-by":"crossref","unstructured":"Shmueli, O. [1987] Decidability and Expressiveness Aspects of Logic Queries, Proceedings of the 6th PODS, ACM, 237\u2013249","DOI":"10.1145\/28659.28685"},{"issue":"4","key":"10.1016\/B978-0-934613-40-8.50018-X_bib79","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0214061","article-title":"An Efficient Parallel Biconnectivity Algorithm","volume":"14","author":"Tarjan","year":"1985","journal-title":"SIAM J. of Computing"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib80","series-title":"Fachbereit Informatik","article-title":"Description, Implementation and Practical Comparison of Unification Algorithms","author":"Trum","year":"1987"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib81","series-title":"Principles of Database Systems","author":"Ullman","year":"1978"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib82","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1145\/3979.3980","article-title":"Implementation of Logical Query Languages for Databases","volume":"10","author":"Ullman","year":"1985","journal-title":"ACM Trans. on Database Systems"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib83","doi-asserted-by":"crossref","unstructured":"Ullman, J. D. and Van Gelder, A. [1986] Parallel Complexity of Logical Query Programs, Proceedings of the 27th FOCS, 438\u2013454","DOI":"10.1109\/SFCS.1986.40"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib84","unstructured":"Valduriez, P. and Boral, H. [1986] Evaluation of Recursive Queries Using Join Indices, Proceedings of the 1st International Conference on Expert Database Systems, Charleston, SC"},{"issue":"4","key":"10.1016\/B978-0-934613-40-8.50018-X_bib85","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1137\/0212043","article-title":"Fast Parallel Computation on Polynomials Using Few Processors","volume":"12","author":"Valiant","year":"1983","journal-title":"SIAM J. of Computing"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib86","doi-asserted-by":"crossref","unstructured":"Vardi, M. Y. [1982] Complexity of Relational Query Languages, Proceedings of the 14th STOC, ACM, 137\u2013145","DOI":"10.1145\/800070.802186"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib87","unstructured":"Vardi, M. Y. [1985] Personal Communication"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib88","series-title":"An Efficient Parallel Algorithm for Term Matching","author":"Verma","year":"1986"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib89","doi-asserted-by":"crossref","unstructured":"Vishkin, U. [1984] Randomized Speed-ups in Parallel Computation, Proceedings of the 16th STOC, ACM, 230\u2013239","DOI":"10.1145\/800057.808686"},{"issue":"5","key":"10.1016\/B978-0-934613-40-8.50018-X_bib90","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1109\/TC.1986.1676783","article-title":"New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P","volume":"C-35","author":"Vitter","year":"1986","journal-title":"IEEE Trans. on Computers"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib91","unstructured":"Yannakakis, M. [1986] Personal Communication"},{"key":"10.1016\/B978-0-934613-40-8.50018-X_bib92","unstructured":"Yasuura, H. [1983] On the Parallel Computational Complexity of Unification, ER 83\u201301, Yajima Lab"}],"container-title":["Foundations of Deductive Databases and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B978093461340850018X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B978093461340850018X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T16:21:42Z","timestamp":1746289302000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B978093461340850018X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9780934613408"],"references-count":92,"URL":"https:\/\/doi.org\/10.1016\/b978-0-934613-40-8.50018-x","relation":{},"subject":[],"published":{"date-parts":[[1988]]}}}