Dynamic parallel query processing:
Gespeichert in:
| Beteiligte Personen: | , , |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Amsterdam
1991
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
91,12 |
| Schlagwörter: | |
| Abstract: | Abstract: "Traditional query optimizers for multiprocessor database systems produce a mostly fixed query evaluation plan based on assumptions about data distribution and processor workloads. However, these assumptions may not hold at query execution time due to contention caused by concurrent use of the system or lack of precision in the derivation of the query plan. In this paper, we propose a dynamic query processing scheme based on subdividing the query into subtasks and scheduling these adequately at run-time. We present the performance results obtained by simulation of a queueing network model of the proposed software architecture. Furthermore, we present the results from a validation of the simulations on the PRISMA 100-node multiprocessor." |
| Umfang: | 14 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009224817 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t| | ||
| 008 | 940313s1991 xx |||| 00||| eng d | ||
| 035 | |a (OCoLC)27318127 | ||
| 035 | |a (DE-599)BVBBV009224817 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Berg, C. A. van den |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Dynamic parallel query processing |c C. A. van den Berg ; M. L. Kersten ; S. Shair-Ali |
| 264 | 1 | |a Amsterdam |c 1991 | |
| 300 | |a 14 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 91,12 | |
| 520 | 3 | |a Abstract: "Traditional query optimizers for multiprocessor database systems produce a mostly fixed query evaluation plan based on assumptions about data distribution and processor workloads. However, these assumptions may not hold at query execution time due to contention caused by concurrent use of the system or lack of precision in the derivation of the query plan. In this paper, we propose a dynamic query processing scheme based on subdividing the query into subtasks and scheduling these adequately at run-time. We present the performance results obtained by simulation of a queueing network model of the proposed software architecture. Furthermore, we present the results from a validation of the simulations on the PRISMA 100-node multiprocessor." | |
| 650 | 4 | |a Database management | |
| 700 | 1 | |a Kersten, Martin L. |e Verfasser |4 aut | |
| 700 | 1 | |a Shair-Ali, S. |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 91,12 |w (DE-604)BV008928356 |9 91,12 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006133972 | |
Datensatz im Suchindex
| _version_ | 1818951444156383232 |
|---|---|
| any_adam_object | |
| author | Berg, C. A. van den Kersten, Martin L. Shair-Ali, S. |
| author_facet | Berg, C. A. van den Kersten, Martin L. Shair-Ali, S. |
| author_role | aut aut aut |
| author_sort | Berg, C. A. van den |
| author_variant | c a v d b cavd cavdb m l k ml mlk s s a ssa |
| building | Verbundindex |
| bvnumber | BV009224817 |
| ctrlnum | (OCoLC)27318127 (DE-599)BVBBV009224817 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01833nam a2200313 cb4500</leader><controlfield tag="001">BV009224817</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">940313s1991 xx |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27318127</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009224817</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-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Berg, C. A. van den</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Dynamic parallel query processing</subfield><subfield code="c">C. A. van den Berg ; M. L. Kersten ; S. Shair-Ali</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">14 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">91,12</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Traditional query optimizers for multiprocessor database systems produce a mostly fixed query evaluation plan based on assumptions about data distribution and processor workloads. However, these assumptions may not hold at query execution time due to contention caused by concurrent use of the system or lack of precision in the derivation of the query plan. In this paper, we propose a dynamic query processing scheme based on subdividing the query into subtasks and scheduling these adequately at run-time. We present the performance results obtained by simulation of a queueing network model of the proposed software architecture. Furthermore, we present the results from a validation of the simulations on the PRISMA 100-node multiprocessor."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Database management</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="700" ind1="1" ind2=" "><subfield code="a">Shair-Ali, S.</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">91,12</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">91,12</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006133972</subfield></datafield></record></collection> |
| id | DE-604.BV009224817 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T09:34:35Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006133972 |
| oclc_num | 27318127 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 14 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Berg, C. A. van den Verfasser aut Dynamic parallel query processing C. A. van den Berg ; M. L. Kersten ; S. Shair-Ali Amsterdam 1991 14 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 91,12 Abstract: "Traditional query optimizers for multiprocessor database systems produce a mostly fixed query evaluation plan based on assumptions about data distribution and processor workloads. However, these assumptions may not hold at query execution time due to contention caused by concurrent use of the system or lack of precision in the derivation of the query plan. In this paper, we propose a dynamic query processing scheme based on subdividing the query into subtasks and scheduling these adequately at run-time. We present the performance results obtained by simulation of a queueing network model of the proposed software architecture. Furthermore, we present the results from a validation of the simulations on the PRISMA 100-node multiprocessor." Database management Kersten, Martin L. Verfasser aut Shair-Ali, S. Verfasser aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 91,12 (DE-604)BV008928356 91,12 |
| spellingShingle | Berg, C. A. van den Kersten, Martin L. Shair-Ali, S. Dynamic parallel query processing Database management |
| title | Dynamic parallel query processing |
| title_auth | Dynamic parallel query processing |
| title_exact_search | Dynamic parallel query processing |
| title_full | Dynamic parallel query processing C. A. van den Berg ; M. L. Kersten ; S. Shair-Ali |
| title_fullStr | Dynamic parallel query processing C. A. van den Berg ; M. L. Kersten ; S. Shair-Ali |
| title_full_unstemmed | Dynamic parallel query processing C. A. van den Berg ; M. L. Kersten ; S. Shair-Ali |
| title_short | Dynamic parallel query processing |
| title_sort | dynamic parallel query processing |
| topic | Database management |
| topic_facet | Database management |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT bergcavanden dynamicparallelqueryprocessing AT kerstenmartinl dynamicparallelqueryprocessing AT shairalis dynamicparallelqueryprocessing |