Complexity of answering queries using materialized views, Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems , PODS '98, pp.254-263, 1998. ,
DOI : 10.1145/275487.275516
URL : https://hal.archives-ouvertes.fr/hal-00802873
Determinacy and query rewriting for conjunctive queries and views, Theoretical Computer Science, vol.412, issue.11, pp.1005-1021, 2011. ,
Update semantics of relational views, ACM Transactions on Database Systems, vol.6, issue.4, pp.557-575, 1981. ,
DOI : 10.1145/319628.319634
Rewriting guarded negation queries, Mathematical Foundations of Computer Science 2013, pp.98-110 ,
Guarded negation, Automata, Languages and Programming, pp.356-367, 2011. ,
Expressive languages for path queries over graph-structured data, ACM Transactions on Database Systems (TODS), vol.37, issue.4, p.31, 2012. ,
The collapse of the bounded width hierarchy, Journal of Logic and Computation, vol.26, issue.3, 2014. ,
DOI : 10.1093/logcom/exu070
Rewriting queries using views in description logics, Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems , PODS '97, pp.99-108, 1997. ,
DOI : 10.1145/263661.263673
Answering regular path queries using views, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073), pp.389-398, 2000. ,
DOI : 10.1109/ICDE.2000.839439
View-based query processing and constraint satisfaction, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332), pp.361-371, 2000. ,
DOI : 10.1109/LICS.2000.855784
Lossless regular views, Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '02, pp.247-258, 2002. ,
DOI : 10.1145/543613.543646
Rewriting of Regular Expressions and Regular Path Queries, Journal of Computer and System Sciences, vol.64, issue.3, pp.443-465, 2002. ,
DOI : 10.1006/jcss.2001.1805
View-based query containment, Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '03, pp.56-67, 2003. ,
DOI : 10.1145/773153.773160
View-based query processing: On the relationship between rewriting, answering and losslessness, Theoretical Computer Science, vol.371, issue.3, pp.169-182, 2007. ,
DOI : 10.1016/j.tcs.2006.11.006
Optimal implementation of conjunctive queries in relational data bases, Proceedings of the ninth annual ACM symposium on Theory of computing, pp.77-90, 1977. ,
Conjunctive query containment revisited, Database Theory ICDT'97, pp.56-70, 1997. ,
Updates of relational views, Journal of the ACM (JACM), vol.31, issue.4, pp.742-760, 1984. ,
Answering recursive queries using views, Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, pp.109-116, 1997. ,
View determinacy for preserving selected information in data transformations, Information Systems, vol.37, issue.1, pp.1-12, 2012. ,
DOI : 10.1016/j.is.2011.09.001
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory, SIAM Journal on Computing, vol.28, issue.1, pp.57-104, 1998. ,
DOI : 10.1137/S0097539794266766
Query containment for conjunctive queries with regular expressions, Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems , PODS '98, pp.139-148, 1998. ,
DOI : 10.1145/275487.275503
Asymptotic Determinacy of Path Queries Using Union-of-Paths Views, ICDT, 2015. ,
DOI : 10.1007/s00224-016-9697-x
URL : https://hal.archives-ouvertes.fr/hal-01150780
Datalog Rewritings of Regular Path Queries using Views, ICDT, pp.107-118, 2014. ,
DOI : 10.2168/LMCS-11(4:14)2015
URL : https://hal.archives-ouvertes.fr/hal-01248391
On the translatability of view updates, AMW, pp.154-167, 2012. ,
The view update problem revisited. arXiv preprint, 2012. ,
The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, pp.281-292, 2015. ,
DOI : 10.1109/LICS.2015.35
On the content of materialized aggregate views, Journal of Computer and System Sciences, vol.66, issue.1, pp.133-168, 2003. ,
DOI : 10.1016/S0022-0000(02)00033-8
URL : https://hal.archives-ouvertes.fr/inria-00115471
Theory of answering queries using views, ACM SIGMOD Record, vol.29, issue.4, pp.40-47, 2000. ,
Answering queries using views: A survey, The VLDB Journal, vol.10, issue.4, pp.270-294, 2001. ,
A logical approach to constraint satisfaction, Complexity of Constraints, pp.125-155, 2008. ,
Model checking propositional dynamic logic with all extras, Journal of Applied Logic, vol.4, issue.1, pp.39-49, 2006. ,
DOI : 10.1016/j.jal.2005.08.002
Bounded width problems and algebras. Algebra universalis, pp.439-466, 2007. ,
DOI : 10.1007/s00012-007-2012-6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.124.8062
Computing queries from derived relations, Proceedings of the 11th International Conference on Very Large Data Bases, pp.259-269, 1985. ,
Answering queries using views, Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, pp.95-104, 1995. ,
Determinacy and Rewriting of Conjunctive Queries Using Views: A Progress Report, Database Theory?ICDT 2007, pp.59-73, 2006. ,
DOI : 10.1007/11965893_5
Views and queries, ACM Transactions on Database Systems, vol.35, issue.3, p.21, 2010. ,
DOI : 10.1145/1806907.1806913
Conjunctive queries determinacy and rewriting, Proceedings of the 14th International Conference on Database Theory, ICDT '11, pp.220-231, 2011. ,
DOI : 10.1145/1938551.1938580
Schema Mapping Management in Data Exchange Systems, 2011. ,
Database Theory, Algorithms and theory of computation handbook, pp.19-19, 2010. ,
DOI : 10.1201/9781584888215-c19
Views and queries, Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '05, pp.49-60, 2005. ,
DOI : 10.1145/1065167.1065174
Equivalence of Datalog queries is undecidable, The Journal of Logic Programming, vol.15, issue.3, pp.231-241, 1993. ,
DOI : 10.1016/0743-1066(93)90040-N
Einige methodologifche Unterfuchungen ??ber die Definierbarkeit der Begriffe, Erkenntnis, vol.5, issue.1, pp.80-100, 1935. ,
DOI : 10.1007/BF00172286
Constraint satisfaction and database theory: a tutorial, Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pp.76-85, 2000. ,