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

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

筛选
英文 中文
2PC Agent method: achieving serializability in presence of failures in a heterogeneous multidatabase 2PC代理方法:在异构多数据库中出现故障时实现可序列化性
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77157
A. Wolski, J. Veijalainen
{"title":"2PC Agent method: achieving serializability in presence of failures in a heterogeneous multidatabase","authors":"A. Wolski, J. Veijalainen","doi":"10.1109/PARBSE.1990.77157","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77157","url":null,"abstract":"A method for integrated concurrency control and recovery, applicable to heterogeneous multidatabase systems, is proposed. The responsibility for two-phase local commitment and recovery of the prepared state at participants is taken over by an entity called 2PC Agent. The main importance of the method is in preserving global serializability in the presence of a certain class of participant-related failures. The related recovery methods, including a novel failure-time optimistic concurrency control method, are presented.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"12 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":"115107875","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}
引用次数: 98
A predicate-calculus based language for semantic databases 一种基于谓词演算的语义数据库语言
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77169
N. Rishe, Wei Sun
{"title":"A predicate-calculus based language for semantic databases","authors":"N. Rishe, Wei Sun","doi":"10.1109/PARBSE.1990.77169","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77169","url":null,"abstract":"The author proposes a nonprocedural language for semantic databases in general and for the semantic binary model in particular. The foundation of the language is a database interpretation of a first-order predicate calculus. The calculus is enriched with second-order constructs for aggregation (statistical functions), specification of transactions, parameterized query forms, and other uses. The language is called SD-Calculus (Semantic Database Calculus). Of special interest is the use of this language for specification of bulk transactions, including generation of sets of new abstract objects. Implementation of the language is discussed.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"83 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":"133769063","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
The Siftsort algorithm sifsort算法
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77196
J. Bentin, J. Modi
{"title":"The Siftsort algorithm","authors":"J. Bentin, J. Modi","doi":"10.1109/PARBSE.1990.77196","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77196","url":null,"abstract":"A description is given of Siftsort, a highly parallel algorithm, which takes O(log/sup 2//sub 2/ n) steps to sort n items of data on fewer than n log/sub 2/ n processors. Although a comparison-exchange algorithm, it separates out the comparisons from the exchanges, with an intermediate logical step of selectively annihilating-that is, sifting-an array representing the results of comparisons. The algorithm proceeds by successive sweeps, with each sweep consisting of three stages: comparison, sifting, and exchange. Unlike Batcher's sort, the method is robust against random errors occurring in the sorting process.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"44 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":"121731800","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
Reconfigurable systolic architectures for hashing 用于哈希的可重构收缩架构
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77209
G. Panneerselvam, G. Jullien, S. Bandyopadhyay, W. Miller
{"title":"Reconfigurable systolic architectures for hashing","authors":"G. Panneerselvam, G. Jullien, S. Bandyopadhyay, W. Miller","doi":"10.1109/PARBSE.1990.77209","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77209","url":null,"abstract":"The authors develop a novel technique in which concepts of both bucketing and open addressing schemes are modified in such a manner that they can be suitable for VLSI/WSI implementation, namely, dynamically reconfigurable hash tables. In this method, finite storage is allocated for each bucket. Instead of searching the entire table or a part of the table for an empty storage place, the overflowing synonyms are inserted into the successor's bucket (next to the home bucket). If the successor's bucket overflows, the same technique is repeated until the table is stable. The host bucket takes care of all the relative operations for its guest items. As soon as an empty place arises in the original bucket, the host bucket returns the guest element to the original bucket: in essence, dynamically variable capacity buckets have been created. These buckets are designed using systolic arrays.<<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":"122074569","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
Pipelining in query execution 查询执行中的流水线
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77227
A. N. Wilschut, P. Apers
{"title":"Pipelining in query execution","authors":"A. N. Wilschut, P. Apers","doi":"10.1109/PARBSE.1990.77227","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77227","url":null,"abstract":"It is shown that the use of an adjusted algorithm can improve the performance of a nested query execution containing join operations. Apart from the equijoin, the union, Cartesian product, Theta -join, and intersection operations can be implemented in a pipelining way. The difference, however, cannot be implemented in this way. The proposed algorithms are implemented in PRISMA/DB.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"475 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":"123554907","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}
引用次数: 70
A perfect speedup parallel algorithm for the assignment problem on complete weighted bipartite graphs 完全加权二部图分配问题的一种完美加速并行算法
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77154
Constantine N. K. Osiakwan, S. Akl
{"title":"A perfect speedup parallel algorithm for the assignment problem on complete weighted bipartite graphs","authors":"Constantine N. K. Osiakwan, S. Akl","doi":"10.1109/PARBSE.1990.77154","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77154","url":null,"abstract":"The authors present an adaptive parallel algorithm for the assignment problem on complete weighted bipartite graphs, where the edge weights can be real valued and negative. The algorithm is designed using the exclusive-read, exclusive-write parallel random-access machine (EREW PRAM) model of parallel computation. For a complete weighted bipartite graph of n vertices, the algorithm runs in O(n/sup 3//p+n/sup 2/p) time using p processors. The authors obtain a perfect speedup, with respect to the O(n/sup 3/) Hungarian method, for p<or= square root eta , where eta is the cardinality of the larger partite set.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"18 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":"121966557","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}
引用次数: 7
The architecture and implementation of ENLI: example-based natural language-assisted interface ENLI的体系结构和实现:基于示例的自然语言辅助接口
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77170
M. El-Sharkawi, Y. Kambayashi
{"title":"The architecture and implementation of ENLI: example-based natural language-assisted interface","authors":"M. El-Sharkawi, Y. Kambayashi","doi":"10.1109/PARBSE.1990.77170","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77170","url":null,"abstract":"The architecture and implementation of a user interface called ENLI are presented. The interface supports an English-like query language. It is easy to implement and avoids problems in building natural language interfaces. Its core component consists of two translators, from ENLI to QBE and from QBE to SQL. ENLI considers several aspects of man-machine interaction. It supports different levels of users, and it generates a nested form of an unnested SQL query. This nested form is used to document and edit the query. Procedures for generating nested queries for unnested tree and cyclic queries are also described.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"4 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":"125196293","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
A vectorization technique of hashing and its application to several sorting algorithms 哈希矢量化技术及其在几种排序算法中的应用
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77135
Y. Kanada
{"title":"A vectorization technique of hashing and its application to several sorting algorithms","authors":"Y. Kanada","doi":"10.1109/PARBSE.1990.77135","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77135","url":null,"abstract":"A vectorized algorithm for entering data into a hash table is presented. A program that enters multiple data could not be executed on vector processors by conventional vectorization techniques because of data dependences. The proposed method enables execution of multiple data entry by conventional vector processors and improves the performance by a factor of 12.7, compared with the normal sequential method, when 4099 pieces of data are entered on the Hitachi S-810. This method is applied to address calculation sorting and the distribution counting sort, whose main part was unvectorizable by previous techniques. It improves performance by a factor of 12.8 when n=2/sup 14/ on the S-810.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"14 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":"125459177","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}
引用次数: 7
The semantics of commutativity in the execution of concurrent transactions 并发事务执行中可交换性的语义
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77211
L. Latour, R. Tindell
{"title":"The semantics of commutativity in the execution of concurrent transactions","authors":"L. Latour, R. Tindell","doi":"10.1109/PARBSE.1990.77211","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77211","url":null,"abstract":"It is pointed out that a precise understanding of user process semantics is crucial to the design of schedulers for concurrent transactions. Although a scheduler that is at least sufficient to maintain database correctness must be designed, a more precise understanding of user process semantics will make it possible to identify and make use of additional properties maintained by the scheduler and assist in better understanding of how to improve the scheduling algorithm to allow a higher degree of user process concurrency. A precise formal model of these semantics, which is unique in that it incorporates any local processing required to produce an updated item in a function of the write request associated with that update, has been developed. This makes it possible to deal directly with the semantic content of schedules, rather than indirectly through commutativity rules.<<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":"130078533","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
Extending n-version programming to concurrent software 将n版本编程扩展到并发软件
Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications Pub Date : 1990-03-07 DOI: 10.1109/PARBSE.1990.77198
P.C. Buechler, E. Fernández
{"title":"Extending n-version programming to concurrent software","authors":"P.C. Buechler, E. Fernández","doi":"10.1109/PARBSE.1990.77198","DOIUrl":"https://doi.org/10.1109/PARBSE.1990.77198","url":null,"abstract":"The authors propose three different constructs which extend the n-version programming (NVP) concept to concurrent NVP (CNVP): process-dissimilar CNVP, subprogram-dissimilar CNVP, and structure-dissimilar CNVP. Each of these three constructs is a corollary to one of the three concurrent recovery block constructs.<<ETX>>","PeriodicalId":389644,"journal":{"name":"Proceedings. PARBASE-90: International Conference on Databases, Parallel Architectures, and Their Applications","volume":"2 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":"128822874","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学术官方微信