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

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

筛选
英文 中文
Covering and disjointness constraints in type networks 类型网络中的覆盖和不连接约束
1987 IEEE Third International Conference on Data Engineering Pub Date : 1987-02-03 DOI: 10.1109/ICDE.1987.7272404
M. Lenzerini
{"title":"Covering and disjointness constraints in type networks","authors":"M. Lenzerini","doi":"10.1109/ICDE.1987.7272404","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272404","url":null,"abstract":"First order theories with unary predicates and no function symbols are formal tools for describing the part of a knowledge base concerning the classes of objects and the semantic interdependencies among classes, such as IS-A relationships, disjointness, covering, partitioning, etc‥ In this paper we study the problems of predicate satisfiability and predicate subsumption in such theories. The former is the problem of determining if a model of a given theory exists in which a certain predicate is assigned some objects. The latter is the problem of determining if two classes are related through the IS-A relationship in a given theory. Two types of semantic interdependencies among classes are considered: disjointness and covering. Disjointness holds between two classes having no common elements, while covering, a generalization of the IS-A relationship, holds when a class is a subset of the union of other classes. The results reported in this paper show that even simple representation mechanisms can pose serious obstacles to the efficiency of the inference capabilities of knowledge representation languages.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"107 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":"124399423","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}
引用次数: 27
Implementing logic programs as a database system 实现逻辑程序作为数据库系统
1987 IEEE Third International Conference on Data Engineering Pub Date : 1987-02-03 DOI: 10.1109/ICDE.1987.7272403
M. Kifer, E. L. Lozinskii
{"title":"Implementing logic programs as a database system","authors":"M. Kifer, E. L. Lozinskii","doi":"10.1109/ICDE.1987.7272403","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272403","url":null,"abstract":"We show how Horn logic programs can be implemented using database techniques, namely, mostly bottom-up in combination with certain top-down elements (as opposed to the top-down implementations of logic programs prevailing so far). The proposed method is sound and complete. It easily lends itself to a parallel implementation, and is free of nonlogical features, like backtracking. In extension to the common approach to deductive databases, we allow function symbols to appear in programs. An important advantage of this method is that it terminates in many cases in which PROLOG and SLD-resolution do not.","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":"130733583","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
Engineering information systems: Implementation approaches and issues 工程信息系统:实施方法和问题
1987 IEEE Third International Conference on Data Engineering Pub Date : 1987-02-03 DOI: 10.1109/ICDE.1987.7272426
A. Gadient
{"title":"Engineering information systems: Implementation approaches and issues","authors":"A. Gadient","doi":"10.1109/ICDE.1987.7272426","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272426","url":null,"abstract":"The phenomenal growth in integrated circuit fabrication technology over the last decade has led to the need for a robust, multi-user, integrated design environment for electronic systems. Attempts to develop “integrated” design environments have highlighted the present lack in design tool interoperability. The Very High Speed Integrated Circuits (VHSIC) Program has recognized the importance of integrated design environments for the design of future defense electronic systems and for the insertion of new technologies into existing electronic systems. The VHSIC Program is attempting to ease the task of integrating disparate electronic system design aids by addressing the design tool interoperability problem through the Engineering Information System (EIS) Program. This panel is the second in a series of panels aimed at discussing different aspects of Engineering Information Systems. The first EIS panel, held at SIGMOD '861, discussed the major issues confronting the implementation of an EIS. The purpose of this panel is to discuss different implementation approaches that will address these issues.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"15 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":"132314824","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
Database management system requirements for software engineering environments 数据库管理系统对软件工程环境的要求
1987 IEEE Third International Conference on Data Engineering Pub Date : 1987-02-03 DOI: 10.1109/ICDE.1987.7272417
E. Onuegbe
{"title":"Database management system requirements for software engineering environments","authors":"E. Onuegbe","doi":"10.1109/ICDE.1987.7272417","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272417","url":null,"abstract":"A software engineering database management system, SEDBMS, provides shared access to the program fragments, documents, tools, managerial Information, process description, and electronic messages that are generated In the course of a large-scale software development. This study addresses the additional requirements for such a database management system. The motivation for this study comes from developing and exercising a software engineering environment, SDE-1, at Honeywell. The rationale for choosing a database system architecture, a data model, and a classification scheme for reusable components are discussed in the paper.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"80 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":"115442224","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
ODDESSY: An object-oriented database design system ODDESSY:面向对象的数据库设计系统
1987 IEEE Third International Conference on Data Engineering Pub Date : 1987-02-03 DOI: 10.1109/ICDE.1987.7272378
J. Diederich, J. Milton
{"title":"ODDESSY: An object-oriented database design system","authors":"J. Diederich, J. Milton","doi":"10.1109/ICDE.1987.7272378","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272378","url":null,"abstract":"A prototype database design system is presented. The system is object oriented in two ways. First, a uniform object-message paradigm is used for the design, definition, and manipulation language. Second, the structure of the underlying system is object oriented and is being implemented in Smalltalk-80.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"7 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":"121840768","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
Design and evaluation of algorithms to compute the transitive closure of a database relation 设计和评估计算数据库关系的传递闭包的算法
1987 IEEE Third International Conference on Data Engineering Pub Date : 1987-02-03 DOI: 10.1109/ICDE.1987.7272364
Hongjun Lu, K. Mikkilineni, J. Richardson
{"title":"Design and evaluation of algorithms to compute the transitive closure of a database relation","authors":"Hongjun Lu, K. Mikkilineni, J. Richardson","doi":"10.1109/ICDE.1987.7272364","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272364","url":null,"abstract":"Recursive query evaluation is a capability of deductively-augmented database systems that conventional database systems do not support well, if at all. Many recursive queries involve computation of the transitive closure of a relation. Previously published algorithms for transitive closure are iterative in nature, performing repeated joins, unions, and differences until convergence is obtained. In this paper, we present an adaptation of Warren's algorithm for computing the transitive closure of a relation. Warren's algorithm was originally designed for a bit matrix representation of a binary relation; we have adapted it for use with a binary relation represented as a set of tuples, as in a relational database management system. This adapted algorithm computes the transitive closure in two passes over the relation. We analyze the performance of this algorithm, and compare it to the performance of two algorithms based on relational algebra: an iterative algorithm, and an improved version of the iterative algorithm that eliminates unnecessary I/O at the expense of more computation. We evaluate the performance of the algorithms for different source relation sizes, available memory sizes, join selectivities, and maximum path length. Our results show that no algorithm has uniformly superior performance; the adaptation of Warren's algorithm is superior when the source and result relations are not too much larger than main memory. We conclude that in future systems with large main memory, Warren's algorithm generally performs best, and thus should be implemented with the option of switching to an iterative algorithm when the source or result sizes are very large.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"69 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":"131449596","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}
引用次数: 59
Semantics-based concurrency control: Beyond commutativity 基于语义的并发控制:超越交换性
1987 IEEE Third International Conference on Data Engineering Pub Date : 1987-02-03 DOI: 10.1145/128765.128771
B. R. Badrinath, K. Ramamritham
{"title":"Semantics-based concurrency control: Beyond commutativity","authors":"B. R. Badrinath, K. Ramamritham","doi":"10.1145/128765.128771","DOIUrl":"https://doi.org/10.1145/128765.128771","url":null,"abstract":"The concurrency of transactions executing on atomic data types can be enhanced through the use of semantic information about operations defined on these types. Hitherto, commutativity of operations has been exploited to provide enhanced concurrency while avoiding cascading aborts. We have identified a property known as recoverability which can be used to decrease the delay involved in processing non-commuting operations while still avoiding cascading aborts. When an invoked operation is recoverable with respect to an uncommitted operation, the invoked operation can be executed by forcing a commit-dependency between the invoked operation and the uncommitted operation; the transaction invoking the operation will not have to wait for the uncommitted operation to abort or commit. Further, this commit dependency only affects the order in which the operations should commit, if both commit; if either operation aborts, the other can still commit thus avoiding cascading aborts. To ensure the serializability of transactions, we force the recoverability relationship between transactions to be acyclic.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"25 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":"134348484","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}
引用次数: 250
A design method for nested relational databases 嵌套关系数据库的设计方法
1987 IEEE Third International Conference on Data Engineering Pub Date : 1987-02-03 DOI: 10.1109/ICDE.1987.7272429
Z. M. Özsoyoglu, Li-Yan Yuan
{"title":"A design method for nested relational databases","authors":"Z. M. Özsoyoglu, Li-Yan Yuan","doi":"10.1109/ICDE.1987.7272429","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272429","url":null,"abstract":"Recently, several researchers have discussed the advantages of extending the relational model by allowing nested relations (i.e., non-first-normal form relations). In this paper, we address the problem of designing a database with the nested relations with respect to semantic integrity constraints so that a better model of the real world can be obtained. We first define a normal form for nested relations, called nested normal form, utilizing the functional and multivalued dependencies, and then give an algorithm to a obtain such a database scheme.","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":"129614919","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}
引用次数: 5
Computer architectures, database security, and an evaluation metric 计算机体系结构，数据库安全性和评估度量
1987 IEEE Third International Conference on Data Engineering Pub Date : 1987-02-03 DOI: 10.1109/ICDE.1987.7272419
R. Henning, B. Hubbard, S. A. Walker
{"title":"Computer architectures, database security, and an evaluation metric","authors":"R. Henning, B. Hubbard, S. A. Walker","doi":"10.1109/ICDE.1987.7272419","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272419","url":null,"abstract":"There are various computer architectures that will support database management applications. The distinction between the security concerns of a database management system and an operating system are not well defined. Both can provide same data security to user applications. The question is how to divide the security controls between the two. This paper details the fundamental security requirements for a database management system, and the operating system security features that a database management system could take advantage of to enhance its own security. A metric for quantifying the security functions of an operating system, the Department of Defense Trusted Computer Systems Evaluation Criteria, is discussed, as is its potential application to database security assessment.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"21 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":"133685413","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 regression approach to performance analysis for the Differential File Architecture 差分文件体系结构性能分析的回归方法
1987 IEEE Third International Conference on Data Engineering Pub Date : 1987-02-03 DOI: 10.1109/ICDE.1987.7272369
Timothy R. Hill, A. Srinivasan
{"title":"A regression approach to performance analysis for the Differential File Architecture","authors":"Timothy R. Hill, A. Srinivasan","doi":"10.1109/ICDE.1987.7272369","DOIUrl":"https://doi.org/10.1109/ICDE.1987.7272369","url":null,"abstract":"The Differential File Architecture (DFA) has been previously proposed as a physical database design which confines the volatility of a large database into a small, more manageable file. Although this approach affords many advantages, the use of dual files often results in two accesses to secondary storage. The response performance of the DFA is therefore a key issue, yet the only predictive performance model currently in existence assumes an ideal environment. This paper represents a preliminary step toward developing a general model of DFA performance, applicable to realistic settings in which the distribution of key accesses and the hashing distribution of keys to filter switches are non-uniform. In support of a regression approach to the problem, a metric is developed and tested for suitability as a predictor of non-uniformity effects.","PeriodicalId":145433,"journal":{"name":"1987 IEEE Third International Conference on Data Engineering","volume":"300 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":"116370628","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学术官方微信