Computing Full Disjunctions

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

Volumn 22, Issue , 2003, Pages 78-89

  Kanza, Yaron ^a   Sagiv, Yehoshua ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; INFORMATION RETRIEVAL; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; RELATIONAL DATABASE SYSTEMS; SEMANTICS; THEOREM PROVING;

OR-SEMANTICS; POLYNOMIAL TIME COMPLEXITY; SEMISTRUCTURED DATA; WEAK SEMANTICS;

QUERY LANGUAGES;

EID: 1142299438     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/773153.773162     Document Type: Conference Paper

References (30)

1. S. Abiteboul, P.Kanellakis, and G. Grahne. On the representation and querying sets of possible worlds. Theoretical Computer Science, 78(1):158-187, 1991.
2. S. Abiteboul, L. Segoufin, and V. Vianu. Representing and querying XML with incomplete information. In Proceedings of the 20th ACM Symposium on Principles of Databae Systems, Santa Barbara (California, USA), May 2001.
3. C. Beeri, R. Fagin, D. Maier, and M. Yannakakis. On the desirability of acyclic database schemes. Journal of the ACM, 30(3):479-513, 1983.
4. G. Bhargava, P. Goel, and B. Iyer. Hypergraph based reorderings of outer join queries with complex predicates. In Proceedings of the of 1995 ACM SIGMOD International Conference on Management of Data, pages 304-315, San Jose (California, USA), 1995.
5. A. L. P. Chen. Outer join optimization in multidatabase systems. In Proceedings of the end International Symposium on Databases in Parallel and Distributed Systems, pages 211-218, Dublin, (Ireland), July 1990.
6. E. F. Codd. Extending the relational database model to capture more meaning. ACM Transactions on Database Systems, 4(4):397-434, 1979.
7. C. J. Date. The outer join. In Proceedings of the 2nd International Conference on Databases, pages 76-106, Cambridge, 1983.
8. R. Fagin. Degree of acyclicity for hypergraphs and relational database schemas. Journal of the ACM, 7(3):343-360, 1983.
9. R. Fagin, O. Mendelzon, and J. D. Ullman. A simplified universal relation assumption and its properties. ACM Transactions on Database Systems, 7(3):343-360, 1982.
10. C. Galiando-Legaria and A. Rosenthal. Outerjoin simplification and reordering for query optimization. ACM Transactions on Database Systems, 22(1):43-73, 1997.
11. C. Galindo-Legaria. Outerjoins as disjunctions. In Proceedings of the of 1994 ACM SIGMOD International Conference on Management of Data, pages 348-358, Minneapolis (Minnesota, USA), May 1994.
12. M. Graham and M. Yannakakis. Independent database schemas. Journal of Computer and System Sciences, 28(1):121-141, 1984.
13. P. Honeyman. Testing satisfaction of functional dependencies. Journal of the ACM, 29(3):668-677, 1982.
14. T. Imielinski and W. Lipski. Incomplete information in relational databases. Journal of the ACM, 31:761-791, 1984.
15. Y. Kanza, W. Nutt, and Y. Sagiv. Queries with incomplete answers over semistructured data. In Proceedings of the 18th ACM Symposium on Principles of Database Systems, pages 227-236, Philadelphia, (Pennsylvania), May 1999.
16. Y. Kanza, W. Nutt, and Y. Sagiv. Querying incomplete information in semistructured data. Journal of Computer and System Sciences, 64(3):655-693, 2002.
17. M. Lacroix and A. Pirotte. Generalized joins. ACM SIGMOD Record, 8(3):14-15, 1976.
18. A. Y. Levy, A. Rajaraman, and J. J. Ordille. Query-answering algorithms for information agents. In Proceedings of the 13th National Conference on Artificial Intelligence and 8th Innovative Applications of Artificial Intelligence Conference, pages 40-47, Portland (Oragon), August 1996.
19. A. Y. Levy, A. Rajaraman, and J. J. Ordille. The world wide web as a collection of views: Query processing in the information manifold. In Workshop on Materialized Views: Techniques and Applications, pages 43-55, Monteal, (Canada), June 1996.
20. D. Maier, Y. Sagiv, and M. Yannakakis. On the complexity of testing implications of functional and join dependencies. Journal of the ACM, 28(4):680-695, 1981.
21. Y. Papakonstantinou, H. Garcia-Molina, and J. Widom. Object exchange across heterogeneous information sources. In Proceedings of the 11th International Conference on Data Engineering, pages 251-260, Taipei, Mar. 1995.
22. D. Quass, J. Widom, R. Goldman, K. Haas, Q. Luo, J. McHugh, S. Nestorov, A. Rajaraman, H. Rivero, S. Abiteboul, J. Ullman, and J. Wiener. LORE: A lightweight object repository for semistructured data. In Proceedings of the of 1996 ACM SIGMOD International Conference on Management of Data, Montreal (Canada), June 1996.
23. A. Rajaraman and J. D. Ullman. Integrating information by outerjoins and full disjunctions. In Proceedings of the 15th ACM Symposium on Principles of Database Systems, Montreal, (Canada), June 1996.
24. R. Reiter. A sound and sometimes complete query evaluation algorithm for relational databases with null values. Journal of the ACM, 33(2):349-370, 1986.
25. A. Rosenthal and D. Reiner. Extending the algebric framework of query processing to handle outerjoins. In Proceedings of the 10th International Conference on Very Large Data Bases, pages 334-343, Singapore, 1984.
26. Y. Sagiv. A characterization of globally consistent databases and their correct access paths. ACM Transactions on Database Systems, 8(2):266-286, 1983.
27. Y. Sagiv. Evaluation of queries in independent database schemes. Journal of the ACM, 38(1):120-161, 1991.
28. M. Y. Vardi. The complexity of relational query languages. In Proceedings of the 14th ACM Symposium on Theory of Computing, pages 137-146, San Francisco (California, USA), May 1982.
29. M. Y. Vardi. On the integrity of databases with incomplete information. In Proceedings of the 5th ACM Symposium on Principles of Database Systems, pages 252-266, Cambridge (Massachusetts, USA), 1986.
30. M. Yannakakis. Algorithms for acyclic database schemes. In Proceedings of the 7th International Conference on Very Large Data Bases, pages 82-94, Cannes (France), September 1981.