首页 > 最新文献

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

英文 中文
Navigation Server: a highly parallel DBMS on open systems 导航服务器:开放系统上的一个高度并行的DBMS
Pub Date : 1995-03-06 DOI: 10.1109/ICDE.1995.380394
Ron-Chung Hu, Rick Stellwagen
Navigation Server was jointly developed to provide a highly scalable, high-performance parallel database server in the industry. By combining ATandT's experience in massively parallel systems, such as Teradata system, with Sybase's industry-leading open, client/server DBMS, Navigation Server was developed with some specific design objectives: Scalability. Minimizing interference by minimizing resource sharing among the concurrent processes, the shared-nothing architecture has, as of today, emerged as the architecture of choice for highly scalable parallel systems. Navigation Server adopts the shared-nothing parallel architecture to allow parallelized queries, updates, load, backup, and other utilities on a partitioned database. Portability Built on top of Sybase's open system products, Navigation Server is portable to Unix-based parallel machines. Further the shared-nothing software architecture demands minimal changes when porting Navigation Server to various parallel platforms ranging from symmetric multi-processing, clustered, to massively parallel processing systems. Availability. For a parallel system with many nodes, it may be often to see some hardware component failure. To achieve high availability, Navigation Server implements a hierarchical monitoring scheme to monitor all the running processes. With the monitoring frequency configurable by users, a process will be restarted automatically on an alternate node once a failure is detected. Usability. Navigation Server appears as a single Sybase SQL server to end users. Besides, it provides Sybase SQL Server two management tools: Configurator and Navigation Server Manager. The Configurator analyzes customers' workload, monitors system performance, and recommends configurations for optimal performance and resource utilization. The Navigation Server Manager provides graphical utilities to administer the system simply and efficiently.<>
Navigation Server是双方共同开发的,旨在为业界提供一个高度可伸缩、高性能的并行数据库服务器。通过将ATandT在大规模并行系统(如Teradata系统)方面的经验与Sybase业界领先的开放式客户端/服务器DBMS相结合,导航服务器的开发具有一些特定的设计目标:可扩展性。通过最小化并发进程之间的资源共享来最小化干扰,无共享架构已经成为高度可伸缩并行系统的首选架构。Navigation Server采用无共享的并行架构,允许在分区数据库上并行执行查询、更新、加载、备份和其他实用程序。基于Sybase的开放系统产品,导航服务器可以移植到基于unix的并行机器上。此外,在将Navigation Server移植到各种并行平台(从对称多处理、集群到大规模并行处理系统)时,无共享软件架构需要的更改最少。可用性。对于具有多个节点的并行系统,可能经常会看到一些硬件组件出现故障。为了实现高可用性,导航服务器实现了分层监控方案来监控所有正在运行的进程。通过用户可配置的监视频率,一旦检测到故障,将在备用节点上自动重新启动进程。可用性。导航服务器对最终用户显示为单个Sybase SQL服务器。此外,还提供了Sybase SQL Server两种管理工具:Configurator和Navigation Server Manager。Configurator分析客户的工作负载,监控系统性能,并推荐最佳性能和资源利用率的配置。导航服务器管理器提供了图形化实用程序来简单有效地管理系统。
{"title":"Navigation Server: a highly parallel DBMS on open systems","authors":"Ron-Chung Hu, Rick Stellwagen","doi":"10.1109/ICDE.1995.380394","DOIUrl":"https://doi.org/10.1109/ICDE.1995.380394","url":null,"abstract":"Navigation Server was jointly developed to provide a highly scalable, high-performance parallel database server in the industry. By combining ATandT's experience in massively parallel systems, such as Teradata system, with Sybase's industry-leading open, client/server DBMS, Navigation Server was developed with some specific design objectives: Scalability. Minimizing interference by minimizing resource sharing among the concurrent processes, the shared-nothing architecture has, as of today, emerged as the architecture of choice for highly scalable parallel systems. Navigation Server adopts the shared-nothing parallel architecture to allow parallelized queries, updates, load, backup, and other utilities on a partitioned database. Portability Built on top of Sybase's open system products, Navigation Server is portable to Unix-based parallel machines. Further the shared-nothing software architecture demands minimal changes when porting Navigation Server to various parallel platforms ranging from symmetric multi-processing, clustered, to massively parallel processing systems. Availability. For a parallel system with many nodes, it may be often to see some hardware component failure. To achieve high availability, Navigation Server implements a hierarchical monitoring scheme to monitor all the running processes. With the monitoring frequency configurable by users, a process will be restarted automatically on an alternate node once a failure is detected. Usability. Navigation Server appears as a single Sybase SQL server to end users. Besides, it provides Sybase SQL Server two management tools: Configurator and Navigation Server Manager. The Configurator analyzes customers' workload, monitors system performance, and recommends configurations for optimal performance and resource utilization. The Navigation Server Manager provides graphical utilities to administer the system simply and efficiently.<<ETX>>","PeriodicalId":184415,"journal":{"name":"Proceedings of the Eleventh International Conference on Data Engineering","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125062454","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
Translation of object-oriented queries to relational queries 将面向对象查询转换为关系查询
Pub Date : 1995-03-06 DOI: 10.1109/ICDE.1995.380404
Clement T. Yu, Y. Zhang, W. Meng, Won Kim, Gaoming Wang, Tracy Pham, S. Dao
Proposes a formal approach for translating OODB queries to equivalent relational queries. The translation is accomplished through the use of relational predicate graphs and OODB predicate graphs. One advantage of using such a graph-based approach is that we can achieve bidirectional translation between relational queries and OODB queries.<>
提出一种将OODB查询转换为等价关系查询的形式化方法。转换是通过使用关系谓词图和OODB谓词图来完成的。使用这种基于图的方法的一个优点是,我们可以实现关系查询和OODB查询之间的双向转换。
{"title":"Translation of object-oriented queries to relational queries","authors":"Clement T. Yu, Y. Zhang, W. Meng, Won Kim, Gaoming Wang, Tracy Pham, S. Dao","doi":"10.1109/ICDE.1995.380404","DOIUrl":"https://doi.org/10.1109/ICDE.1995.380404","url":null,"abstract":"Proposes a formal approach for translating OODB queries to equivalent relational queries. The translation is accomplished through the use of relational predicate graphs and OODB predicate graphs. One advantage of using such a graph-based approach is that we can achieve bidirectional translation between relational queries and OODB queries.<<ETX>>","PeriodicalId":184415,"journal":{"name":"Proceedings of the Eleventh International Conference on Data Engineering","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113960791","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}
引用次数: 30
Relational database compression using augmented vector quantization 使用增广矢量量化的关系数据库压缩
Pub Date : 1995-03-06 DOI: 10.1109/ICDE.1995.380352
W. Ng, C. Ravishankar
Data compression is one way to alleviate the I/O bottleneck problem faced by I/O-intensive applications such as databases. However, this approach is not widely used because of the lack of suitable database compression techniques. In this paper, we design and implement a novel database compression technique based on vector quantization (VQ). VQ is a data compression technique with wide applicability in speech and image coding, but it is not directly suitable for databases because it is lossy. We show how one may use a lossless version of vector quantization to reduce database space storage requirements and improve disk I/O bandwidth.<>
数据压缩是缓解I/O密集型应用程序(如数据库)所面临的I/O瓶颈问题的一种方法。然而,由于缺乏合适的数据库压缩技术,这种方法并没有得到广泛的应用。本文设计并实现了一种基于矢量量化(VQ)的新型数据库压缩技术。VQ是一种广泛应用于语音和图像编码的数据压缩技术,但由于其具有一定的损耗性,并不直接适用于数据库。我们展示了如何使用无损版本的矢量量化来减少数据库空间存储需求并提高磁盘I/O带宽
{"title":"Relational database compression using augmented vector quantization","authors":"W. Ng, C. Ravishankar","doi":"10.1109/ICDE.1995.380352","DOIUrl":"https://doi.org/10.1109/ICDE.1995.380352","url":null,"abstract":"Data compression is one way to alleviate the I/O bottleneck problem faced by I/O-intensive applications such as databases. However, this approach is not widely used because of the lack of suitable database compression techniques. In this paper, we design and implement a novel database compression technique based on vector quantization (VQ). VQ is a data compression technique with wide applicability in speech and image coding, but it is not directly suitable for databases because it is lossy. We show how one may use a lossless version of vector quantization to reduce database space storage requirements and improve disk I/O bandwidth.<<ETX>>","PeriodicalId":184415,"journal":{"name":"Proceedings of the Eleventh International Conference on Data Engineering","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129939586","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}
引用次数: 37
Active database management of global data integrity constraints in heterogeneous database environments 异构数据库环境中全局数据完整性约束的主动数据库管理
Pub Date : 1995-03-06 DOI: 10.1109/ICDE.1995.380403
L. Do, P. Drew
Today, enterprises maintain many disparate information sources over which complex business applications are expected. The informal and ad hoc characteristics of these environments make the information very prone to inconsistency. Yet, the flexibility of application execution given to different parts of an organization is desirable. This paper introduces a new mechanism in which the execution of asynchronous, pre-existing, yet related, applications can be harnessed. A multidatabase framework that supports the concurrent execution of these heterogeneous, distributed applications is presented. Using this framework, we introduce an intuitive conceptual model and algorithm for the enforcement of interdatabase constraints based on active database technology.<>
如今,企业维护着许多不同的信息源,复杂的业务应用程序需要在这些信息源上运行。这些环境的非正式和特殊特征使得信息非常容易出现不一致。然而,为组织的不同部分提供应用程序执行的灵活性是可取的。本文引入了一种新的机制,可以利用这种机制来执行异步的、预先存在的但相关的应用程序。提出了一个支持这些异构分布式应用程序并发执行的多数据库框架。在此框架下,我们引入了一个直观的概念模型和基于主动数据库技术的数据库间约束实施算法。
{"title":"Active database management of global data integrity constraints in heterogeneous database environments","authors":"L. Do, P. Drew","doi":"10.1109/ICDE.1995.380403","DOIUrl":"https://doi.org/10.1109/ICDE.1995.380403","url":null,"abstract":"Today, enterprises maintain many disparate information sources over which complex business applications are expected. The informal and ad hoc characteristics of these environments make the information very prone to inconsistency. Yet, the flexibility of application execution given to different parts of an organization is desirable. This paper introduces a new mechanism in which the execution of asynchronous, pre-existing, yet related, applications can be harnessed. A multidatabase framework that supports the concurrent execution of these heterogeneous, distributed applications is presented. Using this framework, we introduce an intuitive conceptual model and algorithm for the enforcement of interdatabase constraints based on active database technology.<<ETX>>","PeriodicalId":184415,"journal":{"name":"Proceedings of the Eleventh International Conference on Data Engineering","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128919921","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}
引用次数: 21
RBE: Rendering by example RBE:通过示例呈现
Pub Date : 1995-03-06 DOI: 10.1109/ICDE.1995.380382
R. Krishnamurthy, Moshé M. Zloof
Rendering is defined to be a customized presentation of data in such a way that allows users to subsequently interact with the presented data. Traditionally such a user interface would be a custom application written using conventional programming languages; in contrast we propose an application-independent, declarative (i.e., what-you-want) language that we call Rendering By Example, RBE, with the capability to specify a wide variety of renderings. RBE is a domain calculus language over user interface widgets. Most previous domain calculus database languages (e.g., QBE, LDL, Datalog) mainly addressed the data processing problem. The main contribution in developing RBE is to model semantics of user interactions in a declarative way. This declarative specification not only allows quick and ad-hoc specification of renderings (i.e., user interfaces) but also provides a framework to understand renderings as an abstract concept, independent of the application. Further, such a linguistic abstraction provides the basis for user-interface research. RBE is part of the ICBE language that is being prototyped in the Picture Programming project at HP Labs.<>
呈现被定义为一种自定义的数据表示方式,允许用户随后与呈现的数据进行交互。传统上,这样的用户界面将是使用传统编程语言编写的自定义应用程序;相反,我们提出了一种独立于应用程序的声明性(也就是,你想要什么就说什么)语言,我们称之为示例呈现(Rendering By Example, RBE),它具有指定多种呈现的能力。RBE是一种基于用户界面小部件的领域演算语言。以前的领域演算数据库语言(如QBE、LDL、Datalog)主要解决数据处理问题。开发RBE的主要贡献是以声明的方式对用户交互的语义进行建模。这种声明性规范不仅允许快速和特别的渲染(即用户界面)规范,而且还提供了一个框架,将渲染作为一个抽象概念来理解,独立于应用程序。此外,这种语言抽象为用户界面研究提供了基础。RBE是ICBE语言的一部分,目前正在HP实验室的图片编程项目中原型化。
{"title":"RBE: Rendering by example","authors":"R. Krishnamurthy, Moshé M. Zloof","doi":"10.1109/ICDE.1995.380382","DOIUrl":"https://doi.org/10.1109/ICDE.1995.380382","url":null,"abstract":"Rendering is defined to be a customized presentation of data in such a way that allows users to subsequently interact with the presented data. Traditionally such a user interface would be a custom application written using conventional programming languages; in contrast we propose an application-independent, declarative (i.e., what-you-want) language that we call Rendering By Example, RBE, with the capability to specify a wide variety of renderings. RBE is a domain calculus language over user interface widgets. Most previous domain calculus database languages (e.g., QBE, LDL, Datalog) mainly addressed the data processing problem. The main contribution in developing RBE is to model semantics of user interactions in a declarative way. This declarative specification not only allows quick and ad-hoc specification of renderings (i.e., user interfaces) but also provides a framework to understand renderings as an abstract concept, independent of the application. Further, such a linguistic abstraction provides the basis for user-interface research. RBE is part of the ICBE language that is being prototyped in the Picture Programming project at HP Labs.<<ETX>>","PeriodicalId":184415,"journal":{"name":"Proceedings of the Eleventh International Conference on Data Engineering","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122632866","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}
引用次数: 20
A new recursive subclass of domain independent formulas based on subimplication 一个新的基于子隐含的域无关公式递归子类
Pub Date : 1995-03-06 DOI: 10.1109/ICDE.1995.380366
Joonyeoub Sung, L. Henschen
We motivate and define subimplication completion of a relational calculus query and of a general deductive database. Subimplication completion not only avoids getting unexpected answers, but also makes some domain dependent queries and databases domain independent. We define a new recursive subclass of domain independent formulas, called weakly range-restricted formulas, which is strictly larger than the class of range-restricted formulas. We also define admissible and deductive databases and show that under the subimplication completion they are domain independent and safe.<>
我们激发并定义了关系演算查询和一般演绎数据库的子蕴涵补全。子隐含补全不仅避免了得到意想不到的答案,而且使一些域相关查询和数据库域独立。我们定义了一个新的递归的域无关公式子类,称为弱范围限制公式,它严格地大于范围限制公式类。我们还定义了可容许数据库和演绎数据库,并证明了在子蕴涵完备条件下,它们是领域独立的和安全的。
{"title":"A new recursive subclass of domain independent formulas based on subimplication","authors":"Joonyeoub Sung, L. Henschen","doi":"10.1109/ICDE.1995.380366","DOIUrl":"https://doi.org/10.1109/ICDE.1995.380366","url":null,"abstract":"We motivate and define subimplication completion of a relational calculus query and of a general deductive database. Subimplication completion not only avoids getting unexpected answers, but also makes some domain dependent queries and databases domain independent. We define a new recursive subclass of domain independent formulas, called weakly range-restricted formulas, which is strictly larger than the class of range-restricted formulas. We also define admissible and deductive databases and show that under the subimplication completion they are domain independent and safe.<<ETX>>","PeriodicalId":184415,"journal":{"name":"Proceedings of the Eleventh International Conference on Data Engineering","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127451027","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
Flexible relation: an approach for integrating data from multiple, possibly inconsistent databases 灵活关系:一种集成来自多个可能不一致的数据库的数据的方法
Pub Date : 1995-03-06 DOI: 10.1109/ICDE.1995.380364
Shailesh Agarwal, A. M. Keller, G. Wiederhold, K. Saraswat
In this work we address the problem of dealing with data inconsistencies while integrating data sets derived from multiple autonomous relational databases. The fundamental assumption in the classical relational model is that data is consistent and hence no support is provided for dealing with inconsistent data. Due to this limitation of the classical relational model, the semantics for detecting, representing, and manipulating inconsistent data have to be explicitly encoded in the applications by the application developer. In this paper, we propose the flexible relational model, which extends the classical relational model by providing support for inconsistent data. We present a flexible relation algebra, which provides semantics for database operations in the presence of potentially inconsistent data. Finally, we discuss issues raised for query optimization when the data may be inconsistent.<>
在这项工作中,我们解决了在集成来自多个自治关系数据库的数据集时处理数据不一致性的问题。经典关系模型的基本假设是数据是一致的,因此不支持处理不一致的数据。由于经典关系模型的这种限制,用于检测、表示和操作不一致数据的语义必须由应用程序开发人员显式地在应用程序中编码。本文提出了灵活的关系模型,它扩展了传统的关系模型,为数据不一致提供了支持。我们提出了一个灵活的关系代数,它为存在潜在不一致数据的数据库操作提供语义。最后,我们讨论了当数据可能不一致时为查询优化提出的问题
{"title":"Flexible relation: an approach for integrating data from multiple, possibly inconsistent databases","authors":"Shailesh Agarwal, A. M. Keller, G. Wiederhold, K. Saraswat","doi":"10.1109/ICDE.1995.380364","DOIUrl":"https://doi.org/10.1109/ICDE.1995.380364","url":null,"abstract":"In this work we address the problem of dealing with data inconsistencies while integrating data sets derived from multiple autonomous relational databases. The fundamental assumption in the classical relational model is that data is consistent and hence no support is provided for dealing with inconsistent data. Due to this limitation of the classical relational model, the semantics for detecting, representing, and manipulating inconsistent data have to be explicitly encoded in the applications by the application developer. In this paper, we propose the flexible relational model, which extends the classical relational model by providing support for inconsistent data. We present a flexible relation algebra, which provides semantics for database operations in the presence of potentially inconsistent data. Finally, we discuss issues raised for query optimization when the data may be inconsistent.<<ETX>>","PeriodicalId":184415,"journal":{"name":"Proceedings of the Eleventh International Conference on Data Engineering","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116904706","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}
引用次数: 121
Practical issues for RDBMS application development RDBMS应用程序开发的实际问题
Pub Date : 1995-03-06 DOI: 10.1109/ICDE.1995.380373
K. Farn, Shin-Ling Hu
We discuss some functions of relational database management systems (RDBMS) that may help RDBMS users to increase their productivity. First, for a data dictionary, we can define each field attribute characteristic in the create table statement, such as signed, unsigned, negative, nonnegative, list or coded value, range value, default value; uppercase, lowercase or upperlow case; IDstamp value; datestamp value; or computation field. We also point out some inconvenient functions of RDBMS. A more intelligent query optimizer is also needed. For users in a Chinese environment, Chinese characteristics such as field name defining, sorting, and partial searching are required. In addition, for an area center using a horizontal fragmentation scheme, a tool which which can automatically parallel update the other site when the central site's kernel part changes is required.<>
我们讨论了关系数据库管理系统(RDBMS)的一些功能,这些功能可以帮助RDBMS用户提高工作效率。首先,对于数据字典,我们可以在create table语句中定义每个字段的属性特征,如有符号、无符号、负、非负、列表或编码值、范围值、默认值;大写、小写或大写;IDstamp价值;日期戳价值;或者计算领域。同时指出了关系型数据库的一些不方便使用的功能。还需要一个更智能的查询优化器。对于中文环境下的用户,需要具备中文特征,如字段名称定义、排序和部分搜索。此外,对于采用水平分片方案的区域中心,还需要一种能够在中心站点的核心部分发生变化时自动并行更新其他站点的工具。
{"title":"Practical issues for RDBMS application development","authors":"K. Farn, Shin-Ling Hu","doi":"10.1109/ICDE.1995.380373","DOIUrl":"https://doi.org/10.1109/ICDE.1995.380373","url":null,"abstract":"We discuss some functions of relational database management systems (RDBMS) that may help RDBMS users to increase their productivity. First, for a data dictionary, we can define each field attribute characteristic in the create table statement, such as signed, unsigned, negative, nonnegative, list or coded value, range value, default value; uppercase, lowercase or upperlow case; IDstamp value; datestamp value; or computation field. We also point out some inconvenient functions of RDBMS. A more intelligent query optimizer is also needed. For users in a Chinese environment, Chinese characteristics such as field name defining, sorting, and partial searching are required. In addition, for an area center using a horizontal fragmentation scheme, a tool which which can automatically parallel update the other site when the central site's kernel part changes is required.<<ETX>>","PeriodicalId":184415,"journal":{"name":"Proceedings of the Eleventh International Conference on Data Engineering","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132865877","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
Computing temporal aggregates 计算时间聚合
Pub Date : 1995-03-06 DOI: 10.1109/ICDE.1995.380389
N. Kline, R. Snodgrass
Aggregate computation, such as selecting the minimum attribute value of a relation, is expensive, especially in a temporal database. We describe the basic techniques behind computing aggregates in conventional databases and show that these techniques are not efficient when applied to temporal databases. We examine the problem of computing constant intervals (intervals of time for which the aggregate value is constant) used for temporal grouping. We introduce two new algorithms for computing temporal aggregates: the aggregation tree and the k-ordered aggregation tree. An empirical comparison demonstrates that the choice of algorithm depends in part on the amount of memory available, the number of tuples in the underlying relation, and the degree to which the tuples are ordered. This study shows that the simplest strategy is to first sort the underlying relation, then apply the k-ordered aggregation tree algorithm with k=1.<>
聚合计算(例如选择关系的最小属性值)非常昂贵,特别是在时态数据库中。我们描述了传统数据库中计算聚合背后的基本技术,并表明这些技术在应用于时态数据库时效率不高。我们研究了计算用于时间分组的常数区间(集合值为常数的时间区间)的问题。我们介绍了两种计算时间聚合的新算法:聚合树和k序聚合树。经验比较表明,算法的选择部分取决于可用的内存量、底层关系中的元组数量以及元组排序的程度。研究表明,最简单的策略是先对底层关系进行排序,然后应用k=1.>的k有序聚合树算法
{"title":"Computing temporal aggregates","authors":"N. Kline, R. Snodgrass","doi":"10.1109/ICDE.1995.380389","DOIUrl":"https://doi.org/10.1109/ICDE.1995.380389","url":null,"abstract":"Aggregate computation, such as selecting the minimum attribute value of a relation, is expensive, especially in a temporal database. We describe the basic techniques behind computing aggregates in conventional databases and show that these techniques are not efficient when applied to temporal databases. We examine the problem of computing constant intervals (intervals of time for which the aggregate value is constant) used for temporal grouping. We introduce two new algorithms for computing temporal aggregates: the aggregation tree and the k-ordered aggregation tree. An empirical comparison demonstrates that the choice of algorithm depends in part on the amount of memory available, the number of tuples in the underlying relation, and the degree to which the tuples are ordered. This study shows that the simplest strategy is to first sort the underlying relation, then apply the k-ordered aggregation tree algorithm with k=1.<<ETX>>","PeriodicalId":184415,"journal":{"name":"Proceedings of the Eleventh International Conference on Data Engineering","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116994532","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}
引用次数: 117
A common framework for classifying and specifying deductive database updating problems 分类和指定演绎数据库更新问题的通用框架
Pub Date : 1995-03-06 DOI: 10.1109/ICDE.1995.380395
Ernest Teniente, Toni Urpí
We propose two interpretations of the event rules which provide a common framework for classifying and specifying deductive database updating problems such as view updating, materialized view maintenance, integrity constraints checking, integrity constraints maintenance, repairing inconsistent databases, integrity constraints satisfiability or condition monitoring. Moreover, these interpretations allow us to identify and to specify some problems that have received little attention up to now like enforcing or preventing condition activation. By considering only a unique set of rules for specifying all these problems, we want to show that it is possible to provide general methods able to deal with all these problems as a whole.<>
我们提出了事件规则的两种解释,为分类和指定演绎数据库更新问题提供了一个通用框架,例如视图更新、物化视图维护、完整性约束检查、完整性约束维护、修复不一致的数据库、完整性约束可满足性或状态监控。此外,这些解释使我们能够识别和指定一些迄今为止很少受到关注的问题,如强制或防止条件激活。通过只考虑一组唯一的规则来指定所有这些问题,我们想表明,提供能够作为一个整体处理所有这些问题的一般方法是可能的。
{"title":"A common framework for classifying and specifying deductive database updating problems","authors":"Ernest Teniente, Toni Urpí","doi":"10.1109/ICDE.1995.380395","DOIUrl":"https://doi.org/10.1109/ICDE.1995.380395","url":null,"abstract":"We propose two interpretations of the event rules which provide a common framework for classifying and specifying deductive database updating problems such as view updating, materialized view maintenance, integrity constraints checking, integrity constraints maintenance, repairing inconsistent databases, integrity constraints satisfiability or condition monitoring. Moreover, these interpretations allow us to identify and to specify some problems that have received little attention up to now like enforcing or preventing condition activation. By considering only a unique set of rules for specifying all these problems, we want to show that it is possible to provide general methods able to deal with all these problems as a whole.<<ETX>>","PeriodicalId":184415,"journal":{"name":"Proceedings of the Eleventh International Conference on Data Engineering","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1995-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125882941","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}
引用次数: 16
期刊
Proceedings of the Eleventh International Conference on Data Engineering
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1