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

Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications最新文献

筛选
英文 中文
Concurrent access to B-trees 并发访问b树
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77156
W. D. Jonge, A. Schijf
{"title":"Concurrent access to B-trees","authors":"W. D. Jonge, A. Schijf","doi":"10.1109/PARBSE.1990.77156","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77156","url":null,"abstract":"The authors give a detailed view of Y. Sagiv's (1985) approach to controlling concurrent access to B/sup link/-trees. It is argued that Sagiv's compression process does not guarantee the 50% load factor as he claimed. This is due to the fact that his compression process treats nodes with a common father pairwise. Furthermore, his compression process sometimes moves information to the left. It is shown here how, as a result of this, readers and updaters may end up too far to the right. This means that processors sometimes have to break off their locate or restructure phase to start again or continue at the root, and that it is necessary to have a low key in each node. In the approach proposed here, the maintenance process does not treat nodes pairwise and, if it moves information, it does so to the right only. Therefore, the present approach does not exhibit the problems associated with Sagiv's approach. Furthermore, it is shown that it has some additional advantages, such as being able to guarantee any desired load factor, offering higher dynamics with respect to deletions and not needing locks in the index set.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123784771","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}
引用次数: 12
Fault-tolerant multiprocessor networks through an extended G-network 通过扩展g网络实现的容错多处理器网络
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77143
J. Wu, E. Fernández
{"title":"Fault-tolerant multiprocessor networks through an extended G-network","authors":"J. Wu, E. Fernández","doi":"10.1109/PARBSE.1990.77143","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77143","url":null,"abstract":"The authors present an extended G-network which is 3-insensitive, meaning that the network can tolerate up to three communication link failures. It is shown that the extended G-network still keeps the characteristics of the G-network: efficient routing, a small number of links, a small number of file servers, and fault tolerance. The performance of the extended G-network is compared to that of the G-network.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122872221","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
Graph modeling and analysis of linear recursive queries 图建模和分析线性递归查询
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77116
Lee, W. Lu
{"title":"Graph modeling and analysis of linear recursive queries","authors":"Lee, W. Lu","doi":"10.1109/PARBSE.1990.77116","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77116","url":null,"abstract":"The authors study a class of complex linear recursive rules or blocks via the V-graph model. A block a linear recursive rule represented by a nontrivial 2-connected component (i.e. containing at least a cycle). It is first shown that a simple form of block, namely, the cycle, has a simple, periodic, variable connection in the expansions. Then it is shown that blocks also have a periodic variable connection in the expansions, and the period and connection can be algorithmically determined. This allows a query to be evaluated efficiently with an iterative algorithm. The effects of the static variable bindings in blocks on query evaluation are then discussed.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127594027","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}
引用次数: 6
Extending object-oriented databases with rules 用规则扩展面向对象数据库
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77222
P. Soupos, S. Goutas, D. Christodoulakis
{"title":"Extending object-oriented databases with rules","authors":"P. Soupos, S. Goutas, D. Christodoulakis","doi":"10.1109/PARBSE.1990.77222","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77222","url":null,"abstract":"Rules have been adopted as a means of expressing knowledge which is uniform throughout the type lattice but needs to be customized for each object type with integrity constraints. More specifically, such knowledge involves associations between instances, between objects, and between objects in different databases; grouping of instances; creation and deletion of object instances; and any other activity that requires a uniform approach in order to ensure consistency and transparency. A logical query language based on the representation of associations between objects, which can be made by rules, has been used. The goal was not a full-fledged object-oriented programming language, but a logical query language with base predicate associations between objects. A logical query language has the obvious advantage of expressiveness and simplicity but poses certain difficulties in evaluation; evaluation is an issue in the case of recursive queries due to time-consuming join operations. This problem was overcome by transforming recursion into iterative navigation through associations between object instances.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114333914","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}
引用次数: 0
Range search in parallel using distributed data structures 使用分布式数据结构并行搜索范围
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77112
S. Radhakrishnan, S. Iyengar, Subbiah Rajanarayanan
{"title":"Range search in parallel using distributed data structures","authors":"S. Radhakrishnan, S. Iyengar, Subbiah Rajanarayanan","doi":"10.1109/PARBSE.1990.77112","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77112","url":null,"abstract":"The range search problem involves obtaining a set of data points (tuples, records) satisfying a query which specifies a range of values on each dimension, (attribute) of the data. A parallel algorithm for range searching is developed, using the concept of distributed data structures. The range tree proposed by J.L. Bentley (1980) is used as the data structure to be distributed. It is shown that O(log n) search time can be effected for a range search on n three-dimensional points using (2.log/sup 2/n-10.logn+12) processors, and thus is optimal for the range tree distribution. The authors present a nontrivial implementation technique on the hypercube parallel architecture with which the above time and processor bound can be achieved without any communication overhead. The algorithm can easily be generalized for the case of d-dimensional range search.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130826792","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}
引用次数: 9
A comparison of scanning algorithms 扫描算法的比较
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77226
C. G. van den Berg, M. Kersten, K. Blom
{"title":"A comparison of scanning algorithms","authors":"C. G. van den Berg, M. Kersten, K. Blom","doi":"10.1109/PARBSE.1990.77226","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77226","url":null,"abstract":"Three implementation techniques for main memory database systems are described and compared, namely, the compilation, vectorization, and adaptive methods. The adaptive method can be combined with the standard, compilation, and vectorization methods. Experiments show that, with standard optimization techniques like vectorization and compilation, a performance increase of a factor of five can be obtained. The adaptive method turned out to be favorable only in combination with the vectorization and compilation approach. Experience with applying these techniques indicates that the performance increase is well worth the added implementation effort for both the compilation and vectorization approach.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129753733","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}
引用次数: 3
Effect of data compression hardware on the performance of a relational database machine 数据压缩硬件对关系数据库机器性能的影响
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77134
N. Ranganathan, H. Srinidhi
{"title":"Effect of data compression hardware on the performance of a relational database machine","authors":"N. Ranganathan, H. Srinidhi","doi":"10.1109/PARBSE.1990.77134","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77134","url":null,"abstract":"The authors propose the use of data compression hardware to improve the performance of a relational database machine. They derive detailed analytical models of a specific relational database machine DELTA and report simulation results that quantify the improvement in its system performance due to compression hardware. The main contribution of the present work is the strategy of using compression hardware in the design of database machines to overcome the I/O bottleneck, thereby increasing their performance. The authors suggest the use of on-the-fly hardware to compress and decompress the data so that the time overhead due to compression is negligible.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114627032","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
Parallel computing system with communication memory 具有通信存储器的并行计算系统
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77217
N. Petrova, V. Velev
{"title":"Parallel computing system with communication memory","authors":"N. Petrova, V. Velev","doi":"10.1109/PARBSE.1990.77217","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77217","url":null,"abstract":"The authors describe a parallel computing system architecture in which the processors' access to common data is combined with the memory read/write operations. This can be achieved by the division of the memory into individual modules constituting the communication memory. Only data which are used by at least two processors of the parallel computing system are written into the memory. The communication memory organization has been studied with a view to accessed data movement during the computations. Each processor is capable of reading and writing in the memory of the other processors.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128945143","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}
引用次数: 0
A theory of conjunction and concurrency 结合和并发的理论
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77155
C. Hoare
{"title":"A theory of conjunction and concurrency","authors":"C. Hoare","doi":"10.1109/PARBSE.1990.77155","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77155","url":null,"abstract":"Some general conditions under which the specification of a concurrent system can be expressed as the conjunction of specifications for its component processes are explored. A lattice-theoretic fixed-point theorem about increasing functions is proved, and examples of its application in several areas of computing science are given. Some consequences are drawn for the design of concurrent algorithms, high-level programming languages, and fine-grained concurrent computer architectures.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133376332","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}
引用次数: 5
Transform a NIAM conceptual schema into a EKNE relational database scheme 将NIAM概念模式转换为EKNE关系数据库模式
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77228
Y. Zhang, M. Orlowska
{"title":"Transform a NIAM conceptual schema into a EKNE relational database scheme","authors":"Y. Zhang, M. Orlowska","doi":"10.1109/PARBSE.1990.77228","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77228","url":null,"abstract":"A system for enhancements of semantic methodologies for relational database design is described. In order to design a well-formed NIAM conceptual schema, dependency theory can be used as a heuristic tool to help the designer detect the derived fact types (FTs) in the NIAM conceptual schema. In order to design a minimal relational database schema, one can use dependency theory as a heuristic tool to find the candidate FTs for substitution, interact with the users to redesign the conceptual schema, and then transform it into an EKNF (elementary key normal form) relational database schema with the minimal number of relations. The proposed system is implemented using Turbo Pascal 5.5 on IBM PS2.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131359393","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
首页 上一页 下一页 尾页
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学术官方微信