Dynamic query optimization under access limitations and dependencies

Journal of Universal Computer Science

Volumn 15, Issue 1, 2009, Pages 33-62

  Calì, Andrea ^a   Calvanese, Diego ^b   Martinenghi, Davide ^c  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b FREE UNIVERSITY OF BOZEN BOLZANO   (Italy)

^c POLITECNICO DI MILANO   (Italy)

Author keywords

Access limitations; Functional dependencies; Inclusion dependencies; Query optimization

Indexed keywords

EID: 65349107649     PISSN: 0958695X     EISSN: 09486968     Source Type: Journal    
DOI: None     Document Type: Article

References (32)

1. Abiteboul, S., Hull, R., and Vianu, V. (1995). Foundations of Databases. Addison Wesley Publ. Co., Reading, Massachussetts.
2. Armstrong, W. W. (1974). Dependency structures of data base relationships. In IFIP Congress, pages 580-583.
3. Beeri, C. and Bernstein, P. A. (1979). Computational problems related to the design of normal form relational schemas. ACM Trans. on Database Systems, 4(1):30-59.
4. Beeri, C. and Vardi, M. Y. (1984). A proof procedure for data dependencies. J. of the ACM, 31(4):718-741.
5. Calì, A. and Calvanese, D. (2002). Optimized querying of integrated data over the Web. In Proc. of the IFIP WG8.1 Working Conference on Engineering Information Systems in the Internet Context (EISIC 2002), pages 285-301. Kluwer Academic Publishers.
6. Calì, A. and Martinenghi, D. (2008a). Conjunctive query containment under access limitations. In Proc. of ER 2008, page to appear.
7. Calì, A. and Martinenghi, D. (2008b). Querying data under access limitations. In Proc. of ICDE 2008, pages 50-59. IEEE Computer Society.
8. Casanova, M. A., Fagin, R., and Papadimitriou, C. H. (1984). Inclusion dependencies and their interaction with functional dependencies. J. of Computer and System Sciences, 28(1):29-59.
9. Chandra, A. K. and Vardi, M. Y. (1985). The implication problem for functional and inclusion dependencies is undecidable. SIAM J. on Computing, 14(3):671-677.
10. Cosmadakis, S. S. and Kanellakis, P. C. (1986). Functional and inclusion dependencies - A graph theoretical approach. In Kanellakis, P. C. and Preparata, F. P., editors, Advances in Computing Research, Vol. 3, pages 163-184. JAI Press.
11. Cosmadakis, S. S., Kanellakis, P. C., and Vardi, M. (1990). Polynomial-time implication problems for unary inclusion dependencies. J. of the ACM, 37(1):15-46.
12. Dembinski, P. and Maluszynski, J. (1985). AND-parallelism with intelligent backtracking for annotated logic programs. In Proc. of SLP 1985, pages 29-38.
13. Deutsch, A., Ludäscher, B., and Nash, A. (2005). Rewriting queries using views with access patterns under integrity constraints. In Proc. of the 10th Int. Conf. on Database Theory (ICDT 2005), pages 352-367.
14. Duschka, O. M. and Levy, A. Y. (1997). Recursive plans for information gathering. In Proc. of the 15th Int. Joint Conf. on Artificial Intelligence (IJCAI'97), pages 778-784.
15. Florescu, D., Levy, A. Y., Manolescu, I., and Suciu, D. (1999). Query optimization in the presence of limited access patterns. In Proc. of the ACM SIGMOD Int. Conf. on Management of Data, pages 311-322.
16. Floyd, R. W. (1962). Algorithm 97: Shortest path. Communications of the ACM, 5(6):345.
17. Halevy, A. Y. (2001). Answering queries using views: A survey. Very Large Database J., 10(4):270-294.
18. Jones, N., Lien, Y., and Lasser, W. (1976). New problems complete for nondeterministic log space. Math. Systems Theory, 10:1-17.
19. Levene, M. and Loizou, G. (2001). Guaranteeing no interaction between functional dependencies and tree-like inclusion dependencies. Theor. Comput. Sci., 254(1-2):683-690.
20. Li, C. (2003). Computing complete answers to queries in the presence of limited access patterns. Very Large Database J., 12(3):211-227.
21. Li, C. and Chang, E. (2000). Query planning with limited source capabilities. In Proc. of the 16th IEEE Int. Conf. on Data Engineering (ICDE 2000), pages 401-412.
22. Li, C. and Chang, E. (2001a). Answering queries with useful bindings. ACM Trans. on Database Systems, 26(3):313-343.
23. Li, C. and Chang, E. (2001b). On answering queries in the presence of limited access patterns. In Proc. of the 8th Int. Conf. on Database Theory (ICDT 2001), pages 219-233.
24. Ludäscher, B. and Nash, A. (2004). Processing union of conjunctive queries with negation under limited access patterns. In Proc. of the 9th Int. Conf. on Extending Database Technology (EDBT 2004), pages 422-440.
25. Maier, D. (1980). Minimum covers in the relational database model. J. of the ACM, 27(4):664-674.
26. Millstein, T. D., Halevy, A. Y., and Friedman, M. (2003). Query containment for data integration systems. J. of Computer and System Sciences, 66(1):20-39.
27. Millstein, T. D., Levy, A. Y., and Friedman, M. (2000). Query containment for data integration systems. In Proc. of the 19th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS 2000), pages 67-75.
28. Mitchell, J. C. (1983). The implication problem for functional and inclusion dependencies. Information and Control, 56:154-173.
29. Nash, A. and Ludäscher, B. (2004). Processing first-order queries under limited access patterns. In Proc. of the 23rd ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS 2004), pages 307-318.
30. Rajaraman, A., Sagiv, Y., and Ullman, J. D. (1995). Answering queries using templates with binding patterns. In Proc. of the 14th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS'95).
31. Yang, G., Kifer, M., and Chaudhri, V. K. (2006). Efficiently ordering subgoals with access constraints. In Proc. of the 25th ACM SIGACT SIGMOD SIGART Symp. on Principles of Database Systems (PODS 2006), pages 22-22.
32. Yerneni, R., Li, C., Garcia-Molina, H., and Ullman, J. D. (1999). Computing capabilities of mediators. In Proc. of the ACM SIGMOD Int. Conf. on Management of Data, pages 443-454.