Querying data sources that export infinite sets of views
暂无分享,去创建一个
[1] Haim Gaifman,et al. Decidable optimization problems for database logic programs , 1988, STOC '88.
[2] Divesh Srivastava,et al. Answering Queries Using Views. , 1999, PODS 1995.
[3] Ronald Fagin,et al. Data exchange: semantics and query answering , 2005, Theor. Comput. Sci..
[4] Rada Chirkova,et al. Finding Equivalent Rewritings in the Presence of Arithmetic Comparisons , 2006, EDBT.
[5] Bertram Ludäscher,et al. Processing first-order queries under limited access patterns , 2004, PODS '04.
[6] Alin Deutsch,et al. The chase revisited , 2008, PODS.
[7] Ioana Manolescu,et al. Query optimization in the presence of limited access patterns , 1999, SIGMOD '99.
[8] Bertram Ludäscher,et al. Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns , 2004, EDBT.
[9] Anand Rajaraman,et al. Answering queries using templates with binding patterns (extended abstract) , 1995, PODS.
[10] Alin Deutsch,et al. Reformulation of XML Queries and Constraints , 2003, ICDT.
[11] Edward Y. Chang,et al. Query planning with limited source capabilities , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).
[12] Jeffrey D. Ullman,et al. A Query Translation Scheme for Rapid Implementation of Wrappers , 1995, DOOD.
[13] Georg Lausen,et al. On Chase Termination Beyond Stratification , 2009, Proc. VLDB Endow..
[14] Amihai Motro,et al. An access authorization model for relational databases based on algebraic manipulation of view definitions , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.
[15] Werner Nutt,et al. Rewriting queries with arbitrary aggregation functions using views , 2006, TODS.
[16] 守屋 悦朗,et al. J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .
[17] Serge Abiteboul,et al. Foundations of Databases , 1994 .
[18] Jeffrey D. Ullman,et al. Proof-tree transformation theorems and their applications , 1989, PODS.
[19] David Maier,et al. Testing implications of data dependencies , 1979, SIGMOD '79.
[20] Yannis Papakonstantinou,et al. Describing and Using Query Capabilities of Heterogeneous Sources , 1997, VLDB.
[21] Alin Deutsch,et al. Query reformulation with constraints , 2006, SGMD.
[22] Alin Deutsch,et al. Rewriting queries using views with access patterns under integrity constraints , 2005, Theor. Comput. Sci..
[23] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[24] Fang Wei-Kleiner,et al. Semantic query optimization in the presence of types , 2010, J. Comput. Syst. Sci..
[25] Chen Li,et al. Answering queries using views with arithmetic comparisons , 2002, PODS '02.
[26] S. Sudarshan,et al. Extending query rewriting techniques for fine-grained access control , 2004, SIGMOD '04.
[27] Yannis Papakonstantinou,et al. Expressive Capabilities Description Languages and Query Rewriting Algorithms , 2000, J. Log. Program..
[28] Harry G. Mairson,et al. Undecidable optimization problems for database logic programs , 1993, JACM.
[29] Divesh Srivastava,et al. Answering Queries Using Views. , 1999, PODS 1995.
[30] Jeffrey D. Ullman,et al. Answering Queries Using Limited External Query Processors , 1999, J. Comput. Syst. Sci..
[31] Jeffrey D. Ullman,et al. Answering queries using limited external query processors (extended abstract) , 1996, PODS.
[32] Ashok K. Chandra,et al. Optimal implementation of conjunctive queries in relational data bases , 1977, STOC '77.
[33] Anand Rajaraman,et al. Answering Queries Using Limited External Processors. , 1996, ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems.