Fast, randomized join-order selection: why use transformations?
Gespeichert in:
| Beteiligte Personen: | , , |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Amsterdam
1994
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
94,16 |
| Schlagwörter: | |
| Abstract: | Abstract: "We study the effectiveness of probabilistic selection of join-query evaluation plans without reliance on tree transformation rules. Instead, each candidate plan is chosen uniformly at random from the space of valid evaluation orders. This leads to a transformation-free strategy where a sequence of random plans is generated and the plans are compared on their estimated costs. The success of this strategy depends on the ratio of 'good' evaluation plans in the space of alternatives, the efficient generation of random candidates, and an accurate estimation of their cost. To avoid a biased exploration of the space, we solved the open problem of efficiently generating random, uniformly-distributed evaluation orders, for queries with acyclic graphs. This benefits any optimization or sampling scheme in which a random choice of (initial) query plans is required. A direct comparison with iterative improvement and simulated annealing, using a proven cost-evaluator, shows that our transformation- free strategy converges faster and yields solutions of comparable cost." |
| Umfang: | 16 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010157148 | ||
| 003 | DE-604 | ||
| 005 | 19950428 | ||
| 007 | t| | ||
| 008 | 950427s1994 xx |||| 00||| engod | ||
| 035 | |a (OCoLC)31484077 | ||
| 035 | |a (DE-599)BVBBV010157148 | ||
| 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 Fast, randomized join-order selection |b why use transformations? |c C. Galindo-Legaria ; J. Pellenkoft ; M. L. Kersten |
| 264 | 1 | |a Amsterdam |c 1994 | |
| 300 | |a 16 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,16 | |
| 520 | 3 | |a Abstract: "We study the effectiveness of probabilistic selection of join-query evaluation plans without reliance on tree transformation rules. Instead, each candidate plan is chosen uniformly at random from the space of valid evaluation orders. This leads to a transformation-free strategy where a sequence of random plans is generated and the plans are compared on their estimated costs. The success of this strategy depends on the ratio of 'good' evaluation plans in the space of alternatives, the efficient generation of random candidates, and an accurate estimation of their cost. To avoid a biased exploration of the space, we solved the open problem of efficiently generating random, uniformly-distributed evaluation orders, for queries with acyclic graphs. This benefits any optimization or sampling scheme in which a random choice of (initial) query plans is required. A direct comparison with iterative improvement and simulated annealing, using a proven cost-evaluator, shows that our transformation- free strategy converges faster and yields solutions of comparable cost." | |
| 650 | 4 | |a Database design | |
| 700 | 1 | |a Pellenkoft, Arjan |e Verfasser |4 aut | |
| 700 | 1 | |a Kersten, Martin L. |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 94,16 |w (DE-604)BV008928356 |9 94,16 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006747173 | |
Datensatz im Suchindex
| _version_ | 1818952353085128704 |
|---|---|
| any_adam_object | |
| author | Galindo-Legaria, César A. Pellenkoft, Arjan Kersten, Martin L. |
| author_facet | Galindo-Legaria, César A. Pellenkoft, Arjan Kersten, Martin L. |
| author_role | aut aut aut |
| author_sort | Galindo-Legaria, César A. |
| author_variant | c a g l cag cagl a p ap m l k ml mlk |
| building | Verbundindex |
| bvnumber | BV010157148 |
| ctrlnum | (OCoLC)31484077 (DE-599)BVBBV010157148 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02174nam a2200301 cb4500</leader><controlfield tag="001">BV010157148</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19950428 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">950427s1994 xx |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31484077</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010157148</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">Fast, randomized join-order selection</subfield><subfield code="b">why use transformations?</subfield><subfield code="c">C. Galindo-Legaria ; J. Pellenkoft ; M. L. Kersten</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">16 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,16</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We study the effectiveness of probabilistic selection of join-query evaluation plans without reliance on tree transformation rules. Instead, each candidate plan is chosen uniformly at random from the space of valid evaluation orders. This leads to a transformation-free strategy where a sequence of random plans is generated and the plans are compared on their estimated costs. The success of this strategy depends on the ratio of 'good' evaluation plans in the space of alternatives, the efficient generation of random candidates, and an accurate estimation of their cost. To avoid a biased exploration of the space, we solved the open problem of efficiently generating random, uniformly-distributed evaluation orders, for queries with acyclic graphs. This benefits any optimization or sampling scheme in which a random choice of (initial) query plans is required. A direct comparison with iterative improvement and simulated annealing, using a proven cost-evaluator, shows that our transformation- free strategy converges faster and yields solutions of comparable cost."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Database design</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Pellenkoft, Arjan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kersten, Martin L.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</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,16</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">94,16</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006747173</subfield></datafield></record></collection> |
| id | DE-604.BV010157148 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T09:49:01Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006747173 |
| oclc_num | 31484077 |
| open_access_boolean | |
| physical | 16 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 Fast, randomized join-order selection why use transformations? C. Galindo-Legaria ; J. Pellenkoft ; M. L. Kersten Amsterdam 1994 16 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 94,16 Abstract: "We study the effectiveness of probabilistic selection of join-query evaluation plans without reliance on tree transformation rules. Instead, each candidate plan is chosen uniformly at random from the space of valid evaluation orders. This leads to a transformation-free strategy where a sequence of random plans is generated and the plans are compared on their estimated costs. The success of this strategy depends on the ratio of 'good' evaluation plans in the space of alternatives, the efficient generation of random candidates, and an accurate estimation of their cost. To avoid a biased exploration of the space, we solved the open problem of efficiently generating random, uniformly-distributed evaluation orders, for queries with acyclic graphs. This benefits any optimization or sampling scheme in which a random choice of (initial) query plans is required. A direct comparison with iterative improvement and simulated annealing, using a proven cost-evaluator, shows that our transformation- free strategy converges faster and yields solutions of comparable cost." Database design Pellenkoft, Arjan Verfasser aut Kersten, Martin L. Verfasser aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 94,16 (DE-604)BV008928356 94,16 |
| spellingShingle | Galindo-Legaria, César A. Pellenkoft, Arjan Kersten, Martin L. Fast, randomized join-order selection why use transformations? Database design |
| title | Fast, randomized join-order selection why use transformations? |
| title_auth | Fast, randomized join-order selection why use transformations? |
| title_exact_search | Fast, randomized join-order selection why use transformations? |
| title_full | Fast, randomized join-order selection why use transformations? C. Galindo-Legaria ; J. Pellenkoft ; M. L. Kersten |
| title_fullStr | Fast, randomized join-order selection why use transformations? C. Galindo-Legaria ; J. Pellenkoft ; M. L. Kersten |
| title_full_unstemmed | Fast, randomized join-order selection why use transformations? C. Galindo-Legaria ; J. Pellenkoft ; M. L. Kersten |
| title_short | Fast, randomized join-order selection |
| title_sort | fast randomized join order selection why use transformations |
| title_sub | why use transformations? |
| topic | Database design |
| topic_facet | Database design |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT galindolegariacesara fastrandomizedjoinorderselectionwhyusetransformations AT pellenkoftarjan fastrandomizedjoinorderselectionwhyusetransformations AT kerstenmartinl fastrandomizedjoinorderselectionwhyusetransformations |