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

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

筛选
英文 中文
Optimization of distributed processing by using a flexible data distribution mechanism 通过使用灵活的数据分发机制优化分布式处理
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77178
S. Jablonski, T. Ruf, H. Wedekind
{"title":"Optimization of distributed processing by using a flexible data distribution mechanism","authors":"S. Jablonski, T. Ruf, H. Wedekind","doi":"10.1109/PARBSE.1990.77178","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77178","url":null,"abstract":"The authors introduce and discuss a generalized model for distributed data processing. Data communication is split up into two steps: the offering of information by sending subapplications and its acceptance by receiving subapplications. For both communication steps, synchronous and asynchronous processing modes are defined. Supporting these different communication modes, the cooperation between subapplications can be defined very closely with respect to the specific demands of the overall application system. This optimizes distributed data processing. The authors demonstrate the prototype implementation of a distributed data management system based on the flexible communication mechanism considered here.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"82 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":"134232864","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
Dynamic scheduling of DOACROSS loops for multiprocessors 多处理器DOACROSS循环的动态调度
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77118
V. P. Krothapalli, P. Sadayappan
{"title":"Dynamic scheduling of DOACROSS loops for multiprocessors","authors":"V. P. Krothapalli, P. Sadayappan","doi":"10.1109/PARBSE.1990.77118","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77118","url":null,"abstract":"The authors address the problem of parallel execution of DOACROSS loops with complex inter-iteration dependences. Rather than treat the scheduling of such loops and their synchronization as distinct and separable issues, the authors treat synchronization and scheduling in a unified framework. The resulting approach is referred to as presynchronized scheduling. The approach is illustrated in the context of DOACROSS loops with regular inter-iteration dependences, as well as with loops that have irregular dependence patterns determinable only at runtime. The scheme is evaluated by implementing a sparse triangular solver on an Encore Multimax shared-memory multiprocessor.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"59 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":"121784481","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}
引用次数: 13
Development of an efficient data structure for solving semantic queries related to cartographic database 开发一种有效的数据结构，用于解决与地图数据库相关的语义查询
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77123
B.B. Pal, S. Bhattacharya
{"title":"Development of an efficient data structure for solving semantic queries related to cartographic database","authors":"B.B. Pal, S. Bhattacharya","doi":"10.1109/PARBSE.1990.77123","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77123","url":null,"abstract":"The authors present a method of determining with certainty the status of point features in relation to area features, both defined by a common coordinate system. The proposed mathematical model claims a generality in approach and applications so as to elicit intelligent semantic responses to the queries related to intersection or union of two or more area features bounded by curves bearing no declared geometric relation between them. As a further development, an object-oriented data structure has been envisaged to cope with a demand for increased computational efficiency.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"88 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":"124379985","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
The use of integrity constraints to perform query transformations in relational databases 使用完整性约束在关系数据库中执行查询转换
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77124
J. Cardiff
{"title":"The use of integrity constraints to perform query transformations in relational databases","authors":"J. Cardiff","doi":"10.1109/PARBSE.1990.77124","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77124","url":null,"abstract":"A novel approach to semantic query optimization is presented. Integrity constraints stored in relational tables are used to transform the original query into a semantically equivalent one. The transformations performed reduce either the computation costs, or the number of database accesses, or both and so will generally produce a query that is faster to execute. Three types of integrity constraints are used by the transformation algorithms: constraints of the domains of the attributes, general rules between attributes, and constraints on the relationships between join-compatible attributes. The algorithms that use these constraints to transform the query run in polynomial time and require limited database access. In large database systems, where the number of databases accesses is the dominant cost factor, the optimization costs typically represent a small fraction of the total execution cost.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"15 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":"128788472","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
Molecular dynamics on transputer arrays 跨计算机阵列上的分子动力学
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77216
J. Perram, H.G. Petersen
{"title":"Molecular dynamics on transputer arrays","authors":"J. Perram, H.G. Petersen","doi":"10.1109/PARBSE.1990.77216","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77216","url":null,"abstract":"The implementation of a molecular dynamics simulation on a 10 transputer system is reported. The implementation exploits fully the geometric parallelism of the problem. A simple model of the computing and communications overheads leads to predictions of the optimal scaling of the problem size with the number of processors. The implementation exploits fully the domain decomposition paradigm in which load balancing is guaranteed by the compressibility theorem of statistical mechanics.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"13 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":"130657811","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
Concept of checking integrity constraints in cellular network relational databases 蜂窝网络关系数据库完整性约束检查的概念
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77132
J. Chudziak
{"title":"Concept of checking integrity constraints in cellular network relational databases","authors":"J. Chudziak","doi":"10.1109/PARBSE.1990.77132","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77132","url":null,"abstract":"A fully parallel algorithm for checking generalized dependencies in relational databases implemented in cellular arrays is presented. The author defines mappings between general dependencies given in a tabular notation and the special structure in cellular arrays, and then he introduces an algorithm operating in an associative way. He then shows how this algorithm operates for some types of dependencies. It is suggested that any complete DBMS (database management system) can be efficiently implemented in the cellular array architecture as a VLSI chip.<<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":"130715820","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
Parallel processing of deductive databases on a commercial multiprocessor 在商用多处理机上并行处理演绎数据库
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77214
M. Nussbaum, M. Annaratone, R. Holliger
{"title":"Parallel processing of deductive databases on a commercial multiprocessor","authors":"M. Nussbaum, M. Annaratone, R. Holliger","doi":"10.1109/PARBSE.1990.77214","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77214","url":null,"abstract":"A processing strategy for large knowledge bases, which features large granularity of computation because it works with relations, has been proposed. The performance behavior of this strategy was tested on a parallel processor; specifically, it was implemented on a Sequent Symmetry S81. The data-partitioning parallelization approach was used. Experimental results show that real problems have unbalanced trees, therefore increasing the difficulty in the use of the available parallelism. The balanced parallelism can be artificially increased by partitioning the extensional database. This allows not only a better load balancing in the multiprocessor, but also faster join and union operations, which greatly affect performance.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"88 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":"127447356","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
Capture database semantics by rule induction 通过规则归纳捕获数据库语义
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77147
W. Chu, R. Lee
{"title":"Capture database semantics by rule induction","authors":"W. Chu, R. Lee","doi":"10.1109/PARBSE.1990.77147","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77147","url":null,"abstract":"To capture database characteristics, a knowledge-based entity-relationship (KER) model is proposed to extend the basic ER model by P.P.S. Chen (see ACM Trans. Database Syst., vol.1, no.1 (1976)) to provide knowledge specification capability. The knowledge specification capability allows database characteristics to be specified and maintained with each object definition. In the KER model, each entity or relationship has its specific characteristics. These characteristics can be classified into intraobject knowledge and interobject knowledge. Intraobject knowledge specifies how an object instance belongs to an entity type, and interobject knowledge describes how objects are correlated with each other when they are bounded by the same relationship. Instances of the database objects have to follow these rules since each database state is an instance of the application. Therefore, semantic knowledge can be induced from the database instances by machine learning based on the schema specified in the KER model. A knowledge acquisition methodology that is based upon the KER Model and machine learning techniques is developed to induce the database characteristics knowledge from the database.<<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":"129550147","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
Fault tolerance of message delivery with cascading copies 具有级联副本的消息传递的容错性
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77144
H. Al-Jaber, S. Rotenstreich
{"title":"Fault tolerance of message delivery with cascading copies","authors":"H. Al-Jaber, S. Rotenstreich","doi":"10.1109/PARBSE.1990.77144","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77144","url":null,"abstract":"The authors present a fault-tolerance algorithm that guarantees the delivery of a message to its destination despite faults in one or more nodes in a system of loosely coupled processors. This algorithm is distinguished by not using the extra hardware or checkpoint facilities that are common to many algorithms of its type. Instead, it maintains an appropriate number of copies of the message in the nodes through which the message passes. In the case of a fault, the algorithm locates a copy of the message closest to the destination and resumes delivery of the message from this location. Failure detection and recovery are automatic and transparent to the users. The algorithm can be implemented on diskless systems, such as specialized real-time systems or parallel processing systems that use interconnection networks (e.g. a hypercube).<<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":"132751752","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 comparison of transaction restart techniques in a distributed database environment 分布式数据库环境中事务重启技术的比较
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77191
M. Rusinkiewicz, E.L. Leiss, R. Dubash
{"title":"A comparison of transaction restart techniques in a distributed database environment","authors":"M. Rusinkiewicz, E.L. Leiss, R. Dubash","doi":"10.1109/PARBSE.1990.77191","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77191","url":null,"abstract":"The authors present the results of a simulation study carried out to compare the effects of different restart techniques on the overall throughput, number of restarts, average response time, and average communication delay in representative distributed database environments. The performances of the following transaction restart methods are compared: (1) restart with random increase of timestamp, (2) restart with random delay, (3) data-marking method, (4) data marking with random delay, and (5) restart with a substitute transaction. The substitute transaction method is shown to perform well under all loads, except for the case in which all transactions are update-only. In this case, restart with a random delay performs better. The data-marking method introduces a very high communication overhead owing to the fact that the transactions keep sending messages requesting operations when an item is not available. This results in high response times and in an erratic behavior of the system under higher loads.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"27 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":"133782412","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
首页 上一页 下一页 尾页
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学术官方微信