Anand Rajaraman
- ANSI {1992}. Standard X3.135-1992, American National Standards institute, New York.Google Scholar
- Bernstein, P. A. and N. Goodman {1981}. "The power of natural semijoins," SIAM J. Computing 10:4, pp. 751-771.Google ScholarDigital Library
- Fagin, R. {1983}. "Degrees of acyclicity for hypergraphs and relational database schemes," J. ACM 30:3, pp. 514-550. Google ScholarDigital Library
- Fagin, R., A. O. Mendelzon, and J. D. Ullman {1982}. "A simplified universal relation assumption and its properties," ACM Trans. on Database Systems 7:3, pp. 343-360. Google ScholarDigital Library
- Galindo-Legaria, C. {1994}. "Outerjoins as disjunctions," ACM SIGMOD International Conf. on Management of Data, pp. 348-358. Google ScholarDigital Library
- Graham. M. H. {1979}. "On the universal relation," technical report, Univ. of Toronto, Toronto, Ont., Canada.Google Scholar
- Levy, A. Y., A. Rajaraman, and J. J. Ordille {1996}. "Querying heterogeneous information sources using source descriptions, " ATT Technical Memorandum submitted for publication. Google ScholarDigital Library
- Lien, Y. E. {1982}. "On the equivalence of database models," J. ACM 29:2, pp. 333-363. Google ScholarDigital Library
- Maier, D., D. Rozenshtein, and D. S. Warren {1986}. "Window Functions," in Kanellakis, P. (ed.) Advances in Computing Research 3, JAI Press, London, pp. 213- 246.Google Scholar
- Maier, D., J. D. Ullman, and M. Y. Vardi {1984}. "On the foundations of the universal relation model," A CM Trans. on Database Systems 9:2, pp. 283-308. Google ScholarDigital Library
- Papakonstantinou Y., H. Garcia-Molina, and J. Widom {1995}. "Object exchange across heterogeneous information sources," Intl. Conf. on Data Engineering, Taipei, March, 1995. Available by anonymous ftp as pub/papakonst ant inou/1994/ob j e ct-ex change-heterogeneous-is, ps from db. stanford, edu. Google ScholarDigital Library
- Rajaraman, A. and J. D. Ullman {1995}. "Integrating information by outerjoins and full disjunctions," available as pub/rajaraman/1995/outerjoin-full.ps by anonymous ftp from db. stanford, edu. Google ScholarDigital Library
- Ullman, J. D. {1989}. Principles of Database and Knowledge-Base Systems, Vol. II: The New Technologies, Computer Science Press, New York. Google ScholarDigital Library
- Yannakakis, M. {1982}. "Algorithms for acyclic database schemes," Proc. International Conference on Very Large Data Bases, pp. 82-94.Google Scholar
- Yu, C. T. and M. Z. Ozsoyoglu {1979}. "An algorithm for tree-query membership of a distributed query," Proc. IEEE COMPSAC, pp. 306-312.Google Scholar
Index Terms
- Integrating information by outerjoins and full disjunctions (extended abstract)
Recommendations
Computing full disjunctions
PODS '03: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systemsUnder either the OR-semantics or the weak semantics, the answer to a query over semistructured data consists of maximal rather than complete matchings, i.e., some query variables may be assigned null values. In the relational model, a similar effect is ...
Outerjoins as disjunctions
SIGMOD '94: Proceedings of the 1994 ACM SIGMOD international conference on Management of dataThe outerjoin operator is currently available in the query language of several major DBMSs, and it is included in the proposed SQL2 standard draft. However, “associativity problems” of the operator have been pointed out since its introduction. In this ...
Outerjoins as disjunctions
The outerjoin operator is currently available in the query language of several major DBMSs, and it is included in the proposed SQL2 standard draft. However, “associativity problems” of the operator have been pointed out since its introduction. In this ...
Comments