Processing first-order queries under limited access patterns

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

Volumn 23, Issue , 2004, Pages 307-318

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

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; DATA PROCESSING; SEMANTICS; SET THEORY; THEOREM PROVING;

ACCESS PATTERNS; FIRST-ORDER QUERIES; LIMITED ACCESS;

QUERY LANGUAGES;

EID: 3142702779     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1055558.1055601     Document Type: Conference Paper

References (28)

1. [AHV95] S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison Wesley, 1995.
2. [BIR01] Biomedical Informatics Research Network Coordinating Center (BIRN-CC), University of California, San Diego, http://nbirn.net/, 2001.
3. [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.
4. [DBG+03] E. Deelman, J. Blythe, Y. Gil, C. Kesselman, G. Mehta, K. Vahi, K. Blackburn, A. Lazzarini, A. Arbree, R. Cavanaugh, and S. Koranda. Mapping Abstract Complex Workflows onto Grid Environments. Journal of Grid Computing, 1(1):25-39, 2003.
5. [DGL00] O. M. Duschka, M. R. Genesereth, and A. Y. Levy. Recursive Query Plans for Data Integration. Journal of Logic Programming, 43(1):49-73, 2000.
6. [DL97] O. M. Duschka and A. Y. Levy. Recursive Plans for Information Gathering. In Proc. IJCAI, Nagoya, Japan, 1997.
7. [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.
8. [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.
9. [GT91] A. V. Gelder and R. W. Topor. Safety and Translation of Relational Calculus Queries. ACM Transactions on Database Systems (TODS), 16(2):235-278, 1991.
10. [HBCS03] R. Hull, M. Benedikt, V. Christophides, and J. Su. E-Services: A Look Behind the Curtain. In ACM Symposium on Principles of Database Systems (PODS), pp. 1-14, 2003.
11. [LAG03] B. Ludäscher, I. Altintas, and A. Gupta. Compiling Abstract Scientific Workflows into Web Service Workflows. In 15th Intl. Conference on Scientific and Statistical Database Management (SSDBM), Boston, Massachussets, 2003.
12. [LC01a] C. Li and E. Chang. Answering Queries with Useful Bindings. ACM Transactions on Database Systems (TODS), 26(3), 2001.
13. [LC01b] C. Li and E. Y. Chang. On Answering Queries in the Presence of Limited Access Patterns. In Intl. Conference on Database Theory (ICDT), 2001.
14. [LGM03] B. Ludäscher, A. Gupta, and M. E. Martone. Bioinformatics: Managing Scientific Data, chapter A Model-Based Mediator System for Scientific Data Management. Morgan Kaufmann, 2003.
15. [Li03] C. Li. Computing Complete Answers to Queries in the Presence of Limited Access Patterns. Journal of VLDB, 12:211-227, 2003.
16. [LP95] E: A. Lee and T. Parks. Dataflow Process Networks. Proceedings of the IEEE, 83(5):773-799, 1995.
17. [LRO96] A. Y. Levy, A. Rajaraman, and J. J. Ordille. Querying Heterogeneous Information Sources Using Source Descriptions. In Proceedings of the Twenty-second International Conference on Very Large Databases, pp. 251-262, Bombay, India, 1996. VLDB Endowment, Saratoga, Calif.
18. [Lud03] B. Ludäscher, Kepler: Scientific Workflows Based on Dataflow Process Networks. In e-Science Workflow Services, National e-Science Center, Edinburgh, UK, 2003.
19. [MLF00] T. D. Millstein, A. Y. Levy, and M. Priedman. Query Containment for Data Integration Systems. In Symposium on Principles of Database Systems, pp. 67-75, 2000.
20. [NL04] A. Nash and B. Ludäscher. Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns. In Intl. Conference on Extending Database Technology (EDBT), Heraklion, Crete, Greece, 2004.
21. [RSU95] A., Rajaraman, Y. Sagiv, and J. D. Ullman. Answering Queries Using Templates with Binding Patterns. In ACM Symposium on Principles of Database Systems (PODS), pp. 105-112, 1995.
22. [SDM01] Scientific Data Management Center (SDM). http://sdm.lbl.gov/ sdmcenter/, 2001.
23. [SEE02] Science Environment for Ecological Knowledge (SEEK), http://seek.ecoinformatics.org/, 2002.
24. [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.
25. [TKL03] S. Thakkar, C. A. Knoblock, and J. Luis. A View Integration Approach to Dynamic Composition of Web Services. In ICAPS 2003 Workshop on Planning for Web Services, Trento, Italy, June 2003.
26. [Ull88] J. Ullman. The Complexity of Ordering Subgoals. In ACM Symposium on Principles of Database Systems (PODS), 1988.
27. [VP00] V. Yassalos and Y. Papakonstantinou. Expressive Capabilities Description Languages and Query Rewriting Algorithms. Journal of Logic Programming, 43(1):75-122, 2000.
28. [WSD03] Web Services Description Language (WSDL) Version 1.2. http://www.w3.org/TR/wsdl12, June 2003.