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

Proceedings of the Twelfth International Conference on Data Engineering最新文献

筛选
英文 中文
A distributed query processing strategy using placement dependency 一种使用位置依赖的分布式查询处理策略
Proceedings of the Twelfth International Conference on Data Engineering Pub Date : 1996-02-26 DOI: 10.1109/ICDE.1996.492197
Chengwen Liu, Hao Chen, Warren Krueger
{"title":"A distributed query processing strategy using placement dependency","authors":"Chengwen Liu, Hao Chen, Warren Krueger","doi":"10.1109/ICDE.1996.492197","DOIUrl":"https://doi.org/10.1109/ICDE.1996.492197","url":null,"abstract":"We present an algorithm to make use of placement dependency information to process distributed queries. Our algorithm first partitions the referenced relations of a given query into a number of non-exclusive subsets such that the fragmented relations within a subset have placement dependency and the join operation(s) associated with the relations in the subset can be locally processed without data transfer. Each subset is associated with a set of sites and can be used to generate an execution plan for the given query. It does this by keeping the fragmented relations in the subset fragmented at the sites where they are situated, while replicating the other referenced relations at each of the processing sites. Among the alternatives, our algorithm picks the plan that gives the minimum response time. Our experimental results show that our algorithm improves response time significantly.","PeriodicalId":403508,"journal":{"name":"Proceedings of the Twelfth International Conference on Data Engineering","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124357055","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
SONET configuration management with OpenPM 使用OpenPM进行SONET配置管理
Proceedings of the Twelfth International Conference on Data Engineering Pub Date : 1996-02-26 DOI: 10.1109/ICDE.1996.492176
W. Du, M. Shan, C. Whitney
{"title":"SONET configuration management with OpenPM","authors":"W. Du, M. Shan, C. Whitney","doi":"10.1109/ICDE.1996.492176","DOIUrl":"https://doi.org/10.1109/ICDE.1996.492176","url":null,"abstract":"SONET (Synchronous Optical NETwork) has been proposed as the backbone of future information superhighway infrastructure. SONET network management, however, is a complex process that involves many heterogeneous systems and applications, as well as human interactions. In this paper, we describe a prototype system developed at Hewlett-Packard (HP) that provides a service for configuring large SONET networks. The prototype differs from the existing systems in that it employs the HP OpenPM (Open Process Management) workflow system to define, execute and monitor network management processes. Using OpenPM (a middleware service that enables the automation of activities supporting complex enterprise business processes in a distributed heterogeneous computing environment) as a reliable and efficient workflow execution engine, this prototype supports efficient distributed network management and easy integration of legacy applications. The paper describes how an example network configuration management process is modeled, executed and monitored using OpenPM.","PeriodicalId":403508,"journal":{"name":"Proceedings of the Twelfth International Conference on Data Engineering","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116166925","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
Transaction coordination for the new millennium: SQL Server meets OLE transactions 新千年的事务协调:SQL Server满足OLE事务
Proceedings of the Twelfth International Conference on Data Engineering Pub Date : 1996-02-26 DOI: 10.1109/ICDE.1996.492101
David G. Campbell
{"title":"Transaction coordination for the new millennium: SQL Server meets OLE transactions","authors":"David G. Campbell","doi":"10.1109/ICDE.1996.492101","DOIUrl":"https://doi.org/10.1109/ICDE.1996.492101","url":null,"abstract":"Summary form only given, as follows. Computing hardware is now available at a price, performance, and reliability point such that enterprise computing tasks may be performed on \"commodity\" class machines. These economic benefits have been achieved through producing large numbers of systems from standardized components. The OLE Transaction Architecture defines a set of distributed component object model (COM) interfaces that can be used to coordinate distributed transactions using standard two-phase commit protocols. One of the goals of this architecture is to support the development of commodity enterprise computing software. A crisply defined and unambiguous transaction coordination architecture is a foundation for advanced applications requiring distributed transaction support. These applications may be developed and deployed in large numbers, achieving the same economic benefits that standard component hardware has experienced. We describe the motivation for developing the OLE Transaction Architecture, present the programming model for transactions as objects, and describe the implementation of the first transaction and resource Managers based upon the OLE Transaction Architecture.","PeriodicalId":403508,"journal":{"name":"Proceedings of the Twelfth International Conference on Data Engineering","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116805674","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
OLE DB: a component DBMS architecture OLE DB:一个组件DBMS体系结构
Proceedings of the Twelfth International Conference on Data Engineering Pub Date : 1996-02-26 DOI: 10.1109/ICDE.1996.492108
J. Blakeley
{"title":"OLE DB: a component DBMS architecture","authors":"J. Blakeley","doi":"10.1109/ICDE.1996.492108","DOIUrl":"https://doi.org/10.1109/ICDE.1996.492108","url":null,"abstract":"The article describes an effort at Microsoft whose primary goal is to enable applications to have uniform access to data stored in diverse DBMS and non DBMS information containers. Applications continue to take advantage of the benefits of database technology such as declarative queries, transactional access, and security without having to transfer data from its place of origin to a DBMS. Our approach consists of defining an open, extensible collection of interfaces that factor and encapsulate orthogonal, independently reusable portions of DBMS functionality. These interfaces define the boundaries of DBMS components arch as record containers, and query processors that enable uniform, transactional access to data among such components. The proposed interfaces extend Microsoft's OLE Component Object Model (COM) with database functionality, hence these interfaces are collectively referred to as OLE DB. The OLE DB functional areas include data access and updates (rowsets), query processing, catalog information, notifications, transactions, security, and distribution. The article presents an overview of the OLE DB approach and its areas of componentization.","PeriodicalId":403508,"journal":{"name":"Proceedings of the Twelfth International Conference on Data Engineering","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128422294","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
Approximate queries and representations for large data sequences 大数据序列的近似查询和表示
Proceedings of the Twelfth International Conference on Data Engineering Pub Date : 1996-02-26 DOI: 10.1109/ICDE.1996.492204
H. Shatkay, S. Zdonik
{"title":"Approximate queries and representations for large data sequences","authors":"H. Shatkay, S. Zdonik","doi":"10.1109/ICDE.1996.492204","DOIUrl":"https://doi.org/10.1109/ICDE.1996.492204","url":null,"abstract":"Many new database application domains such as experimental sciences and medicine are characterized by large sequences as their main form of data. Using approximate representation can significantly reduce the required storage and search space. A good choice of representation, can support a broad new class of approximate queries, needed in there domains. These queries are concerned with application dependent features of the data as opposed to the actual sampled points. We introduce a new notion of generalized approximate queries and a general divide and conquer approach that supports them. This approach uses families of real-valued functions as an approximate representation. We present an algorithm for realizing our technique, and the results of applying it to medical cardiology data.","PeriodicalId":403508,"journal":{"name":"Proceedings of the Twelfth International Conference on Data Engineering","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130053318","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}
引用次数: 312
Towards the reverse engineering of renormalized relational databases 面向规范化关系数据库的逆向工程
Proceedings of the Twelfth International Conference on Data Engineering Pub Date : 1996-02-26 DOI: 10.1109/ICDE.1996.492110
Jean-Marc Petit, F. Toumani, Jean-François Boulicaut, J. Kouloumdjian
{"title":"Towards the reverse engineering of renormalized relational databases","authors":"Jean-Marc Petit, F. Toumani, Jean-François Boulicaut, J. Kouloumdjian","doi":"10.1109/ICDE.1996.492110","DOIUrl":"https://doi.org/10.1109/ICDE.1996.492110","url":null,"abstract":"The paper describes a method to cope with denormalized relational schemas in a database reverse engineering process. We propose two main steps to improve the understanding of data semantics. Firstly we extract inclusion dependencies by analyzing the equi join queries embedded in application programs and by querying the database extension. Secondly we show how to discover only functional dependencies which influence the way attributes should be restructured. The method is interactive since an expert user has to validate the presumptions on the elicited dependencies. Moreover, a restructuring phase leads to a relational schema in third normal form provided with key constraints and referential integrity constraints. Finally, we sketch how an entity relationship schema can be derived from such information.","PeriodicalId":403508,"journal":{"name":"Proceedings of the Twelfth International Conference on Data Engineering","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130174881","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}
引用次数: 78
Consistency and performance of concurrent interactive database applications 并发交互式数据库应用程序的一致性和性能
Proceedings of the Twelfth International Conference on Data Engineering Pub Date : 1996-02-26 DOI: 10.1109/ICDE.1996.492211
Konstantinos Stathatos, Stephen Kelley, N. Roussopoulos, J. Baras
{"title":"Consistency and performance of concurrent interactive database applications","authors":"Konstantinos Stathatos, Stephen Kelley, N. Roussopoulos, J. Baras","doi":"10.1109/ICDE.1996.492211","DOIUrl":"https://doi.org/10.1109/ICDE.1996.492211","url":null,"abstract":"In many modern database applications, there is an emerging need for interactive environments where users directly manipulate the contents of the database. Graphical user interfaces (GUIs) display images of the database which must reflect a consistent up-to-date state of the data with minimum perceivable delay to the user. Moreover, the possibility of several applications concurrently displaying different views of the same database increases the overall system complexity. In this paper, we show how design, performance and concurrency issues can be addressed by adapting existing database techniques. We propose the use of suitable display schemas whose instances compose active views of the database, an extended client caching scheme which is expected to yield significant performance benefits, and a locking mechanism that maintains consistency between the GUIs and the database.","PeriodicalId":403508,"journal":{"name":"Proceedings of the Twelfth International Conference on Data Engineering","volume":"179 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131981228","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
Complex query decorrelation 复杂查询解相关
Proceedings of the Twelfth International Conference on Data Engineering Pub Date : 1996-02-26 DOI: 10.1109/ICDE.1996.492194
P. Seshadri, H. Pirahesh, T. Leung
{"title":"Complex query decorrelation","authors":"P. Seshadri, H. Pirahesh, T. Leung","doi":"10.1109/ICDE.1996.492194","DOIUrl":"https://doi.org/10.1109/ICDE.1996.492194","url":null,"abstract":"Complex queries used in decision support applications use multiple correlated subqueries and table expressions, possibly across several levels of nesting. It is usually inefficient to directly execute a correlated query; consequently, algorithms have been proposed to decorrelate the query, i.e. to eliminate the correlation by rewriting the query. This paper explains the issues involved in decorrelation, and surveys existing algorithms. It presents an efficient and flexible algorithm called magic decorrelation which is superior to existing algorithms both in terms of the generality of application, and the efficiency of the rewritten query. The algorithm is described in the context of its implementation in the Starburst Extensible Database System, and its performance is compared with other decorrelation techniques. The paper also explains why magic decorrelation is not merely applicable, but crucial in a parallel database system.","PeriodicalId":403508,"journal":{"name":"Proceedings of the Twelfth International Conference on Data Engineering","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125454763","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}
引用次数: 154
Evaluation and optimization of the LIVING IN A LATTICE rule language LIVING IN A LATTICE规则语言的评价与优化
Proceedings of the Twelfth International Conference on Data Engineering Pub Date : 1996-02-26 DOI: 10.1109/ICDE.1996.492179
H. Riedel, A. Heuer
{"title":"Evaluation and optimization of the LIVING IN A LATTICE rule language","authors":"H. Riedel, A. Heuer","doi":"10.1109/ICDE.1996.492179","DOIUrl":"https://doi.org/10.1109/ICDE.1996.492179","url":null,"abstract":"We introduce an evaluation technique for a declarative object-oriented database (OODB) query language. The query language is rule-based and can be evaluated and optimized using an appropriate object algebra. We introduce a new framework which uses concepts of the object-oriented data model to define adequate accesses to the database. Additionally, problems according to the evaluation of recursive queries are discussed.","PeriodicalId":403508,"journal":{"name":"Proceedings of the Twelfth International Conference on Data Engineering","volume":"216 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122388023","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
Refined triggering graphs: a logic-based approach to termination analysis in an active object-oriented database 精细化的触发图:在一个活动的面向对象数据库中进行终止分析的一种基于逻辑的方法
Proceedings of the Twelfth International Conference on Data Engineering Pub Date : 1996-02-26 DOI: 10.1109/ICDE.1996.492187
A. P. Karadimce, S. Urban
{"title":"Refined triggering graphs: a logic-based approach to termination analysis in an active object-oriented database","authors":"A. P. Karadimce, S. Urban","doi":"10.1109/ICDE.1996.492187","DOIUrl":"https://doi.org/10.1109/ICDE.1996.492187","url":null,"abstract":"Presents the notion of refined triggering graphs (RTG) for analyzing termination of active rules in object-oriented databases (OODBs). The RTG method consists of mapping the possibility that one active rule can trigger another to the satisfiability of a well-defined logic formula called a triggering formula. The unsatisfiability of the triggering formula is then an indication that the rule triggering possibility is nil. We identify three increasingly more powerful types of triggering formulae and give pointers to the corresponding satisfiability procedures.","PeriodicalId":403508,"journal":{"name":"Proceedings of the Twelfth International Conference on Data Engineering","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134063955","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}
引用次数: 52
首页 上一页 下一页 尾页
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学术官方微信