Determining relevance of accesses at runtime
暂无分享,去创建一个
[1] J. Van Leeuwen,et al. Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .
[2] Haim Gaifman,et al. Decidable optimization problems for database logic programs , 1988, STOC '88.
[3] Andrea Calì,et al. Conjunctive Query Containment under Access Limitations , 2008, ER.
[4] Ashok K. Chandra,et al. Optimal implementation of conjunctive queries in relational data bases , 1977, STOC '77.
[5] Gerhard Weikum,et al. Active knowledge: dynamically enriching RDF knowledge bases by web services , 2010, SIGMOD Conference.
[6] Alon Y. Halevy,et al. Answering queries using views: A survey , 2001, The VLDB Journal.
[7] Diego Calvanese,et al. Containment of Conjunctive Regular Path Queries with Inverse , 2000, KR.
[8] Serge Abiteboul,et al. Foundations of Databases , 1994 .
[9] David S. Johnson,et al. A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[10] Alon Y. Halevy,et al. Recursive Plans for Information Gathering , 1997, IJCAI.
[11] Surajit Chaudhuri,et al. On the complexity of equivalence between recursive and nonrecursive Datalog programs , 1994, PODS '94.
[12] Andrea Calì,et al. Querying Data under Access Limitations , 2008, 2008 IEEE 24th International Conference on Data Engineering.
[13] Dan Suciu,et al. A formal analysis of information disclosure in data exchange , 2004, SIGMOD '04.
[14] K. Chang,et al. Accessing the Deep Web : A Survey , 2005 .
[15] Dan Suciu,et al. Query containment for conjunctive queries with regular expressions , 1998, PODS.
[16] Surajit Chaudhuri,et al. On the equivalence of recursive and nonrecursive datalog programs , 1992, J. Comput. Syst. Sci..
[17] Jeffrey D. Ullman,et al. Principles Of Database And Knowledge-Base Systems , 1979 .
[18] Alin Deutsch,et al. Rewriting queries using views with access patterns under integrity constraints , 2005, Theor. Comput. Sci..
[19] Edward Y. Chang,et al. On Answering Queries in the Presence of Limited Access Patterns , 2001, ICDT.
[20] Mitesh Patel,et al. Accessing the deep web , 2007, CACM.
[21] Georg Gottlob,et al. Determining Relevance of Accesses at Runtime (Extended Version) , 2011, ArXiv.
[22] Bertram Ludäscher,et al. Processing first-order queries under limited access patterns , 2004, PODS '04.
[23] Bertram Ludäscher,et al. Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns , 2004, EDBT.
[24] Chen Li,et al. Computing complete answers to queries in the presence of limited access patterns , 2003, The VLDB Journal.
[25] Anand Rajaraman,et al. Answering queries using templates with binding patterns (extended abstract) , 1995, PODS.
[26] Jeffrey D. Ullman,et al. Answering queries using templates with binding patterns (extended abstract) , 1995, PODS '95.
[27] Serge Abiteboul,et al. Satisfiability and relevance for queries over active documents , 2009, PODS.
[28] Jeffrey D. Ullman,et al. Principles of Database and Knowledge-Base Systems, Volume II , 1988, Principles of computer science series.
[29] Mihalis Yannakakis,et al. Equivalences Among Relational Expressions with the Union and Difference Operators , 1980, J. ACM.
[30] Edward Y. Chang,et al. Answering queries with useful bindings , 2001, TODS.
[31] Andrea Calì,et al. Dynamic Query Optimization under Access Limitations and Dependencies , 2009, J. Univers. Comput. Sci..