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

1987 IEEE Third International Conference on Data Engineering最新文献

筛选
英文 中文
Fragmentation and query decomposition in the ECR model ECR模型中的碎片化和查询分解
1987 IEEE Third International Conference on Data Engineering Pub Date : 1987-02-03 DOI: 10.1109/ICDE.1987.7272413
R. Elmasri, P. Srinivas, G. Thomas
{"title":"Fragmentation and query decomposition in the ECR model","authors":"R. Elmasri, P. Srinivas, G. Thomas","doi":"10.1109/ICDE.1987.7272413","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272413","url":null,"abstract":"Fragmentation and query decomposition are considered important issues in a distributed database environment. For a semantic data model (ECR data model), the types of fragmentation and the criteria they should follow is provided along with how global queries in a high-level language, GORDAS, are decomposed into local queries on the fragments. This technique may be used in a heterogeneous distributed database, where the global schema presented to the user is in the high-level ECR model.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121950828","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}
引用次数: 4
A vertical partitioning algorithm for relational databases 关系数据库的垂直分区算法
1987 IEEE Third International Conference on Data Engineering Pub Date : 1987-02-03 DOI: 10.1109/ICDE.1987.7272353
Douglas W. Cornell, Philip S. Yu
{"title":"A vertical partitioning algorithm for relational databases","authors":"Douglas W. Cornell, Philip S. Yu","doi":"10.1109/ICDE.1987.7272353","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272353","url":null,"abstract":"In a relational database environment, transaction response time is likely to be affected by the time required to read the necessary data from secondary storage (disk). In cases where segment scans are used to a significant extent, vertical partitioning of the relation can result in a decrease in the number of disk accesses. The issue is how to set up the criterion for partitioning. In this paper, an optimal binary partitioning algorithm which can be recursively applied is developed. The algorithm is based on an integer linear programming technique to minimize the number of disk accesses. Performance analysis is provided to study the situation when partitioning can be beneficial and quantify the performance impact. This can also be used to demonstrate the superiority of the proposed algorithm as compared with a previously proposed partitioning scheme.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"4 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126039246","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}
引用次数: 90
Solution patterns for common data design problems 常见数据设计问题的解决方案模式
1987 IEEE Third International Conference on Data Engineering Pub Date : 1987-02-03 DOI: 10.1109/ICDE.1987.7272424
Andrew H. Wilson
{"title":"Solution patterns for common data design problems","authors":"Andrew H. Wilson","doi":"10.1109/ICDE.1987.7272424","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272424","url":null,"abstract":"After many years of experience in a variety of companies and industries, certain logical data design problems and solution patterns emerge as being common to most organizations. This paper discusses: ◯ the most common data design problems encountered in many organizations; and ◯ the data design patterns that have been successful in solving these problems.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124832892","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
Modeling asynchrony in distributed databases 分布式数据库中的异步建模
1987 IEEE Third International Conference on Data Engineering Pub Date : 1987-02-03 DOI: 10.1109/ICDE.1987.7272379
G. Wiederhold, Xiaolei Qian
{"title":"Modeling asynchrony in distributed databases","authors":"G. Wiederhold, Xiaolei Qian","doi":"10.1109/ICDE.1987.7272379","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272379","url":null,"abstract":"A new relationship type is proposed which permits describing the issues raised when information is distributed over autonomous workstations. Such federated environments are becoming the dominant form of distributed systems. Fully synchronous update of replicated data is not feasible in such systems. The proposed identity connection identifies data which should eventually match, but which can be in differing states for some time intervals. The concept permits modeling of the systems which are now becoming common in data processing.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125585160","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}
引用次数: 43
Concurrency control based on distributed cycle detection 基于分布式周期检测的并发控制
1987 IEEE Third International Conference on Data Engineering Pub Date : 1987-02-03 DOI: 10.1109/ICDE.1987.7272382
K. Sugihara
{"title":"Concurrency control based on distributed cycle detection","authors":"K. Sugihara","doi":"10.1109/ICDE.1987.7272382","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272382","url":null,"abstract":"This paper presents a novel optimistic concurrency control mechanism for distributed database systems. The optimistic concurrency control mechanism is based on a distributed algorithm for cycle detection which determines whether a transaction violates serializability or not. There are three advantages of this concurrency control mechanism. (1) It certifies execution of transactions in a distributed fashion and in parallel. (2) Local concurrency control is performed at each site independently. Global concurrency control verifies consistency of local concurrency control only when a transaction intends to commit. The separation of local and global concurrency controls enables us to integrate different local concurrency control mechanisms such as two-phase locking and timestamping into a single concurrency control mechanism. This is suitable for concurrency control in heterogeneous database systems. (3) No assumption is made on how data are distributed. It works in partially replicated database systems as well as in partitioned or fully replicated database systems.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127998977","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}
引用次数: 15
An optimistic concurrency control mechanism without freezing for distributed database systems 分布式数据库系统的一种不冻结的乐观并发控制机制
1987 IEEE Third International Conference on Data Engineering Pub Date : 1987-02-03 DOI: 10.1109/ICDE.1987.7272397
Lin Chiu, Ming T. Liu
{"title":"An optimistic concurrency control mechanism without freezing for distributed database systems","authors":"Lin Chiu, Ming T. Liu","doi":"10.1109/ICDE.1987.7272397","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272397","url":null,"abstract":"Optimistic concurrency control mechanisms have the tendency of freezing the system in order to validate a transaction at the end of the transaction's execution phase. This paper presents an optimistic concurrency control that does not freeze the database system. According to the property of conflicting transactions, concurrency control is divided into two counterparts. While one part is exercised at the data object, which responds instantly to consistency violation, the other part is exercised by messages flowing between transactions as background tasks. The whole system need not stop during the time concurrency control is exercising, nor during the time the system is restoring its state when consistency is violated. This makes the mechanism more attractive, since a higher degree of parallelism is provided between consistency control and transaction execution. An object-based model is used to present the mechanism in a distributed database system, in which communication relies heavily on message passing.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"192 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121184173","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
A version management method for distributed information 分布式信息的版本管理方法
1987 IEEE Third International Conference on Data Engineering Pub Date : 1987-02-03 DOI: 10.1109/ICDE.1987.7272425
H. Gladney, Douglas J. Lorch, R. Mattson
{"title":"A version management method for distributed information","authors":"H. Gladney, Douglas J. Lorch, R. Mattson","doi":"10.1109/ICDE.1987.7272425","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272425","url":null,"abstract":"Information networks in which workstations access central data collections primarily to extract information are a growing application segment. When a workstation is likely to use an item more than once it may be economical to retain a copy locally. We describe how to propagate updates for an arbitrary relationship between the source database and cached items when the network connection is intermittent, unreliable, and/or slow.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121465728","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
Concurrency control for relational databases 关系数据库的并发控制
1987 IEEE Third International Conference on Data Engineering Pub Date : 1987-02-03 DOI: 10.1109/ICDE.1987.7272394
H. Tirri, Kari-Jouko Räihä
{"title":"Concurrency control for relational databases","authors":"H. Tirri, Kari-Jouko Räihä","doi":"10.1109/ICDE.1987.7272394","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272394","url":null,"abstract":"A transaction model for relational databases is presented. The model is more realistic than the traditional entity based model, since it takes into consideration the special information available in the relational model and in the transactions of a given transaction set. Therefore the model can serve as the basis of an implementation, unlike in the present situation, where implementations must rely on ad hoc techniques or physical level concepts. A concurrency control method is developed based on the transaction model. The method is reminiscent of precision locking, but again it is tailored for the relational model. An efficient implementation of the method is outlined.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131606235","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
Efficient recursive query processing using wavefront methods 使用波前方法的高效递归查询处理
1987 IEEE Third International Conference on Data Engineering Pub Date : 1987-02-03 DOI: 10.1109/ICDE.1987.7272435
Clement T. Yu, Weining Zhang
{"title":"Efficient recursive query processing using wavefront methods","authors":"Clement T. Yu, Weining Zhang","doi":"10.1109/ICDE.1987.7272435","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272435","url":null,"abstract":"In this paper, we study the optimization of linear recursive queries using wavefront methods. The following results are obtained.(i) In spite of seemingly reasonable approach of the wavefront methods, certain linear recursive queries are not processed efficiently or correctly.(ii) A characterization of the expressions generated by linear recursive rules is given. Properties of the expressions will be useful for efficient processing of linear recursive queries.(iii) Conditions for efficient processing of linear recursive rules using wavefront methods with the properties given in (ii) are provided.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131267055","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
A termination protocol for simple network partitioning in distributed database systems 分布式数据库系统中简单网络分区的终止协议
1987 IEEE Third International Conference on Data Engineering Pub Date : 1987-02-03 DOI: 10.1109/ICDE.1987.7272412
Ching-Liang Huang, V. Li
{"title":"A termination protocol for simple network partitioning in distributed database systems","authors":"Ching-Liang Huang, V. Li","doi":"10.1109/ICDE.1987.7272412","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272412","url":null,"abstract":"Resilient commit protocols for multisite simple network partitioning are studied in this paper. The necessity of termination protocols to make commit protocols resilient in multisite simple network partitioning is presented. A termination protocol that makes the three-phase commit protocol resilient is designed. This protocol is valid even for transient network partitioning. The method can be generalized to design termination protocols for other commit protocols in multisite simple network partitioning.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131269924","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信