A Survey of Current Methods for Integrity Constraint Maintenance and View Updating

Author(s):  
Enric Mayol ◽  
Ernest Teniente
Keyword(s):  
Author(s):  
Béatrice Bouchou ◽  
Mirian Halfeld Ferrari ◽  
Maria Adriana Vidigal Lima

Author(s):  
Joao Cavalcanti ◽  
David Robertson

The continuing increase in size and complexity of Web sites has turned their design and construction into a challenging problem. Systematic approaches can bring many benefits to Web site construction, making development more methodical and maintenance less time consuming. Computational logic can be successfully used to tackle this problem, as it supports declarative specifications and reasoning about specifications in a more natural way. Computational logic also offers metaprogramming capabilities that can be used to develop methods for automated Web site synthesis. This chapter presents an approach to Web site synthesis based on computational logic and discusses in more detail two important features of the proposed approach: the support for property checking and integrity constraint specification and verification.


2018 ◽  
Vol 15 (3) ◽  
pp. 821-843
Author(s):  
Jovana Vidakovic ◽  
Sonja Ristic ◽  
Slavica Kordic ◽  
Ivan Lukovic

A database management system (DBMS) is based on a data model whose concepts are used to express a database schema. Each data model has a specific set of integrity constraint types. There are integrity constraint types, such as key constraint, unique constraint and foreign key constraint that are supported by most DBMSs. Other, more complex constraint types are difficult to express and enforce and are mostly completely disregarded by actual DBMSs. The users have to manage those using custom procedures or triggers. eXtended Markup Language (XML) has become the universal format for representing and exchanging data. Very often XML data are generated from relational databases and exported to a target application or another database. In this context, integrity constraints play the essential role in preserving the original semantics of data. Integrity constraints have been extensively studied in the relational data model. Mechanisms provided by XML schema languages rely on a simple form of constraints that is sufficient neither for expressing semantic constraints commonly found in databases nor for expressing more complex constraints induced by the business rules of the system under study. In this paper we present a classification of constraint types in relational data model, discuss possible declarative mechanisms for their specification and enforcement in the XML data model, and illustrate our approach to the definition and enforcement of complex constraint types in the XML data model on the example of extended tuple constraint type.


Author(s):  
Hannah Sande

This paper examines two case studies of morpheme-specific reduplication that copy from a syntactic domain larger than a root but smaller than a word, providing an analysis in Cophonologies by Phase (CBP) of both morpheme-specific phonotactic requirements in different reduplication processes and of the amount of structure copied in reduplication. The first case study comes from Guébie (Kru, Ivory Coast), where reduplication marks both nominalization and reciprocals (among others). In both morphosyntactic environments, reduplication copies the verb plus valency-changing affixes, but the reduplicants are subject to different sets of phonotactic restrictions. The second case study comes from Kinande (Bantu, Democratic Republic of Congo) where there is reduplication of nouns as well as verbs. Nominal and verbal reduplication both involve a two-syllable reduplicant that copies from the root plus some--but not all--affixes, and both are subject to a morpheme integrity constraint. However, the two reduplication processes differ in whether they are prefixing or suffixing, whether they copy from right-to-left or left-to-right, and in which repair to the morpheme integrity constraint is preferred.While other frameworks such as traditional Cophonology Theory, Stratal OT, or Indexed Constraints could also account for the morpheme-specific phonological behavior of reduplicants, CBP has the added benefit of straightforwardly accounting for the amount of structure that serves as the base of reduplication in each case. This paper contributes to the growing literature on morphophonological interactions that can be accounted for within CBP.


Sign in / Sign up

Export Citation Format

Share Document