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

Proceedings. Fourth International Conference on Data Engineering最新文献

筛选
英文 中文
Data allocation in a dynamically reconfigurable environment 动态可重构环境中的数据分配
Proceedings. Fourth International Conference on Data Engineering Pub Date : 1988-02-01 DOI: 10.1109/ICDE.1988.105448
Xiaoli Du, F. Maryanski
{"title":"Data allocation in a dynamically reconfigurable environment","authors":"Xiaoli Du, F. Maryanski","doi":"10.1109/ICDE.1988.105448","DOIUrl":"https://doi.org/10.1109/ICDE.1988.105448","url":null,"abstract":"The authors address the data allocation problem in a dynamically reconfigurable distributed database system. Following the description of the system model and the consequences of node movement, several dynamic allocation strategies are presented. A distributed candidate-selection algorithm using the data from the accounting system in the database servers is proposed to reduce the number of files and nodes considered in reallocation. The allocation algorithms choose the optimal assignment using heuristic benefit functions and greedy search strategy. The experimental results demonstrate the accuracy and efficiency of the allocation algorithms.<<ETX>>","PeriodicalId":243420,"journal":{"name":"Proceedings. Fourth International Conference on Data Engineering","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134590019","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}
引用次数: 19
An optimization strategy for recursive queries in logic databases 逻辑数据库递归查询的优化策略
Proceedings. Fourth International Conference on Data Engineering Pub Date : 1988-02-01 DOI: 10.1109/ICDE.1988.105493
S. Sippu, E. Soisalon-Soininen
{"title":"An optimization strategy for recursive queries in logic databases","authors":"S. Sippu, E. Soisalon-Soininen","doi":"10.1109/ICDE.1988.105493","DOIUrl":"https://doi.org/10.1109/ICDE.1988.105493","url":null,"abstract":"Considers the optimization of recursive database queries expressed in Datalog (function-free Horn clause programs). The authors present a general strategy for rewriting a Datalog program to cut down the number of database facts consulted in the bottom-up evaluation of queries containing bound arguments. The strategy can be interpreted as a preprocessing task in which an 'envelope' containing the facts relevant to the query is determined by computing an easily evaluable query, and then the original query is applied to facts belonging to this envelope, which usually is only a small subset of all facts. The strategy applies to any Datalog program, and there exists a variant of the basic strategy that always produces 'regular envelopes' that can be determined using a regularly recursive program.<<ETX>>","PeriodicalId":243420,"journal":{"name":"Proceedings. Fourth International Conference on Data Engineering","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131440125","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}
引用次数: 17
An adaptive checkpointing scheme for distributed databases with mixed types of transactions 具有混合事务类型的分布式数据库的自适应检查点方案
Proceedings. Fourth International Conference on Data Engineering Pub Date : 1988-02-01 DOI: 10.1109/ICDE.1988.105500
S. Son
{"title":"An adaptive checkpointing scheme for distributed databases with mixed types of transactions","authors":"S. Son","doi":"10.1109/ICDE.1988.105500","DOIUrl":"https://doi.org/10.1109/ICDE.1988.105500","url":null,"abstract":"A checkpointing algorithm is presented that does not interfere with transaction processing. The correctness of the algorithm is shown, and the robustness of the algorithm and the recovery procedures associated with it are discussed. The algorithm provides a practical solution to the problem of checkpointing and recovery in distributed database systems.<<ETX>>","PeriodicalId":243420,"journal":{"name":"Proceedings. Fourth International Conference on Data Engineering","volume":"415 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131553152","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
Efficient reordering of Prolog programs Prolog程序的有效重新排序
Proceedings. Fourth International Conference on Data Engineering Pub Date : 1988-02-01 DOI: 10.1109/ICDE.1988.105452
M. Gooley, B. Wah
{"title":"Efficient reordering of Prolog programs","authors":"M. Gooley, B. Wah","doi":"10.1109/ICDE.1988.105452","DOIUrl":"https://doi.org/10.1109/ICDE.1988.105452","url":null,"abstract":"The authors show how reordering of Prolog clauses, and especially goals, can prevent unnecessary search. They characterize the restrictions on reordering and show how they may be detected. They design a system of calling modes for Prolog, geared to reordering and discuss ways to infer them automatically. They present an improved method for determining a good goal order for Prolog clauses, and use it as the basis for a reordering system, showing how it can be guided by information about modes and restrictions to generate reordered Prolog that behaves correctly.<<ETX>>","PeriodicalId":243420,"journal":{"name":"Proceedings. Fourth International Conference on Data Engineering","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122151924","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}
引用次数: 23
An effective method for integrity constraint simplification 一种有效的完整性约束简化方法
Proceedings. Fourth International Conference on Data Engineering Pub Date : 1988-02-01 DOI: 10.1109/ICDE.1988.105477
Xiaolei Qian
{"title":"An effective method for integrity constraint simplification","authors":"Xiaolei Qian","doi":"10.1109/ICDE.1988.105477","DOIUrl":"https://doi.org/10.1109/ICDE.1988.105477","url":null,"abstract":"A description is given of a very effective method for the syntax-directed simplification of multirelation, multivariable, aggregate-free integrity constraints against a fairly general class of multirelation update transactions with partial specifications. Compared with other work, the approach covers a wider range of update transactions and integrity constraints, and explores more optimization opportunities with no more effort. The method is both a uniform generalization of previous research and a basis for examining arbitrary update transactions.<<ETX>>","PeriodicalId":243420,"journal":{"name":"Proceedings. Fourth International Conference on Data Engineering","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116966702","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}
引用次数: 38
Queries in object-oriented databases 面向对象数据库中的查询
Proceedings. Fourth International Conference on Data Engineering Pub Date : 1988-02-01 DOI: 10.1109/ICDE.1988.105443
J. Banerjee, Won Kim, Kyung-Chang Kim
{"title":"Queries in object-oriented databases","authors":"J. Banerjee, Won Kim, Kyung-Chang Kim","doi":"10.1109/ICDE.1988.105443","DOIUrl":"https://doi.org/10.1109/ICDE.1988.105443","url":null,"abstract":"A query under an object-oriented data model exhibits characteristics which one finds in a relational query and those which clearly separate it from a relational query. The differences in turn have interesting impacts on the complexity of and strategy for query evaluation in object-oriented databases. The authors develop a model of a query under an object-oriented data model, and analyze the fundamental differences in the semantics of queries in object-oriented databases and relational databases.<<ETX>>","PeriodicalId":243420,"journal":{"name":"Proceedings. Fourth International Conference on Data Engineering","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114946077","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}
引用次数: 182
Incremental restructuring of relational schemas 关系模式的增量重组
Proceedings. Fourth International Conference on Data Engineering Pub Date : 1988-02-01 DOI: 10.1109/ICDE.1988.105470
V. Markowitz, J. Makowsky
{"title":"Incremental restructuring of relational schemas","authors":"V. Markowitz, J. Makowsky","doi":"10.1109/ICDE.1988.105470","DOIUrl":"https://doi.org/10.1109/ICDE.1988.105470","url":null,"abstract":"Entity-relationship (ER) consistency is defined, and a complete set of incremental and reversible restructuring manipulations is proposed for ER-consistent relational schemas. It is shown how the schema restructuring manipulations that are proposed back both interactive and view-integration methodologies for schema design.<<ETX>>","PeriodicalId":243420,"journal":{"name":"Proceedings. Fourth International Conference on Data Engineering","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131620956","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
PL-a probabilistic logic 概率逻辑
Proceedings. Fourth International Conference on Data Engineering Pub Date : 1988-02-01 DOI: 10.1109/ICDE.1988.105492
Arie Tzvieli
{"title":"PL-a probabilistic logic","authors":"Arie Tzvieli","doi":"10.1109/ICDE.1988.105492","DOIUrl":"https://doi.org/10.1109/ICDE.1988.105492","url":null,"abstract":"A description is given of a logic called PL, which uses probability estimates to express uncertainties (without adopting the conventional probability axioms). The author proposes a generalization of the logical interpretations of the connectives and quantifiers to this case. The notions of a formula, a structure, assignment, satisfaction, deduction, etc., are generalizations of the corresponding first-order ones. A method of assigning semantics to PL is proposed, and some of its properties are studied. The soundness and completeness of PL is studied. In particular, PL is shown to be compatible with the first-order predicate calculus.<<ETX>>","PeriodicalId":243420,"journal":{"name":"Proceedings. Fourth International Conference on Data Engineering","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133246595","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
Optimal communication topologies for atomic commitment 原子提交的最佳通信拓扑
Proceedings. Fourth International Conference on Data Engineering Pub Date : 1988-02-01 DOI: 10.1109/ICDE.1988.105445
A. Segall, O. Wolfson
{"title":"Optimal communication topologies for atomic commitment","authors":"A. Segall, O. Wolfson","doi":"10.1109/ICDE.1988.105445","DOIUrl":"https://doi.org/10.1109/ICDE.1988.105445","url":null,"abstract":"The authors consider distributed algorithms that achieve transaction commitment at minimal communication cost but differ in the time it takes them to reach consensus. Based on this criterion, the authors define a 'better than' partial ranking of minimal-communication-cost algorithms. They also discuss alternatives of a simple, minimal-communication-cost algorithm introduced previously, called TREE-COMMIT.<<ETX>>","PeriodicalId":243420,"journal":{"name":"Proceedings. Fourth International Conference on Data Engineering","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133797515","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 performance comparison of two architectures for fast transaction processing 两种快速事务处理体系结构的性能比较
Proceedings. Fourth International Conference on Data Engineering Pub Date : 1988-02-01 DOI: 10.1109/ICDE.1988.105501
A. Bhide, M. Stonebraker
{"title":"A performance comparison of two architectures for fast transaction processing","authors":"A. Bhide, M. Stonebraker","doi":"10.1109/ICDE.1988.105501","DOIUrl":"https://doi.org/10.1109/ICDE.1988.105501","url":null,"abstract":"Investigates the issues involved in using multiprocessors for transaction processing. The authors use a simulation model to study the behavior of two different architectures, namely shared everything and shared nothing. In shared everything, any processor can access any disk and all memory is shared. In shared nothing, neither disks nor memory is shared. They study the effects of data contention and resource contention in both of these architectures. They quantify the effects of intraquery parallelism on both architectures under different operating conditions.<<ETX>>","PeriodicalId":243420,"journal":{"name":"Proceedings. Fourth International Conference on Data Engineering","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133288427","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}
引用次数: 50
首页 上一页 下一页 尾页
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学术官方微信