Pub Date : 1995-03-06DOI: 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}
Pub Date : 1995-03-06DOI: 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.<>
{"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}
Pub Date : 1995-03-06DOI: 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.<>
{"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}
Pub Date : 1995-03-06DOI: 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}
Pub Date : 1995-03-06DOI: 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}
Pub Date : 1995-03-06DOI: 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}
Pub Date : 1995-03-06DOI: 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}
Pub Date : 1995-03-06DOI: 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.<>
{"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}
Pub Date : 1995-03-06DOI: 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.<>
{"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}
Pub Date : 1995-03-06DOI: 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}