Processing unions of conjunctive queries with negation under limited access patterns

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2992, Issue , 2004, Pages 422-440

  Nash, Alan ^a   Ludäscher, Bertram ^b  

^a Department of Mathematics ^*  (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS;

ACCESS PATTERNS; ANSWERING QUERIES; COMPILE TIME; CONJUNCTIVE QUERIES; QUERY ANSWERING; RUNTIMES; TESTING FEASIBILITY; WORST-CASE COMPLEXITY;

QUERY PROCESSING;

EID: 21144448174     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24741-8_25     Document Type: Article

References (19)

1. [BIR03] Biomedical Informatics Research Network Coordinating Center (BIRNCC), University of California, San Diego, http://nbirn.net/, 2003.
2. [CM77] A. K. Chandra and P. M. Merlin. Optimal Implementation of Conjunctive Queries in Relational Data Bases. In ACM Symposium on Theory of Computing (STOC), pp. 77-90, 1977.
3. [CR97] C. Chekuri and A. Rajaraman. Conjunctive query containment revisited. In Intl. Conf. on Database Theory (ICDT), Delphi, Greece, 1997.
4. [DL97] O. M. Duschka and A. Y. Levy. Recursive plans for information gathering. In Proc. IJCAI, Nagoya, Japan, 1997.
5. [FLMS99] D. Florescu, A. Y. Levy, I. Manolescu, and D. Suciu. Query Optimization in the Presence of Limited Access Patterns. In SIGMOD, pp. 311-322, 1999.
6. [GLM03] A. Gupta, B. Ludäscher, and M. Martone. BIRN-M: A Semantic Mediator for Solving Real-World Neuroscience Problems. In ACM Intl. Conference on Management of Data (SIGMOD), 2003. System demonstration.
7. [LC01] C. Li and E. Y. Chang. On Answering Queries in the Presence of Limited Access Patterns. In Intl. Conference on Database Theory (ICDT), 2001.
8. [LGM03] B. Ludäscher, A. Gupta, and M. E. Martone. Bioinformatics: Managing Scientific Data. In T. Critchlow and Z. Lacroix, editors, A ModelBased Mediator System for Scientific Data Management. Morgan Kaufmann, 2003.
9. [Li03] C. Li. Computing Complete Answers to Queries in the Presence of Limited Access Patterns. Journal of VLDB, 12:211-227, 2003.
10. [LS93] A. Y. Levy and Y. Sagiv. Queries Independent of Updates. In Proc. VLDB, pp. 171-181, 1993.
11. [NL04] A. Nash and B. Ludäscher. Processing First-Order Queries under Limited Access Patterns, submitted for publication, 2004.
12. [PGH98] Y. Papakonstantinou, A. Gupta, and L. M. Haas. Capabilities-Based Query Rewriting in Mediator Systems. Distributed and Parallel Databases, 6(1):73-110, 1998.
13. [Sar91] Y. Saraiya. Subtree elimination algorithms in deductive databases. PhD thesis, Computer Science Dept., Stanford University, 1991.
14. [SDM03] Scientific Data Management Center (SDM). http://sdm.lbl.gov/ sdmcenter/ and http://www.er.doe.gov/scidac/, 2003.
15. [SEE03] Science Environment for Ecological Knowledge (SEEK). http://seek.ecoinformatics.org/, 2003.
16. [SY80] Y. Sagiv and M. Yannakakis. Equivalences Among Relational Expressions with the Union and Difference Operators. Journal of the ACM, 27(4):633-655, 1980.
17. [U1188] J. Ullman. The Complexity of Ordering Subgoals. In ACM Symposium on Principles of Database Systems (PODS), 1988.
18. [WL03] F. Wei and G. Lausen. Containment of Conjunctive Queries with Safe Negation. In Intl. Conference on Database Theory (ICDT), 2003.
19. [WSD03] Web Services Description Language (WSDL) Version 1.2. http://wwv.w3.org/TR/wsdll2, June 2003.