The complexity of acyclic conjunctive queries
暂无分享,去创建一个
Georg Gottlob | Francesco Scarcello | Nicola Leone | G. Gottlob | N. Leone | Francesco Scarcello | G. Gottlob | Nicola Leone
[1] Philip S. Yu,et al. Effectiveness of Parallel Joins , 1990, IEEE Trans. Knowl. Data Eng..
[2] J. Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .
[3] Marina Moscarini,et al. Recognition Algorithms and Design Methodologies for Acyclic Database Schemes , 1986, Adv. Comput. Res..
[4] Divesh Srivastava,et al. Answering Queries Using Views. , 1999, PODS 1995.
[5] Jeffrey D. Uuman. Principles of database and knowledge- base systems , 1989 .
[6] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[7] Divesh Srivastava,et al. Answering Queries Using Views. , 1999, PODS 1995.
[8] Ronald Fagin,et al. Degrees of acyclicity for hypergraphs and relational database schemes , 1983, JACM.
[9] Nathan Goodman,et al. Syntactic Characterization of Tree Database Schemas , 1983, JACM.
[10] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[11] Xiaolei Qian,et al. Query folding , 1996, Proceedings of the Twelfth International Conference on Data Engineering.
[12] Walter L. Ruzzo. On Uniform Circuit Complexity , 1981, J. Comput. Syst. Sci..
[13] Phokion G. Kolaitis,et al. Conjunctive-Query Containment and Constraint Satisfaction , 2000, J. Comput. Syst. Sci..
[14] Mihalis Yannakakis,et al. On the Complexity of Database Queries , 1999, J. Comput. Syst. Sci..
[15] Rina Dechter,et al. Tree Clustering for Constraint Networks , 1989, Artif. Intell..
[16] Larry Wos,et al. Subsumption, a Sometimes Undervalued Procedure , 1991, Computational Logic - Essays in Honor of Alan Robinson.
[17] Stephen A. Cook,et al. A Taxonomy of Problems with Fast Parallel Algorithms , 1985, Inf. Control..
[18] Richard Hull. Acyclic Join Dependency and Data Base Projections , 1981, J. Comput. Syst. Sci..
[19] Peter Jeavons,et al. A Survey of Tractable Constraint Satisfaction Problems , 1997 .
[20] Marc Gyssens. On the complexity of join dependencies , 1986, TODS.
[21] Philip N. Klein. Efficient Parallel Algorithms for Chordal Graphs , 1996, SIAM J. Comput..
[22] Philip A. Bernstein,et al. Power of Natural Semijoins , 1981, SIAM J. Comput..
[23] Domenico Saccà. Closures of database hypergraphs , 1985, JACM.
[24] Egon Wanke,et al. Bounded Tree-Width and LOGCFL , 1993, J. Algorithms.
[25] Stephen A. Cook,et al. Characterizations of Pushdown Machines in Terms of Time-Bounded Computers , 1971, J. ACM.
[26] Mihalis Yannakakis,et al. Algorithms for Acyclic Database Schemes , 1981, VLDB.
[27] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.
[28] Peter M. G. Apers,et al. Parallel Evaluation of Multi-join Queries , 1996, ACPC.
[29] Mihalis Yannakakis,et al. On the complexity of database queries (extended abstract) , 1997, PODS.
[30] Clement Yu,et al. On determining tree query membership of a distributed query , 1980 .
[31] Patrick Valduriez,et al. Open issues in parallel query optimization , 1996, SGMD.
[32] C. R. Ramakrishnan,et al. Subsumption Algorithms Based on Search Trees , 1996, CAAP.
[33] H. Venkateswaran. Properties that Characterize LOGCFL , 1991, J. Comput. Syst. Sci..
[34] Noam Nisan,et al. Symmetric logspace is closed under complement , 1995, STOC '95.
[35] Anand Rajaraman,et al. Answering queries using templates with binding patterns (extended abstract) , 1995, PODS.
[36] Clement T. Yu,et al. An algorithm for tree-query membership of a distributed query , 1979, COMPSAC.
[37] Catriel Beeri,et al. Properties of acyclic database schemes , 1981, STOC '81.
[38] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[39] Sheila A. Greibach,et al. The Hardest Context-Free Language , 1973, SIAM J. Comput..
[40] Ronald Fagin,et al. A simplied universal relation assumption and its properties , 1982, TODS.
[41] Serge Abiteboul,et al. Foundations of Databases , 1994 .
[42] Allan Borodin,et al. Two Applications of Inductive Counting for Complementation Problems , 1989, SIAM J. Comput..
[43] Robert E. Tarjan,et al. Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..
[44] Paul D. Seymour,et al. Graph minors. V. Excluding a planar graph , 1986, J. Comb. Theory B.
[45] Stephen A. Cook,et al. Problems Complete for Deterministic Logarithmic Space , 1987, J. Algorithms.
[46] David J. DeWitt,et al. Parallel database systems: the future of high performance database systems , 1992, CACM.
[47] Richard C. T. Lee,et al. Symbolic logic and mechanical theorem proving , 1973, Computer science classics.
[48] Ashok K. Chandra,et al. Optimal implementation of conjunctive queries in relational data bases , 1977, STOC '77.
[49] Pierre McKenzie,et al. Extensions to Barrington's M-Program Model , 1993, Theor. Comput. Sci..
[50] Ivan Hal Sudborough,et al. On the Tape Complexity of Deterministic Context-Free Languages , 1978, JACM.
[51] Marek Karpinski,et al. The Matching Problem for Strongly Chordal Graphs is in $NC$ , 1986 .
[52] Philip S. Yu,et al. Effect of Skew on Join Performance in Parallel Architectures , 1988, Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems.
[53] Christos H. Papadimitriou,et al. Symmetric Space-Bounded Computation , 1982, Theor. Comput. Sci..
[54] Richard M. Karp,et al. Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[55] Alan K. Mackworth,et al. Parallel and Distributed Finite Constraint Satisfaction: Complexity, Algorithms and Experiments , 1992 .
[56] Anand Rajaraman,et al. Conjunctive query containment revisited , 1997, Theor. Comput. Sci..
[57] Nathan Goodman,et al. Tree queries: a simple class of relational queries , 1982, TODS.
[58] Catriel Beeri,et al. On the Desirability of Acyclic Database Schemes , 1983, JACM.
[59] John C. Mitchell,et al. On the Sequential Nature of Unification , 1984, J. Log. Program..
[60] Jeffrey D. Ullman,et al. Information integration using logical views , 1997, Theor. Comput. Sci..
[61] Marc Gyssens,et al. Decomposing Constraint Satisfaction Problems Using Database Techniques , 1994, Artif. Intell..
[62] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[63] David Maier,et al. The Theory of Relational Databases , 1983 .
[64] Walter L. Ruzzo,et al. Tree-size bounded alternation(Extended Abstract) , 1979, J. Comput. Syst. Sci..
[65] Marc Gyssens,et al. Closure properties of constraints , 1997, JACM.
[66] Michael Stonebraker,et al. Optimization of parallel query execution plans in XPRS , 1991, [1991] Proceedings of the First International Conference on Parallel and Distributed Information Systems.
[67] Christos H. Papadimitriou,et al. Computational complexity , 1993 .
[68] Leslie G. Valiant,et al. A complexity theory based on Boolean algebra , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[69] Moni Naor,et al. Fast parallel algorithms for chordal graphs , 1987, SIAM J. Comput..
[70] David S. Johnson,et al. A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[71] Marc Gyssens,et al. A Decomposition Methodology for Cyclic Databases , 1982, Advances in Data Base Theory.
[72] Oded Shmueli,et al. Solving queries by tree projections , 1993, TODS.
[73] Simon Kasif,et al. Local Consistency in Parallel Constraint Satisfaction Networks , 1994, Artif. Intell..
[74] William J. Cook,et al. Combinatorial optimization , 1997 .
[75] Philip A. Bernstein,et al. Using Semi-Joins to Solve Relational Queries , 1981, JACM.
[76] Paul D. Seymour,et al. Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.
[77] Ivan Hal Sudborough. Time and Tape Bounded Auxiliary Pushdown Automata , 1977, MFCS.