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

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

筛选
英文 中文
Can we meaningfully integrate drawing, text, image and voice with structured data? 我们能否有意义地将绘图、文本、图像和语音与结构化数据集成在一起?
Proceedings. Fourth International Conference on Data Engineering Pub Date : 1988-02-01 DOI: 10.1109/ICDE.1988.105508
A. Sheth, J. Larson, W. Luther, B. Phillips, R. A. Yost
{"title":"Can we meaningfully integrate drawing, text, image and voice with structured data?","authors":"A. Sheth, J. Larson, W. Luther, B. Phillips, R. A. Yost","doi":"10.1109/ICDE.1988.105508","DOIUrl":"https://doi.org/10.1109/ICDE.1988.105508","url":null,"abstract":"Covers application as well as system aspects of managing and integrating unstructured and structured data. Problems of representation, features, and abstraction are discussed. Other aspects considered are browsing unstructured data and multimedia systems and text.<<ETX>>","PeriodicalId":243420,"journal":{"name":"Proceedings. Fourth International Conference on Data Engineering","volume":"14 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":"115263282","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
Efficient dynamic voting algorithms 高效动态投票算法
Proceedings. Fourth International Conference on Data Engineering Pub Date : 1988-02-01 DOI: 10.1109/ICDE.1988.105469
Jehan-Francois Pâris, D. Long
{"title":"Efficient dynamic voting algorithms","authors":"Jehan-Francois Pâris, D. Long","doi":"10.1109/ICDE.1988.105469","DOIUrl":"https://doi.org/10.1109/ICDE.1988.105469","url":null,"abstract":"Two novel dynamic voting algorithms are proposed. One, called optimistic dynamic voting, operates on possibly out-of-date information, which greatly increases the efficiency of the algorithm and simplifies its implementation. The other, called topological dynamic voting, explicitly takes into account the topology of the network on which the copies reside to increase the availability of the replicated data. The authors compare availabilities of replicated data managed by both algorithms with those of data managed by existing voting protocols using a simulation model with realistic parameters. Optimistic dynamic voting is found to perform as well as the best existing voting algorithms while topological dynamic voting performs much better than all other voting algorithms when two or more copies reside in the same nonpartitionable group.<<ETX>>","PeriodicalId":243420,"journal":{"name":"Proceedings. Fourth International Conference on Data Engineering","volume":"77 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":"116521416","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
Extending an assumption based truth maintenance system to databases 将基于假设的真值维护系统扩展到数据库
Proceedings. Fourth International Conference on Data Engineering Pub Date : 1988-02-01 DOI: 10.1109/ICDE.1988.105479
M. R. Kanth, P. Bose
{"title":"Extending an assumption based truth maintenance system to databases","authors":"M. R. Kanth, P. Bose","doi":"10.1109/ICDE.1988.105479","DOIUrl":"https://doi.org/10.1109/ICDE.1988.105479","url":null,"abstract":"A description is given of how information stored in databases can be used to support reasoning using an assumption-based reasoning system with truth maintenance. The basic notion behind this type of reasoning is that the problem solver can draw inferences on the basis of assumptions in the absence of information to the contrary. These inferences are nonmonotonic, in the sense they may be contradicted by update to the information base and hence lose their validity status. The objective is to describe some techniques for maintenance in databases to extend an assumption based truth maintenance system to make use of large amounts of data stored in databases. There are two levels of truth maintenance taking place in the system. Truth maintenance occurs at the level of the database and at the level of explicit facts derived or asserted. The focus is on the computational techniques that are necessary at the former level.<<ETX>>","PeriodicalId":243420,"journal":{"name":"Proceedings. Fourth International Conference on Data Engineering","volume":"82 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":"115721928","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
Ensuring data security and integrity with a fast stable storage 通过快速稳定的存储，保证数据的安全性和完整性
Proceedings. Fourth International Conference on Data Engineering Pub Date : 1988-02-01 DOI: 10.1109/ICDE.1988.105471
M. Banâtre, Gilles Muller, J. Banâtre
{"title":"Ensuring data security and integrity with a fast stable storage","authors":"M. Banâtre, Gilles Muller, J. Banâtre","doi":"10.1109/ICDE.1988.105471","DOIUrl":"https://doi.org/10.1109/ICDE.1988.105471","url":null,"abstract":"An active, RAM-based stable storage board is described. The stable storage board is intended to make it relatively fast to access data structures, and contains features to guard against incorrect access from a faulty processor or from an errant program. Basic performance data are presented and potential applications are described.<<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":"124140977","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
Knowledge base views in multiuser knowledge based systems 多用户知识系统中的知识库视图
Proceedings. Fourth International Conference on Data Engineering Pub Date : 1988-02-01 DOI: 10.1109/ICDE.1988.105478
A. Basu
{"title":"Knowledge base views in multiuser knowledge based systems","authors":"A. Basu","doi":"10.1109/ICDE.1988.105478","DOIUrl":"https://doi.org/10.1109/ICDE.1988.105478","url":null,"abstract":"The author presents a methodology for representing knowledge in a collection of interlinked, largely autonomous knowledge base views, to facilitate multiple heterogeneous use of a KBS (knowledge based system). The knowledge base views are defined so that while knowledge outside each user's view is transparent to him/her, problem solving can be achieved using knowledge from multiple views. Furthermore, integrity and consistency between views can be maintained.<<ETX>>","PeriodicalId":243420,"journal":{"name":"Proceedings. Fourth International Conference on Data Engineering","volume":"354 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":"123546979","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}
引用次数: 8
Distributed query processing optimization objectives 分布式查询处理优化目标
Proceedings. Fourth International Conference on Data Engineering Pub Date : 1988-02-01 DOI: 10.1109/ICDE.1988.105475
P. Bodorik, J. Riordon
{"title":"Distributed query processing optimization objectives","authors":"P. Bodorik, J. Riordon","doi":"10.1109/ICDE.1988.105475","DOIUrl":"https://doi.org/10.1109/ICDE.1988.105475","url":null,"abstract":"The authors examine objectives, or measures of cost, which can be used in optimizing queries in a distributed database (DDB). They include the delay and dollar cost due to the network data transfer, CPU processing or a combination of both, and cost measures in terms of the size of partial results. These measures are used in distributed query processing modeling on a testbed of queries to examine the effect of choosing one measure of cost in optimizing strategies on their cost expressed in other measures and the cost of strategies generated by a two-phased approach. Results indicate that best strategies are generated when optimization considers cost measured in terms of both CPU processing and a network data transfer. They also confirm that the two-phased optimization yields close to optimal strategies.<<ETX>>","PeriodicalId":243420,"journal":{"name":"Proceedings. Fourth International Conference on Data Engineering","volume":"47 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":"127225083","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}
引用次数: 22
Site assignment for relations and joint operations in the distributed transaction processing environment 分布式事务处理环境中关系和联合操作的站点分配
Proceedings. Fourth International Conference on Data Engineering Pub Date : 1988-02-01 DOI: 10.1109/ICDE.1988.105451
Douglas W. Cornell, Philip S. Yu
{"title":"Site assignment for relations and joint operations in the distributed transaction processing environment","authors":"Douglas W. Cornell, Philip S. Yu","doi":"10.1109/ICDE.1988.105451","DOIUrl":"https://doi.org/10.1109/ICDE.1988.105451","url":null,"abstract":"An integrated strategy for choosing the sites where relations are to be stored while simultaneously determining where joint operations are to take place is considered. Based on the transaction characteristic and arrival frequency to each site, a methodology to formulate the strategy is developed to assign relations to systems and determine joint sites so as to minimize the amount of intersystem communication while simultaneously balancing resource utilization among systems. The methodology first decomposes queries into relation steps and then makes site assignments based on linear integer-programming techniques.<<ETX>>","PeriodicalId":243420,"journal":{"name":"Proceedings. Fourth International Conference on Data Engineering","volume":"5 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":"131074624","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
Generalized version control in an object-oriented database 面向对象数据库中的通用版本控制
Proceedings. Fourth International Conference on Data Engineering Pub Date : 1988-02-01 DOI: 10.1109/ICDE.1988.105441
D. Beech, B. Mahbod
{"title":"Generalized version control in an object-oriented database","authors":"D. Beech, B. Mahbod","doi":"10.1109/ICDE.1988.105441","DOIUrl":"https://doi.org/10.1109/ICDE.1988.105441","url":null,"abstract":"An important function of an engineering database management system is to support incremental and cooperative design in an orderly way. This calls for a version-control mechanism of some generality if it is to be appropriate to the design of complex objects. The authors consider the nature of design objects, and develop some functional requirements for version control of such objects. They outline the basic object-oriented database model, which they take as the foundation for their proposal. They then discuss the relationship between versions and the objects they exemplify, describe the mechanisms for the creation of versioned objects and the conversion of non-versioned objects to versioned form, study the impact on referencing and type checking in the object model, and arrive at a flexible notion of a context containing rules for version selection. Their implementation of some of these concepts is also described.<<ETX>>","PeriodicalId":243420,"journal":{"name":"Proceedings. Fourth International Conference on Data Engineering","volume":"36 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":"123314297","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}
引用次数: 137
Moving selections into linear least fixpoint queries 将选择项移动到线性最小不动点查询中
Proceedings. Fourth International Conference on Data Engineering Pub Date : 1988-02-01 DOI: 10.1109/ICDE.1988.105491
R. Agrawal, Premkumar T. Devanbu
{"title":"Moving selections into linear least fixpoint queries","authors":"R. Agrawal, Premkumar T. Devanbu","doi":"10.1109/ICDE.1988.105491","DOIUrl":"https://doi.org/10.1109/ICDE.1988.105491","url":null,"abstract":"A selection transposition algorithm is presented that allows selections that are conjunctions of predicates of the form 'column theta value' to be evaluated ahead of the least fixpoint operator while processing linear recursive queries. It is shown that the algorithm transposes the strongest possible selection.<<ETX>>","PeriodicalId":243420,"journal":{"name":"Proceedings. Fourth International Conference on Data Engineering","volume":"14 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":"131107036","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}
引用次数: 34
Trie hashing analysis Trie哈希分析
Proceedings. Fourth International Conference on Data Engineering Pub Date : 1988-02-01 DOI: 10.1109/ICDE.1988.105481
M. Régnier
{"title":"Trie hashing analysis","authors":"M. Régnier","doi":"10.1109/ICDE.1988.105481","DOIUrl":"https://doi.org/10.1109/ICDE.1988.105481","url":null,"abstract":"The author presents an analysis of trie hashing for alphanumerical keys. He proposes a variant that uses a binary code and an asymptotic analysis of the size of the index. This provides, for biased distribution, a computable formula that predicts the size of the index as a function of the frequencies of the characters and the transition frequencies between these characters. These results are confirmed by a simulation. The author considers a Markovian probabilistic method and uses the Mellin transform.<<ETX>>","PeriodicalId":243420,"journal":{"name":"Proceedings. Fourth International Conference on Data Engineering","volume":"116 19","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113946074","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
下一页 尾页
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学术官方微信