发布求助
文献互助 智能选刊 最新文献

Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems最新文献

筛选
英文 中文
Parallelism in Bubba 布巴的平行性
Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems Pub Date : 1988-12-05 DOI: 10.1109/DPDS.1988.675003
H. Boral
{"title":"Parallelism in Bubba","authors":"H. Boral","doi":"10.1109/DPDS.1988.675003","DOIUrl":"https://doi.org/10.1109/DPDS.1988.675003","url":null,"abstract":"Bubba is a parallel computer system for data intensive applications under design at MCC. Bubba is intended as a replacement for mainframe systems providing scalable, continuous, high-performance-per-dollar access to large amounts of shared data for a large number of concurrent application types. To meet these ambitious goals, we adopted a data-driven, message passing army of ants approach. In this talk I provide a brief rationale for this choice. I then discuss some implications. Next I describe a number of the mechanisms used to enable and manage parallelism in Bubba. I conclude with an outline of the research methodology used.","PeriodicalId":390919,"journal":{"name":"Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131024878","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 27
A Parallel VLSI Architecture For Unformatted Data Processing 一种用于非格式化数据处理的并行VLSI架构
Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems Pub Date : 1988-12-05 DOI: 10.1109/DPDS.1988.675005
Kuo-Chu Lee, O. Frieder, V. Mak
{"title":"A Parallel VLSI Architecture For Unformatted Data Processing","authors":"Kuo-Chu Lee, O. Frieder, V. Mak","doi":"10.1109/DPDS.1988.675005","DOIUrl":"https://doi.org/10.1109/DPDS.1988.675005","url":null,"abstract":"A novel, high performance subsystem for information retrieval called JAS is introduced. The JAS subsystem sustains gigabyte per second comparison rates due to its “early-out” CMOS substring search processor. The complexity of each JAS unit is independent of the complexity of the query. This query complexity independence is achieved via the utilization of a decoupled instruction set. The JAS subsystem architecture is described and the performance is evaluated.","PeriodicalId":390919,"journal":{"name":"Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131038521","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Integrating Relational Databases With Support For Updates 集成支持更新的关系数据库
Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems Pub Date : 1988-12-05 DOI: 10.1109/DPDS.1988.675016
Samy Gamal-Eldin, G. Thomas, R. Elmasri
{"title":"Integrating Relational Databases With Support For Updates","authors":"Samy Gamal-Eldin, G. Thomas, R. Elmasri","doi":"10.1109/DPDS.1988.675016","DOIUrl":"https://doi.org/10.1109/DPDS.1988.675016","url":null,"abstract":"Most work on database integration has considered only support for data retrieval, not support for updates, and often the use of a special semantically rich data model has been required. In this paper we present an approach to database integration which supports updates and which uses only the standard relational data model. Many of the ideas used in this approach are applicable to database integration in the context of other data models as well.","PeriodicalId":390919,"journal":{"name":"Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125104866","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Parallel Join Algorithms on a Network of Workstations 工作站网络上的并行连接算法
Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems Pub Date : 1988-12-05 DOI: 10.1109/DPDS.1988.675006
Xiao Wang, W. Luk
{"title":"Parallel Join Algorithms on a Network of Workstations","authors":"Xiao Wang, W. Luk","doi":"10.1109/DPDS.1988.675006","DOIUrl":"https://doi.org/10.1109/DPDS.1988.675006","url":null,"abstract":"We propose a non-traditional system architecture for backend database processing, i.e., a network of workstations. By moving data dynamically to otherwise idle workstations over a local area network, a high degree of processing parallelism could be achieved through load sharing. In this paper, three load sharing join algorithms are developed and implemented on a network of Sun workstations. These join algorithms are designed on the basis of different assumptions, e.g., whether indices are available and whether join result is required to be sorted. Based on the analyical results and empirical performance data for each algorithm, we are able to show that the load sharing strategy in each case is an effective method to achieve processing speedups. However, the network bandwidth of 10Mbits/second becomes a bottleneck, when more than a dozen or so workstations are deployed, which indicates that a higher bandwidth network is needed for further improvement in performance.","PeriodicalId":390919,"journal":{"name":"Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems","volume":"188 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121073901","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
Performance Evaluation of Global Reading of Entire Databases 全数据库全局读取的性能评价
Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems Pub Date : 1988-12-05 DOI: 10.1109/DPDS.1988.675013
C. Pu, Christine H. Hong, Jae M. Wha
{"title":"Performance Evaluation of Global Reading of Entire Databases","authors":"C. Pu, Christine H. Hong, Jae M. Wha","doi":"10.1109/DPDS.1988.675013","DOIUrl":"https://doi.org/10.1109/DPDS.1988.675013","url":null,"abstract":"Using simulation and probabilistic analysis, we study the performance of an algorithm to read entire databases with locking concurrency control allowing multiple readers or an exclusive writer. The algorithm runs concurrently with the normal transaction processing (on-the-fly) and locks the entities in the database one by one (incremental). The analysis compares different strategies to resolve the conflicts between the global read algorithm and update. Since the algorithm is parallel in nature, its interference with normal transactions is minimized in parallel and distributed databases. A simulation study shows that one variant of the algorithm can read the entire database with very little overhead and interference with the updates.","PeriodicalId":390919,"journal":{"name":"Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130548690","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 30
Heuristic Algorithms For Distributed Query Processing 分布式查询处理的启发式算法
Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems Pub Date : 1988-12-05 DOI: 10.1109/DPDS.1988.675011
P. Bodorik, J. Riordon
{"title":"Heuristic Algorithms For Distributed Query Processing","authors":"P. Bodorik, J. Riordon","doi":"10.1109/DPDS.1988.675011","DOIUrl":"https://doi.org/10.1109/DPDS.1988.675011","url":null,"abstract":"This paper examines heuristic algorithms for processing distributed queries using generalized joins. As this optimization problem is NP-hard heuristic algorithms are deemed to be justified. A heuristic algorithm to form/formulate strategies to process queries is presented. It has a special property in that its overhead can be “controlled”: The higher its overhead the better the strategies it produces. Modeling on a test-bed of queries is used to demonstrate that there is a trade-off between the strategy's execution and formulation delays. The modeling results also support the notion that simple greedy heuristic algorithms such as are proposed by many researchers are sufficient in that they are likely to lead to near-optimal strategies and that increasing the overhead in forming strategies is only marginally beneficial. Both the strategy formulation and execution delays are examined in relation to the number of operations specified by the strategy and the total size of partial results.","PeriodicalId":390919,"journal":{"name":"Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133911244","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 18
Robust Transaction Routing in Distributed Database Systems 分布式数据库系统中的鲁棒事务路由
Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems Pub Date : 1988-12-01 DOI: 10.1109/DPDS.1988.675017
Yann-Hang Lee, Philip S. Yu, A. Leff
{"title":"Robust Transaction Routing in Distributed Database Systems","authors":"Yann-Hang Lee, Philip S. Yu, A. Leff","doi":"10.1109/DPDS.1988.675017","DOIUrl":"https://doi.org/10.1109/DPDS.1988.675017","url":null,"abstract":"In this paper, we examine the issue of robust transaction routing in distributed database systems. A class of dynamic routing strategies which use estimated response times to make routing decisions is studied in details. Since response time estimation and decision making depend on the assumed transaction model and parameters, it is important to examine the robustness or sensitivity to the inaccuracy in the assumptions and parameter values. Through simulations, we find that the dynamic routing strategy based strictly on response time is too aggressive in sharing loads and makes too many non-preferred system routings. It is robust with respect to change in the number of database calls per transaction, but is relatively sensitive to the distribution of database calls. Two refinements are proposed which improve system performance as well as robustness of routing decisions.","PeriodicalId":390919,"journal":{"name":"Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124056662","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Multiprocessor Main Memory Transaction Processing 多处理器内存事务处理
Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems Pub Date : 1988-12-01 DOI: 10.1109/DPDS.1988.675014
Kai Li, J. Naughton
{"title":"Multiprocessor Main Memory Transaction Processing","authors":"Kai Li, J. Naughton","doi":"10.1109/DPDS.1988.675014","DOIUrl":"https://doi.org/10.1109/DPDS.1988.675014","url":null,"abstract":"In this paper we describe an experiment designed to evaluate the potential transaction processing system performance achievable through the combination of multiple processors and massive memories. The experiment consisted of the design and implementation of a transaction processing kernel on stock multiprocessors. We found that with sufficient memory, multiple processors can greatly improve performance. A prototype implementation of the kernel on a pair of Firefly multiprocessors (each with five 1-MIP processors) runs the standard debit-credit benchmark at over 1000 transactions per second.","PeriodicalId":390919,"journal":{"name":"Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117317116","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 55
Effect of Skew on Join Performance in Parallel Architectures 倾斜对并行结构中连接性能的影响
Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems Pub Date : 1988-12-01 DOI: 10.1109/DPDS.1988.675008
M. Lakshmi, Philip S. Yu
{"title":"Effect of Skew on Join Performance in Parallel Architectures","authors":"M. Lakshmi, Philip S. Yu","doi":"10.1109/DPDS.1988.675008","DOIUrl":"https://doi.org/10.1109/DPDS.1988.675008","url":null,"abstract":"Skew in the distribution of values taken by an attribute is identified as a major factor that can affect the performance of parallel architectures for relational joins. The effect of skew on the performance of two parallel architectures is evaluated using analytic models. In one architecture, called database machine (DBMC), data as well as processing power are distributed; while in the other architecture, called Single Processor Parallel Input/output (SPPI), data is distributed but the processing power is concentrated in one processor. The two architectures are compared in terms of the ratio of MIPS used by DBMC and SPPI to deliver the same throughput and response time. In addition, the horizontal growth potential of DBMC is evaluated in terms of maximum speedup achievable by DBMC relative to SPPI response time. The MIPS ratio as well as speedup are found to be very sensitive to the amount of skew. These suggest, careful thought should be given in parallelizing database applications and in the design of algorithms and query optimizer for parallel architectures.","PeriodicalId":390919,"journal":{"name":"Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128274127","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 56
Parallelism in Processing Queries on Complex Objects 处理复杂对象查询的并行性
Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems Pub Date : 1900-01-01 DOI: 10.1109/dpds.1988.675010
T. Härder, Harald Schöning, A. Sikeler
{"title":"Parallelism in Processing Queries on Complex Objects","authors":"T. Härder, Harald Schöning, A. Sikeler","doi":"10.1109/dpds.1988.675010","DOIUrl":"https://doi.org/10.1109/dpds.1988.675010","url":null,"abstract":"Complex objects to support non-standard database applications require the use of substantial computing resources because their powerful operations and their related integrity constraints must be performed and maintained in an interactive environment. Since the exploitation of parallelism within such operations seems to be promising, we investigate the principal approaches for processing a query on complex objects (molecules) in parallel. A number of arguments favor methods based on inter-molecule parallelism as against intramolecule parallelism. Retrieval of molecules may be optimized by multiple storage structures and access paths. Hence, maintenance of such storage redundancy seems to be another good application area to explore the use of parallelism. Deferred update seems to be a bad idea, whereas concurrent update strategies incorporate salient application features. For performance reasons, we have chosen a multiprocessor system sharing an instruction addressable common memory which is used for buffer management, synchronization, and logging/recovery. Activation of concurrent requests is supported by a nested transaction concept which allows a safe and effective execution control within parallel actions of an operation.","PeriodicalId":390919,"journal":{"name":"Proceedings [1988] International Symposium on Databases in Parallel and Distributed Systems","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133633977","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 20
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信