Este trabalho adota um modelo de regras estendido, que melhora a expressividade da linguagem SQL3, propondo o uso de novas variantes para o modelo de regras ECA (Evento - Condição - Ação). Porém, este modelo estendido abrange somente a definição de regras, faltando as outras operações de gerência, como eliminar ou modificar uma regra, entre outros mecanismos necessários para gerenciar estes novos tipos de regras. Neste trabalho, propõe-se uma linguagem de gerência de regras composta de um conjunto de operações para criar, excluir e alterar as regras e suas partes, com a finalidade de obter maior reuso e manutenibilidade das regras. Para tanto, analisa-se o modelo de regras estendido, para identificar quais são as suas limitações e as propriedades do modelo a serem consideradas na especificação da linguagem de gerência de regras proposta. O resultado desta análise é utilizado para a elaboração de um repositório de regras, necessário para armazenar os tipos de regras propostos. Este repositório armazena um conjunto de regras que se deve manter consistente, da mesma forma que os dados se mantêm consistentes em um banco de dados. Para tanto, foi definido um conjunto de regras de consistência. Também, é definido um conjunto de operações de gerência de regras que auxiliam na manipulação de regras e de seus elementos, armazenadas no repositório de regras. / This work uses an extended rule model which improves the expressiveness of SQL3 language, proposing the use of new variants for the ECA (Event-Condition-Action) rule model. Nevertheless, the extended model considers only the rule definition and it lacks other management operations, such as excluding or modifying rules, among others necessary mechanisms for these new rule types. In this work, a rule management language made of a set of operations for creating, eliminating and altering rules and its parts is proposed, in order to obtain greater reuse and maintainability of rules. For this purpose, the extended rule model is analyzed to identify its limitations and the properties that it supports to be considered in the rule management language proposed. The result of this analysis is used to define a rule repository, necessary for storing the rule types proposed. This repository stores a rules set which must be consistent, as well as data must be consistent in the database. Hence, a consistency rule set is defined. Besides, a rule management operations set is defined to help to handle rules and their elements, stored in the rule repository.

Este trabalho adota um modelo de regras estendido, que melhora a expressividade da linguagem SQL3, propondo o uso de novas variantes para o modelo de regras ECA (Evento - Condição - Ação). Porém, este modelo estendido abrange somente a definição de regras, faltando as outras operações de gerência, como eliminar ou modificar uma regra, entre outros mecanismos necessários para gerenciar estes novos tipos de regras. Neste trabalho, propõe-se uma linguagem de gerência de regras composta de um conjunto de operações para criar, excluir e alterar as regras e suas partes, com a finalidade de obter maior reuso e manutenibilidade das regras. Para tanto, analisa-se o modelo de regras estendido, para identificar quais são as suas limitações e as propriedades do modelo a serem consideradas na especificação da linguagem de gerência de regras proposta. O resultado desta análise é utilizado para a elaboração de um repositório de regras, necessário para armazenar os tipos de regras propostos. Este repositório armazena um conjunto de regras que se deve manter consistente, da mesma forma que os dados se mantêm consistentes em um banco de dados. Para tanto, foi definido um conjunto de regras de consistência. Também, é definido um conjunto de operações de gerência de regras que auxiliam na manipulação de regras e de seus elementos, armazenadas no repositório de regras. / This work uses an extended rule model which improves the expressiveness of SQL3 language, proposing the use of new variants for the ECA (Event-Condition-Action) rule model. Nevertheless, the extended model considers only the rule definition and it lacks other management operations, such as excluding or modifying rules, among others necessary mechanisms for these new rule types. In this work, a rule management language made of a set of operations for creating, eliminating and altering rules and its parts is proposed, in order to obtain greater reuse and maintainability of rules. For this purpose, the extended rule model is analyzed to identify its limitations and the properties that it supports to be considered in the rule management language proposed. The result of this analysis is used to define a rule repository, necessary for storing the rule types proposed. This repository stores a rules set which must be consistent, as well as data must be consistent in the database. Hence, a consistency rule set is defined. Besides, a rule management operations set is defined to help to handle rules and their elements, stored in the rule repository.

<p>An active database management system can react to predefined events in the database, resulting in performing some appropriate action. ECA-rules are used to capture these predefined events and to express the appropriate action in the active database management system. An event is said to be an atomic occurrence and is either primitive or composite. D-SNOOP and O-SNOOP are two ways to describe the semantics of composite events. D-SNOOP is detection-based (an event is considered to be instantaneous) and O-SNOOP occurrence-based (an event is considered to occur over a time interval). Some problems concerning the detection of composite events using D-SNOOP semantics have been highlighted by Galton and Augusto (2001), who have created the O-SNOOP semantics to rectify some of the shortcomings of D-SNOOP. It is, however, not known what practical consequences O-SNOOP has on applications. To find some of these practical consequences, an advanced application that uses composite events must be used. In this work, the advanced application is a cooperative information system.</p><p>A cooperative information system is a system in which several agents work together to solve some common problem. The agents can take on a role as either manager (service requester) or agent (problem solver).</p><p>In this dissertation an investigation of the differences between O-SNOOP and D-SNOOP in applications handling cooperation protocols is presented. Our first objective has been to model a cooperation protocol using in turn the D-SNOOP and the O-SNOOP semantics. A further objective has been to compare the models of the cooperation protocols to identify any differences between using D-SNOOP and O-SNOOP semantics in applications handling cooperation protocols.</p>

An active database management system can react to predefined events in the database, resulting in performing some appropriate action. ECA-rules are used to capture these predefined events and to express the appropriate action in the active database management system. An event is said to be an atomic occurrence and is either primitive or composite. D-SNOOP and O-SNOOP are two ways to describe the semantics of composite events. D-SNOOP is detection-based (an event is considered to be instantaneous) and O-SNOOP occurrence-based (an event is considered to occur over a time interval). Some problems concerning the detection of composite events using D-SNOOP semantics have been highlighted by Galton and Augusto (2001), who have created the O-SNOOP semantics to rectify some of the shortcomings of D-SNOOP. It is, however, not known what practical consequences O-SNOOP has on applications. To find some of these practical consequences, an advanced application that uses composite events must be used. In this work, the advanced application is a cooperative information system. A cooperative information system is a system in which several agents work together to solve some common problem. The agents can take on a role as either manager (service requester) or agent (problem solver). In this dissertation an investigation of the differences between O-SNOOP and D-SNOOP in applications handling cooperation protocols is presented. Our first objective has been to model a cooperation protocol using in turn the D-SNOOP and the O-SNOOP semantics. A further objective has been to compare the models of the cooperation protocols to identify any differences between using D-SNOOP and O-SNOOP semantics in applications handling cooperation protocols.

Knowledge intensive applications require an intelligent environment, which can perform deductions in response to user queries or events that occur inside or outside of the applications. For that, we propose a Fuzzy Petri Net (FPN) model to represent the knowledge and the behavior in an intelligent object-oriented database environment, which integrates fuzzy, active and deductive rules with database objects. By gaining intelligent behaviour, the system maintains objects to perceive dynamic occurences and user queries. Thus, objects can produce new knowledge or keep themselves in a consistent, stable, and upto-date state. The behavior of a system can be unpredictable due to the rules triggering or untriggering each other (non-termination). Intermediate and final database states may also differ according to the order of rule executions (non-confluence). In order to foresee and solve problematic behavior patterns, we employ static rule analysis on the FPN structure that provides easy checking of the termination property without requiring any extra construct. In addition, with our proposed inference algorithm, we guarantee confluent rule executions. The techniques and solutions provided in this study can be utilized in various complex systems, such as weather forecasting applications, environmental information systems, defense applications, video database applications, etc. We implement a prototype of the model for the weather forecasting of the Central Anatolia Region

Orientadores: Mario Jino, Plinio Roberto Souza Vilela / Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação / Made available in DSpace on 2018-08-05T17:50:16Z (GMT). No. of bitstreams: 1 LeitaoJunior_PliniodeSa_D.pdf: 1822006 bytes, checksum: d9b1eca29d417bcd74707f2e6c4d1eef (MD5) Previous issue date: 2005 / Resumo: Bancos de dados ativos têm sido usados como uma alternativa à implementação de parte da funcionalidade de muitas aplicações em diversas áreas de conhecimento. A idéia básica é a resposta automática à ocorrência de eventos pela ativação de tarefas com funções específicas, conduzindo à execução de regras ativas. A despeito do uso difundido dessa tecnologia, pouco esforço de pesquisa tem sido direcionado ao teste de aplicações de bancos de dados ativos. Nesta pesquisa, nós investigamos o uso de uma técnica de teste estrutural para revelar a presença de defeitos, visando à melhoria de qualidade e ao aumento do nível de confiança com relação a este tipo de software. Uma família de critérios de adequação é proposta e analisada, no âmbito de regras ativas escritas em SQL. Especificamente, um modelo de interação entre regras é elaborado, visando à abstração de associações de interação, as quais formam a base para os requisitos de teste. No contexto de teste estrutural baseado em fluxo de dados, é definido um conjunto de critérios de adequação, denominados Critérios Baseados na Interação entre Regras, que requerem o exercício de associações de interação. Os critérios são uma extensão ao critério todos usos, pela exploração de relações de fluxo de dados persistentes devido a interações entre regras. Investigações teóricas e empíricas foram conduzidas, demonstrando que os critérios demonstram habilidade na detecção dos defeitos com complexidade polinomial. Defeitos e falhas de manipulação foram estudados, enumerados e utilizados em um experimento que avalia a habilidade de detecção de defeitos dos critérios em diferentes granularidades: precisões da análise de fluxo de dados. Uma ferramenta chamada ADAPT-TOOL (Active Database APplication Testing TOOL for active rules written in SQL) foi construída para suportar o experimento. Os resultados indicam que: (i) a eficácia de detecção de defeitos alcançou 2/3 do conjunto adequado, obtendo-se valores mais elevados para granularidades menos precisas; e (ii) a cobertura de associações de interação em granularidades mais precisas não melhora a habilidade de revelar defeitos / Abstract: Active Rule databases have been used as an alternative to the partial implementation of applications in several knowledge domains. Their principle is the automatic response to events by the activation of tasks with specific functionalities, leading to the execution of active rules. Notwithstanding their widespread use, few research efforts have been concentrated on active database application testing. In this research work we investigate the use of a structural testing technique to reveal the presence of faults, aimed at improving reliability and overall quality of this kind of software. A family of adequacy criteria is proposed and analysed in the active SQL-based database realm. Specifically, an interaction model between rules is elaborated, in order to abstract interaction associations that form the basis for testing requirements. In the context of data flow based structural testing, a family of adequacy criteria is defined, called Interaction Between Rules based Criteria, that demands the coverage of interaction associations. The criteria are an extension to the all uses criterion, by the exploitation of persistent data flow relations associated to rule interaction. Both theoretical and empirical investigations were performed, showing that the criteria posses fault detecting ability with polynomial complexity. Manipulation faults and failures were studied, enumerated and used in an experiment that evaluates criteria fault detecting ability at different granularities: data flow analysis precisions. A tool called ADAPT-TOOL (Active Database APplication Testing TOOL for active rules written in SQL) was built to support the experiment. The results indicate that: i) the fault-detecting efficacy was 2/3 of the adequate set, and reaches higher values for the lower data flow analysis precision; and (ii) the coverage of interaction association at higher granularities does not improve the fault detecting ability / Doutorado / Engenharia de Computação / Doutor em Engenharia Elétrica