Determining relevance of accesses at runtime

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2011, Pages 211-222

  Benedikt, Michael ^a   Gottlob, Georg ^a   Senellart, Pierre ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b INSTITUT TELECOM   (France)

Author keywords

Access patterns; Binding patterns; Deep web; Relevance

Indexed keywords

ACCESS PATTERNS; ACCESS PLANS; BINDING PATTERN; COMPLEXITY RESULTS; CONJUNCTIVE QUERIES; DATA SOURCE; DATALOG PROGRAMS; DEEP WEB; DYNAMIC ASPECTS; LOOKUPS; PARTIAL INFORMATION; QUERY ANSWERING; QUERY CONTAINMENT; RELATIONAL DATA; RELEVANCE; RUNTIMES; WEB SOURCES;

RELATIONAL DATABASE SYSTEMS; USER INTERFACES;

SEARCH ENGINES;

EID: 79960198059     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1989284.1989309     Document Type: Conference Paper

References (27)

1. S. Abiteboul, P. Bourhis, and B. Marinoiu. Satisfiability and relevance for queries over active documents. In PODS, 2009.
2. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
3. M. Benedikt, G. Gottlob, and P. Senellart. Determining relevance of accesses at runtime (extended version). CoRR, 2011.
4. A. Calí, D. Calvanese, and D. Martinenghi. Dynamic query optimization under access limitations and dependencies. J. UCS, 15(1):33-62, 2009.
5. A. Calí and D. Martinenghi. Conjunctive query containment under access limitations. In ER, 2008.
6. A. Calí and D. Martinenghi. Querying data under access limitations. In ICDE, 2008.
7. D. Calvanese, G. D. Giacomo, M. Lenzerini, and M. Y. Vardi. Containment of conjunctive regular path queries with inverse. In KR, 2000.
8. A. K. Chandra and P. M. Merlin. Optimal implementation of conjunctive queries in relational data bases. In STOC, Boulder, USA, 1977.
9. S. Chaudhuri and M. Y. Vardi. On the complexity of equivalence between recursive and nonrecursive Datalog programs. In PODS, 1994.
10. S. Chaudhuri and M. Y. Vardi. On the equivalence of recursive and nonrecursive Datalog programs. JCSS, 54(1):61-78, 1997. (Pubitemid 127437197)
11. S. S. Cosmadakis, H. Gaifman, P. C. Kanellakis, and M. Y. Vardi. Decidable optimization problems for database logic programs. In STOC, 1988.
12. A. Deutsch, B. Ludäscher, and A. Nash. Rewriting queries using views with access patterns under integrity constraints. Theor. Comput. Sci., 371(3):200-226, 2007. (Pubitemid 46215858)
13. O. M. Duschka and A. Y. Levy. Recursive plans for information gathering. In IJCAI, 1997.
14. D. Florescu, A. Levy, and D. Suciu. Query containment for conjunctive queries with regular expressions. In PODS, 1998.
15. A. Y. Halevy. Answering queries using views: A survey. VLDB Journal, 10:270-294, 2001. (Pubitemid 33570969)
16. B. He, M. Patel, Z. Zhang, and K. C.-C. Chang. Accessing the deep Web: A survey. Communications of the ACM, 50(2):94-101, 2007.
17. D. S. Johnson. A catalog of complexity classes. In Handbook of Theoretical Computer Science. MIT Press, 1990.
18. C. Li. Computing complete answers to queries in the presence of limited access patterns. VLDB J., 12(3):211-227, 2003. (Pubitemid 37326596)
19. C. Li and E. Y. Chang. Answering queries with useful bindings. ACM Trans. Database Syst., 26(3):313-343, 2001. (Pubitemid 33676537)
20. C. Li and E. Y. Chang. On answering queries in the presence of limited access patterns. In ICDT, 2001.
21. G. Miklau and D. Suciu. A formal analysis of information disclosure in data exchange. JCSS, 73(3):507-534, 2007. (Pubitemid 46027076)
22. A. Nash and B. Ludäscher. Processing First-order queries under limited access patterns. In PODS, 2004.
23. A. Nash and B. Ludäscher. Processing union of conjunctive queries with negation under limited access patterns. In EDBT, 2004.
24. N. Preda, G. Kasneci, F. M. Suchanek, T. Neumann, W. Yuan, and G. Weikum. Active knowledge: dynamically enriching RDF knowledge bases by Web services. In SIGMOD, 2010.
25. A. Rajaraman, Y. Sagiv, and J. D. Ullman. Answering queries using templates with binding patterns. In PODS, 1995.
26. Y. Sagiv and M. Yannakakis. Equivalences among relational expressions with the union and difference operators. J. ACM, 27(4):633-655, 1980.
27. J. D. Ullman. Principles of Database and Knowledge-Base Systems, volume 2. Computer Science Press, 1989.