Query optimization in star computer networks
Query processing is investigated for relational databases distributed over several computers organized in a star network. Minimal response-time processing strategies are presented for queries involving the select, project, and join commands. These strategies depend on system parameters such as commu...
Gespeichert in:
| Veröffentlicht in: | ACM transactions on database systems 1982-12, Vol.7 (4), p.678-711 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 711 |
|---|---|
| container_issue | 4 |
| container_start_page | 678 |
| container_title | ACM transactions on database systems |
| container_volume | 7 |
| creator | Kerschberg, Larry Ting, Peter D. Yao, S. Bing |
| description | Query processing is investigated for relational databases distributed over several computers organized in a star network. Minimal response-time processing strategies are presented for queries involving the select, project, and join commands. These strategies depend on system parameters such as communication costs and different machine processing speeds; database parameters such as relation cardinality and file size; and query parameters such as estimates of the size and number of tuples in the result relation. The optimal strategies specify relation preparation processes, the shipping strategy, serial or parallel processing, and, where applicable, the site of join filtering and merging. Strategies for optimizing select and join queries have been implemented and tested. |
| doi_str_mv | 10.1145/319758.319778 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_29015821</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>29015821</sourcerecordid><originalsourceid>FETCH-LOGICAL-a323t-1a1a1d5b5c730ba27c9b9446f864f643b313e8b92a0fbd617fbb8ac48eced0db3</originalsourceid><addsrcrecordid>eNo9kL9LxDAAhYMoWE9HB7dOTvbMzyYZ5fBUOBBB55CkCVTbpiYpcv719ughb3jD-3jDB8A1gmuEKLsnSHIm1ofi4gQUiDFe0ZrSU1BAUuOKScTOwUVKnxBCKiQvwN3b5OK-DGNu-_ZX5zYMZTuUKetY2tCPU3axHFz-CfErXYIzr7vkro69Ah_bx_fNc7V7fXrZPOwqTTDJFdJzGmaY5QQajbmVRlJae1FTX1NiCCJOGIk19KapEffGCG2pcNY1sDFkBW6X3zGG78mlrPo2Wdd1enBhSgpLiJjAaAarBbQxpBSdV2Nsex33CkF1cKIWJ2pxMvM3C69t_48etz9RRVxV</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>29015821</pqid></control><display><type>article</type><title>Query optimization in star computer networks</title><source>ACM Digital Library Complete</source><creator>Kerschberg, Larry ; Ting, Peter D. ; Yao, S. Bing</creator><creatorcontrib>Kerschberg, Larry ; Ting, Peter D. ; Yao, S. Bing</creatorcontrib><description>Query processing is investigated for relational databases distributed over several computers organized in a star network. Minimal response-time processing strategies are presented for queries involving the select, project, and join commands. These strategies depend on system parameters such as communication costs and different machine processing speeds; database parameters such as relation cardinality and file size; and query parameters such as estimates of the size and number of tuples in the result relation. The optimal strategies specify relation preparation processes, the shipping strategy, serial or parallel processing, and, where applicable, the site of join filtering and merging. Strategies for optimizing select and join queries have been implemented and tested.</description><identifier>ISSN: 0362-5915</identifier><identifier>EISSN: 1557-4644</identifier><identifier>DOI: 10.1145/319758.319778</identifier><language>eng</language><publisher>New York, NY, USA: ACM</publisher><subject>Architectures ; Computer systems organization ; Computing methodologies ; Contextual software domains ; Cross-computing tools and techniques ; Data access methods ; Data management systems ; Data structures ; Database management system engines ; Design ; Distributed architectures ; Distributed memory ; Distributed systems organizing principles ; General and reference ; Information systems ; Memory management ; Model development and analysis ; Modeling and simulation ; Modeling methodologies ; Operating systems ; Organizing principles for web applications ; Parallel and distributed DBMSs ; Software and its engineering ; Software organization and properties ; Software system structures</subject><ispartof>ACM transactions on database systems, 1982-12, Vol.7 (4), p.678-711</ispartof><rights>ACM</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-a323t-1a1a1d5b5c730ba27c9b9446f864f643b313e8b92a0fbd617fbb8ac48eced0db3</citedby><cites>FETCH-LOGICAL-a323t-1a1a1d5b5c730ba27c9b9446f864f643b313e8b92a0fbd617fbb8ac48eced0db3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://dl.acm.org/doi/pdf/10.1145/319758.319778$$EPDF$$P50$$Gacm$$H</linktopdf><link.rule.ids>314,776,780,2276,27901,27902,40172,75970</link.rule.ids></links><search><creatorcontrib>Kerschberg, Larry</creatorcontrib><creatorcontrib>Ting, Peter D.</creatorcontrib><creatorcontrib>Yao, S. Bing</creatorcontrib><title>Query optimization in star computer networks</title><title>ACM transactions on database systems</title><addtitle>ACM TODS</addtitle><description>Query processing is investigated for relational databases distributed over several computers organized in a star network. Minimal response-time processing strategies are presented for queries involving the select, project, and join commands. These strategies depend on system parameters such as communication costs and different machine processing speeds; database parameters such as relation cardinality and file size; and query parameters such as estimates of the size and number of tuples in the result relation. The optimal strategies specify relation preparation processes, the shipping strategy, serial or parallel processing, and, where applicable, the site of join filtering and merging. Strategies for optimizing select and join queries have been implemented and tested.</description><subject>Architectures</subject><subject>Computer systems organization</subject><subject>Computing methodologies</subject><subject>Contextual software domains</subject><subject>Cross-computing tools and techniques</subject><subject>Data access methods</subject><subject>Data management systems</subject><subject>Data structures</subject><subject>Database management system engines</subject><subject>Design</subject><subject>Distributed architectures</subject><subject>Distributed memory</subject><subject>Distributed systems organizing principles</subject><subject>General and reference</subject><subject>Information systems</subject><subject>Memory management</subject><subject>Model development and analysis</subject><subject>Modeling and simulation</subject><subject>Modeling methodologies</subject><subject>Operating systems</subject><subject>Organizing principles for web applications</subject><subject>Parallel and distributed DBMSs</subject><subject>Software and its engineering</subject><subject>Software organization and properties</subject><subject>Software system structures</subject><issn>0362-5915</issn><issn>1557-4644</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1982</creationdate><recordtype>article</recordtype><recordid>eNo9kL9LxDAAhYMoWE9HB7dOTvbMzyYZ5fBUOBBB55CkCVTbpiYpcv719ughb3jD-3jDB8A1gmuEKLsnSHIm1ofi4gQUiDFe0ZrSU1BAUuOKScTOwUVKnxBCKiQvwN3b5OK-DGNu-_ZX5zYMZTuUKetY2tCPU3axHFz-CfErXYIzr7vkro69Ah_bx_fNc7V7fXrZPOwqTTDJFdJzGmaY5QQajbmVRlJae1FTX1NiCCJOGIk19KapEffGCG2pcNY1sDFkBW6X3zGG78mlrPo2Wdd1enBhSgpLiJjAaAarBbQxpBSdV2Nsex33CkF1cKIWJ2pxMvM3C69t_48etz9RRVxV</recordid><startdate>19821201</startdate><enddate>19821201</enddate><creator>Kerschberg, Larry</creator><creator>Ting, Peter D.</creator><creator>Yao, S. Bing</creator><general>ACM</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19821201</creationdate><title>Query optimization in star computer networks</title><author>Kerschberg, Larry ; Ting, Peter D. ; Yao, S. Bing</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a323t-1a1a1d5b5c730ba27c9b9446f864f643b313e8b92a0fbd617fbb8ac48eced0db3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1982</creationdate><topic>Architectures</topic><topic>Computer systems organization</topic><topic>Computing methodologies</topic><topic>Contextual software domains</topic><topic>Cross-computing tools and techniques</topic><topic>Data access methods</topic><topic>Data management systems</topic><topic>Data structures</topic><topic>Database management system engines</topic><topic>Design</topic><topic>Distributed architectures</topic><topic>Distributed memory</topic><topic>Distributed systems organizing principles</topic><topic>General and reference</topic><topic>Information systems</topic><topic>Memory management</topic><topic>Model development and analysis</topic><topic>Modeling and simulation</topic><topic>Modeling methodologies</topic><topic>Operating systems</topic><topic>Organizing principles for web applications</topic><topic>Parallel and distributed DBMSs</topic><topic>Software and its engineering</topic><topic>Software organization and properties</topic><topic>Software system structures</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kerschberg, Larry</creatorcontrib><creatorcontrib>Ting, Peter D.</creatorcontrib><creatorcontrib>Yao, S. Bing</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>ACM transactions on database systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Kerschberg, Larry</au><au>Ting, Peter D.</au><au>Yao, S. Bing</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Query optimization in star computer networks</atitle><jtitle>ACM transactions on database systems</jtitle><stitle>ACM TODS</stitle><date>1982-12-01</date><risdate>1982</risdate><volume>7</volume><issue>4</issue><spage>678</spage><epage>711</epage><pages>678-711</pages><issn>0362-5915</issn><eissn>1557-4644</eissn><abstract>Query processing is investigated for relational databases distributed over several computers organized in a star network. Minimal response-time processing strategies are presented for queries involving the select, project, and join commands. These strategies depend on system parameters such as communication costs and different machine processing speeds; database parameters such as relation cardinality and file size; and query parameters such as estimates of the size and number of tuples in the result relation. The optimal strategies specify relation preparation processes, the shipping strategy, serial or parallel processing, and, where applicable, the site of join filtering and merging. Strategies for optimizing select and join queries have been implemented and tested.</abstract><cop>New York, NY, USA</cop><pub>ACM</pub><doi>10.1145/319758.319778</doi><tpages>34</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0362-5915 |
| ispartof | ACM transactions on database systems, 1982-12, Vol.7 (4), p.678-711 |
| issn | 0362-5915 1557-4644 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_29015821 |
| source | ACM Digital Library Complete |
| subjects | Architectures Computer systems organization Computing methodologies Contextual software domains Cross-computing tools and techniques Data access methods Data management systems Data structures Database management system engines Design Distributed architectures Distributed memory Distributed systems organizing principles General and reference Information systems Memory management Model development and analysis Modeling and simulation Modeling methodologies Operating systems Organizing principles for web applications Parallel and distributed DBMSs Software and its engineering Software organization and properties Software system structures |
| title | Query optimization in star computer networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-09T08%3A35%3A18IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Query%20optimization%20in%20star%20computer%20networks&rft.jtitle=ACM%20transactions%20on%20database%20systems&rft.au=Kerschberg,%20Larry&rft.date=1982-12-01&rft.volume=7&rft.issue=4&rft.spage=678&rft.epage=711&rft.pages=678-711&rft.issn=0362-5915&rft.eissn=1557-4644&rft_id=info:doi/10.1145/319758.319778&rft_dat=%3Cproquest_cross%3E29015821%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=29015821&rft_id=info:pmid/&rfr_iscdi=true |