Query Processing in Distributed Database System
Query processing in a distributed system requires the transmission f data between computers in a network. The arrangement of data transmissions and local data processing is known as a distribution strategy for a query. Two cost measures, response time and total time are used to judge the quality of...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on software engineering 1979-05, Vol.SE-5 (3), p.177-187 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 187 |
|---|---|
| container_issue | 3 |
| container_start_page | 177 |
| container_title | IEEE transactions on software engineering |
| container_volume | SE-5 |
| creator | Hevner, A.R. Yao, S.B. |
| description | Query processing in a distributed system requires the transmission f data between computers in a network. The arrangement of data transmissions and local data processing is known as a distribution strategy for a query. Two cost measures, response time and total time are used to judge the quality of a distribution strategy. Simple algorithms are presented that derive distribution strategies which have minimal response time and minimal total time, for a special class of queries. These optimal algorithms are used as a basis to develop a general query processing algorithm. Distributed query examples are presented and the complexity of the general algorithm is analyzed. The integration of a query processing subsystem into a distributed database management system is discussed. |
| doi_str_mv | 10.1109/TSE.1979.234179 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_TSE_1979_234179</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1702617</ieee_id><sourcerecordid>1143680</sourcerecordid><originalsourceid>FETCH-LOGICAL-c318t-e70b21471630b0980d36cacc610f0f129d9d2195187587b2ac4eb1ba04dce193</originalsourceid><addsrcrecordid>eNpdkL9PwzAQhS0EEqUwM7BELExp7-w4jkdUyg-pEqB2txzngly1SbGTof89qYKExHTL9949fYzdIswQQc836-UMtdIzLjJU-oxNUAudCsnhnE0AdJFKWehLdhXjFgCkUnLC5p89hWPyEVpHMfrmK_FN8uRjF3zZd1QlT7azpY2UrI-xo_01u6jtLtLN752yzfNys3hNV-8vb4vHVeoEFl1KCkqOmcJcQDm8hkrkzjqXI9RQI9eVrjhqiYWShSq5dRmVWFrIKkfD7il7GGsPof3uKXZm76Oj3c421PbRqExkkHOJA3n_j9y2fWiGbWbol0oUcILmI-RCG2Og2hyC39twNAjmZM8M9szJnhntDYm7MeGJ6I9WwHNU4gc2umkJ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>195573801</pqid></control><display><type>article</type><title>Query Processing in Distributed Database System</title><source>IEEE Electronic Library (IEL)</source><creator>Hevner, A.R. ; Yao, S.B.</creator><creatorcontrib>Hevner, A.R. ; Yao, S.B.</creatorcontrib><description>Query processing in a distributed system requires the transmission f data between computers in a network. The arrangement of data transmissions and local data processing is known as a distribution strategy for a query. Two cost measures, response time and total time are used to judge the quality of a distribution strategy. Simple algorithms are presented that derive distribution strategies which have minimal response time and minimal total time, for a special class of queries. These optimal algorithms are used as a basis to develop a general query processing algorithm. Distributed query examples are presented and the complexity of the general algorithm is analyzed. The integration of a query processing subsystem into a distributed database management system is discussed.</description><identifier>ISSN: 0098-5589</identifier><identifier>EISSN: 1939-3520</identifier><identifier>DOI: 10.1109/TSE.1979.234179</identifier><identifier>CODEN: IESEDJ</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; Computer network ; Computer networks ; Computer science ; Computers ; Costs ; Data base management systems ; Data communication ; Data models ; Data processing ; Data transmission ; Database systems ; Delay ; Design optimization ; Distributed computing ; distributed database systems ; Distributed processing ; Distribution ; Distribution strategy ; heuristic algorithms ; Optimization ; Optimization algorithms ; Optimization techniques ; Queries ; Query processing ; redundant data ; relational data model ; Response time ; Software engineering ; Strategy ; system modeling ; Time measurement</subject><ispartof>IEEE transactions on software engineering, 1979-05, Vol.SE-5 (3), p.177-187</ispartof><rights>Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) May 1979</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c318t-e70b21471630b0980d36cacc610f0f129d9d2195187587b2ac4eb1ba04dce193</citedby><cites>FETCH-LOGICAL-c318t-e70b21471630b0980d36cacc610f0f129d9d2195187587b2ac4eb1ba04dce193</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1702617$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27903,27904,54736</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1702617$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Hevner, A.R.</creatorcontrib><creatorcontrib>Yao, S.B.</creatorcontrib><title>Query Processing in Distributed Database System</title><title>IEEE transactions on software engineering</title><addtitle>TSE</addtitle><description>Query processing in a distributed system requires the transmission f data between computers in a network. The arrangement of data transmissions and local data processing is known as a distribution strategy for a query. Two cost measures, response time and total time are used to judge the quality of a distribution strategy. Simple algorithms are presented that derive distribution strategies which have minimal response time and minimal total time, for a special class of queries. These optimal algorithms are used as a basis to develop a general query processing algorithm. Distributed query examples are presented and the complexity of the general algorithm is analyzed. The integration of a query processing subsystem into a distributed database management system is discussed.</description><subject>Algorithms</subject><subject>Computer network</subject><subject>Computer networks</subject><subject>Computer science</subject><subject>Computers</subject><subject>Costs</subject><subject>Data base management systems</subject><subject>Data communication</subject><subject>Data models</subject><subject>Data processing</subject><subject>Data transmission</subject><subject>Database systems</subject><subject>Delay</subject><subject>Design optimization</subject><subject>Distributed computing</subject><subject>distributed database systems</subject><subject>Distributed processing</subject><subject>Distribution</subject><subject>Distribution strategy</subject><subject>heuristic algorithms</subject><subject>Optimization</subject><subject>Optimization algorithms</subject><subject>Optimization techniques</subject><subject>Queries</subject><subject>Query processing</subject><subject>redundant data</subject><subject>relational data model</subject><subject>Response time</subject><subject>Software engineering</subject><subject>Strategy</subject><subject>system modeling</subject><subject>Time measurement</subject><issn>0098-5589</issn><issn>1939-3520</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1979</creationdate><recordtype>article</recordtype><sourceid>8G5</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNpdkL9PwzAQhS0EEqUwM7BELExp7-w4jkdUyg-pEqB2txzngly1SbGTof89qYKExHTL9949fYzdIswQQc836-UMtdIzLjJU-oxNUAudCsnhnE0AdJFKWehLdhXjFgCkUnLC5p89hWPyEVpHMfrmK_FN8uRjF3zZd1QlT7azpY2UrI-xo_01u6jtLtLN752yzfNys3hNV-8vb4vHVeoEFl1KCkqOmcJcQDm8hkrkzjqXI9RQI9eVrjhqiYWShSq5dRmVWFrIKkfD7il7GGsPof3uKXZm76Oj3c421PbRqExkkHOJA3n_j9y2fWiGbWbol0oUcILmI-RCG2Og2hyC39twNAjmZM8M9szJnhntDYm7MeGJ6I9WwHNU4gc2umkJ</recordid><startdate>19790501</startdate><enddate>19790501</enddate><creator>Hevner, A.R.</creator><creator>Yao, S.B.</creator><general>IEEE</general><general>IEEE Computer Society</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7WY</scope><scope>7WZ</scope><scope>7X7</scope><scope>7XB</scope><scope>87Z</scope><scope>88E</scope><scope>88F</scope><scope>88I</scope><scope>88K</scope><scope>8AL</scope><scope>8FE</scope><scope>8FG</scope><scope>8FI</scope><scope>8FJ</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>FYUFA</scope><scope>F~G</scope><scope>GHDGH</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>K9.</scope><scope>L.-</scope><scope>L6V</scope><scope>M0C</scope><scope>M0N</scope><scope>M0S</scope><scope>M1P</scope><scope>M1Q</scope><scope>M2O</scope><scope>M2P</scope><scope>M2T</scope><scope>M7S</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>Q9U</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>F28</scope><scope>FR3</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19790501</creationdate><title>Query Processing in Distributed Database System</title><author>Hevner, A.R. ; Yao, S.B.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c318t-e70b21471630b0980d36cacc610f0f129d9d2195187587b2ac4eb1ba04dce193</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1979</creationdate><topic>Algorithms</topic><topic>Computer network</topic><topic>Computer networks</topic><topic>Computer science</topic><topic>Computers</topic><topic>Costs</topic><topic>Data base management systems</topic><topic>Data communication</topic><topic>Data models</topic><topic>Data processing</topic><topic>Data transmission</topic><topic>Database systems</topic><topic>Delay</topic><topic>Design optimization</topic><topic>Distributed computing</topic><topic>distributed database systems</topic><topic>Distributed processing</topic><topic>Distribution</topic><topic>Distribution strategy</topic><topic>heuristic algorithms</topic><topic>Optimization</topic><topic>Optimization algorithms</topic><topic>Optimization techniques</topic><topic>Queries</topic><topic>Query processing</topic><topic>redundant data</topic><topic>relational data model</topic><topic>Response time</topic><topic>Software engineering</topic><topic>Strategy</topic><topic>system modeling</topic><topic>Time measurement</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Hevner, A.R.</creatorcontrib><creatorcontrib>Yao, S.B.</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>Health & Medical Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Medical Database (Alumni Edition)</collection><collection>Military Database (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>Telecommunications (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Hospital Premium Collection</collection><collection>Hospital Premium Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>Health Research Premium Collection</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>Health Research Premium Collection (Alumni)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ProQuest Health & Medical Complete (Alumni)</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Health & Medical Collection (Alumni Edition)</collection><collection>Medical Database</collection><collection>Military Database</collection><collection>Research Library</collection><collection>Science Database</collection><collection>Telecommunications Database</collection><collection>Engineering Database</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</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>IEEE transactions on software engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Hevner, A.R.</au><au>Yao, S.B.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Query Processing in Distributed Database System</atitle><jtitle>IEEE transactions on software engineering</jtitle><stitle>TSE</stitle><date>1979-05-01</date><risdate>1979</risdate><volume>SE-5</volume><issue>3</issue><spage>177</spage><epage>187</epage><pages>177-187</pages><issn>0098-5589</issn><eissn>1939-3520</eissn><coden>IESEDJ</coden><abstract>Query processing in a distributed system requires the transmission f data between computers in a network. The arrangement of data transmissions and local data processing is known as a distribution strategy for a query. Two cost measures, response time and total time are used to judge the quality of a distribution strategy. Simple algorithms are presented that derive distribution strategies which have minimal response time and minimal total time, for a special class of queries. These optimal algorithms are used as a basis to develop a general query processing algorithm. Distributed query examples are presented and the complexity of the general algorithm is analyzed. The integration of a query processing subsystem into a distributed database management system is discussed.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TSE.1979.234179</doi><tpages>11</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0098-5589 |
| ispartof | IEEE transactions on software engineering, 1979-05, Vol.SE-5 (3), p.177-187 |
| issn | 0098-5589 1939-3520 |
| language | eng |
| recordid | cdi_crossref_primary_10_1109_TSE_1979_234179 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithms Computer network Computer networks Computer science Computers Costs Data base management systems Data communication Data models Data processing Data transmission Database systems Delay Design optimization Distributed computing distributed database systems Distributed processing Distribution Distribution strategy heuristic algorithms Optimization Optimization algorithms Optimization techniques Queries Query processing redundant data relational data model Response time Software engineering Strategy system modeling Time measurement |
| title | Query Processing in Distributed Database System |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-24T00%3A15%3A21IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Query%20Processing%20in%20Distributed%20Database%20System&rft.jtitle=IEEE%20transactions%20on%20software%20engineering&rft.au=Hevner,%20A.R.&rft.date=1979-05-01&rft.volume=SE-5&rft.issue=3&rft.spage=177&rft.epage=187&rft.pages=177-187&rft.issn=0098-5589&rft.eissn=1939-3520&rft.coden=IESEDJ&rft_id=info:doi/10.1109/TSE.1979.234179&rft_dat=%3Cproquest_RIE%3E1143680%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=195573801&rft_id=info:pmid/&rft_ieee_id=1702617&rfr_iscdi=true |