Outerjoins as disjunctions:
Abstract: "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 paper we propose a shi...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Amsterdam
1994
|
Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
94,4 |
Schlagworte: | |
Zusammenfassung: | Abstract: "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 paper we propose a shift in the intuition behind outerjoin: Instead of computing the join while also preserving its arguments, outerjoin delivers tuples that come either from the join or from the arguments. Queries with joins and outerjoins deliver tuples that come from one out of several joins, where a single relation is a trivial join. An advantage of this view is that, in contrast to preservation, disjunction is commutative and associative, which is a significant property for intuition, formalisms, and generation of execution plans. Based on disjunctive normal form, we show that some data merging queries cannot be evaluated by means of binary outerjoins, and give alternative procedures to evaluate those queries. We also explore several evaluation strategies for outerjoin queries, including the use of semijoin programs to reduce base relations." |
Beschreibung: | 17 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV010157013 | ||
003 | DE-604 | ||
005 | 19950428 | ||
007 | t | ||
008 | 950427s1994 |||| 00||| engod | ||
035 | |a (OCoLC)31639713 | ||
035 | |a (DE-599)BVBBV010157013 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
100 | 1 | |a Galindo-Legaria, César A. |e Verfasser |4 aut | |
245 | 1 | 0 | |a Outerjoins as disjunctions |c C. Galindo-Legaria |
264 | 1 | |a Amsterdam |c 1994 | |
300 | |a 17 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 94,4 | |
520 | 3 | |a Abstract: "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 paper we propose a shift in the intuition behind outerjoin: Instead of computing the join while also preserving its arguments, outerjoin delivers tuples that come either from the join or from the arguments. Queries with joins and outerjoins deliver tuples that come from one out of several joins, where a single relation is a trivial join. An advantage of this view is that, in contrast to preservation, disjunction is commutative and associative, which is a significant property for intuition, formalisms, and generation of execution plans. Based on disjunctive normal form, we show that some data merging queries cannot be evaluated by means of binary outerjoins, and give alternative procedures to evaluate those queries. We also explore several evaluation strategies for outerjoin queries, including the use of semijoin programs to reduce base relations." | |
650 | 4 | |a Database management | |
810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 94,4 |w (DE-604)BV008928356 |9 94,4 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-006747048 |
Datensatz im Suchindex
_version_ | 1804124553948954624 |
---|---|
any_adam_object | |
author | Galindo-Legaria, César A. |
author_facet | Galindo-Legaria, César A. |
author_role | aut |
author_sort | Galindo-Legaria, César A. |
author_variant | c a g l cag cagl |
building | Verbundindex |
bvnumber | BV010157013 |
ctrlnum | (OCoLC)31639713 (DE-599)BVBBV010157013 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02043nam a2200277 cb4500</leader><controlfield tag="001">BV010157013</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19950428 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950427s1994 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31639713</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010157013</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Galindo-Legaria, César A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Outerjoins as disjunctions</subfield><subfield code="c">C. Galindo-Legaria</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">17 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">94,4</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "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 paper we propose a shift in the intuition behind outerjoin: Instead of computing the join while also preserving its arguments, outerjoin delivers tuples that come either from the join or from the arguments. Queries with joins and outerjoins deliver tuples that come from one out of several joins, where a single relation is a trivial join. An advantage of this view is that, in contrast to preservation, disjunction is commutative and associative, which is a significant property for intuition, formalisms, and generation of execution plans. Based on disjunctive normal form, we show that some data merging queries cannot be evaluated by means of binary outerjoins, and give alternative procedures to evaluate those queries. We also explore several evaluation strategies for outerjoin queries, including the use of semijoin programs to reduce base relations."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Database management</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">94,4</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">94,4</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006747048</subfield></datafield></record></collection> |
id | DE-604.BV010157013 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:47:30Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006747048 |
oclc_num | 31639713 |
open_access_boolean | |
physical | 17 S. |
publishDate | 1994 |
publishDateSearch | 1994 |
publishDateSort | 1994 |
record_format | marc |
series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
spelling | Galindo-Legaria, César A. Verfasser aut Outerjoins as disjunctions C. Galindo-Legaria Amsterdam 1994 17 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 94,4 Abstract: "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 paper we propose a shift in the intuition behind outerjoin: Instead of computing the join while also preserving its arguments, outerjoin delivers tuples that come either from the join or from the arguments. Queries with joins and outerjoins deliver tuples that come from one out of several joins, where a single relation is a trivial join. An advantage of this view is that, in contrast to preservation, disjunction is commutative and associative, which is a significant property for intuition, formalisms, and generation of execution plans. Based on disjunctive normal form, we show that some data merging queries cannot be evaluated by means of binary outerjoins, and give alternative procedures to evaluate those queries. We also explore several evaluation strategies for outerjoin queries, including the use of semijoin programs to reduce base relations." Database management Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 94,4 (DE-604)BV008928356 94,4 |
spellingShingle | Galindo-Legaria, César A. Outerjoins as disjunctions Database management |
title | Outerjoins as disjunctions |
title_auth | Outerjoins as disjunctions |
title_exact_search | Outerjoins as disjunctions |
title_full | Outerjoins as disjunctions C. Galindo-Legaria |
title_fullStr | Outerjoins as disjunctions C. Galindo-Legaria |
title_full_unstemmed | Outerjoins as disjunctions C. Galindo-Legaria |
title_short | Outerjoins as disjunctions |
title_sort | outerjoins as disjunctions |
topic | Database management |
topic_facet | Database management |
volume_link | (DE-604)BV008928356 |
work_keys_str_mv | AT galindolegariacesara outerjoinsasdisjunctions |