A better tool for query optimization:
When evaluating the performance of a query strategy, one must often estimate the number of distinct values of an attribute in a randomly selected subset of a relation. Most query optimizers compute this estimate based on the assumption that prior to the selection, the attribute values are uniformly...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Ithaca, NY
1985
|
| Schriftenreihe: | Cornell University <Ithaca, NY> / Dep. of Computer Science: Technical report
671. |
| Schlagworte: | |
| Zusammenfassung: | When evaluating the performance of a query strategy, one must often estimate the number of distinct values of an attribute in a randomly selected subset of a relation. Most query optimizers compute this estimate based on the assumption that prior to the selection, the attribute values are uniformly distributed in the relation. In this paper we depart from this assumption and instead consider Zipf distributions that are known to accurately model text and name distributions. Given a relation of cardinality |
| Beschreibung: | 16 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV006527940 | ||
| 003 | DE-604 | ||
| 007 | t| | ||
| 008 | 930210s1985 xx d||| |||| 00||| eng d | ||
| 035 | |a (OCoLC)16650187 | ||
| 035 | |a (DE-599)BVBBV006527940 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Bitton, Dina |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A better tool for query optimization |c Dina Bitton ; Bradley VanderZanden |
| 264 | 1 | |a Ithaca, NY |c 1985 | |
| 300 | |a 16 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Cornell University <Ithaca, NY> / Dep. of Computer Science: Technical report |v 671. | |
| 520 | 3 | |a When evaluating the performance of a query strategy, one must often estimate the number of distinct values of an attribute in a randomly selected subset of a relation. Most query optimizers compute this estimate based on the assumption that prior to the selection, the attribute values are uniformly distributed in the relation. In this paper we depart from this assumption and instead consider Zipf distributions that are known to accurately model text and name distributions. Given a relation of cardinality | |
| 650 | 4 | |a Database management | |
| 700 | 1 | |a Vander Zanden, Bradley |e Verfasser |4 aut | |
| 810 | 2 | |a Dep. of Computer Science: Technical report |t Cornell University <Ithaca, NY> |v 671. |w (DE-604)BV006185504 |9 671 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-004157555 | |
Datensatz im Suchindex
| _version_ | 1820882584366743552 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Bitton, Dina Vander Zanden, Bradley |
| author_facet | Bitton, Dina Vander Zanden, Bradley |
| author_role | aut aut |
| author_sort | Bitton, Dina |
| author_variant | d b db z b v zb zbv |
| building | Verbundindex |
| bvnumber | BV006527940 |
| classification_rvk | SS 4570 |
| ctrlnum | (OCoLC)16650187 (DE-599)BVBBV006527940 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV006527940</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">930210s1985 xx d||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)16650187</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV006527940</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="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bitton, Dina</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A better tool for query optimization</subfield><subfield code="c">Dina Bitton ; Bradley VanderZanden</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Ithaca, NY</subfield><subfield code="c">1985</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">16 S.</subfield><subfield code="b">graph. Darst.</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">Cornell University <Ithaca, NY> / Dep. of Computer Science: Technical report</subfield><subfield code="v">671.</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">When evaluating the performance of a query strategy, one must often estimate the number of distinct values of an attribute in a randomly selected subset of a relation. Most query optimizers compute this estimate based on the assumption that prior to the selection, the attribute values are uniformly distributed in the relation. In this paper we depart from this assumption and instead consider Zipf distributions that are known to accurately model text and name distributions. Given a relation of cardinality</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Database management</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Vander Zanden, Bradley</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Dep. of Computer Science: Technical report</subfield><subfield code="t">Cornell University <Ithaca, NY></subfield><subfield code="v">671.</subfield><subfield code="w">(DE-604)BV006185504</subfield><subfield code="9">671</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-004157555</subfield></datafield></record></collection> |
| id | DE-604.BV006527940 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T17:09:13Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-004157555 |
| oclc_num | 16650187 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 16 S. graph. Darst. |
| publishDate | 1985 |
| publishDateSearch | 1985 |
| publishDateSort | 1985 |
| record_format | marc |
| series2 | Cornell University <Ithaca, NY> / Dep. of Computer Science: Technical report |
| spelling | Bitton, Dina Verfasser aut A better tool for query optimization Dina Bitton ; Bradley VanderZanden Ithaca, NY 1985 16 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Cornell University <Ithaca, NY> / Dep. of Computer Science: Technical report 671. When evaluating the performance of a query strategy, one must often estimate the number of distinct values of an attribute in a randomly selected subset of a relation. Most query optimizers compute this estimate based on the assumption that prior to the selection, the attribute values are uniformly distributed in the relation. In this paper we depart from this assumption and instead consider Zipf distributions that are known to accurately model text and name distributions. Given a relation of cardinality Database management Vander Zanden, Bradley Verfasser aut Dep. of Computer Science: Technical report Cornell University <Ithaca, NY> 671. (DE-604)BV006185504 671 |
| spellingShingle | Bitton, Dina Vander Zanden, Bradley A better tool for query optimization Database management |
| title | A better tool for query optimization |
| title_auth | A better tool for query optimization |
| title_exact_search | A better tool for query optimization |
| title_full | A better tool for query optimization Dina Bitton ; Bradley VanderZanden |
| title_fullStr | A better tool for query optimization Dina Bitton ; Bradley VanderZanden |
| title_full_unstemmed | A better tool for query optimization Dina Bitton ; Bradley VanderZanden |
| title_short | A better tool for query optimization |
| title_sort | a better tool for query optimization |
| topic | Database management |
| topic_facet | Database management |
| volume_link | (DE-604)BV006185504 |
| work_keys_str_mv | AT bittondina abettertoolforqueryoptimization AT vanderzandenbradley abettertoolforqueryoptimization |