Results 221 to 230 of about 118,069 (266)
Some of the next articles are maybe not open access.
Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming, 2004
In this paper we deal with inconsistent databases and propose a logic framework that allows specifying sets of actions which should be performed to make databases consistent (repairs). The motivation of this work stems from the observation that in repairing a database it is natural to express among a set of update operations, the (preferred) actions ...
Sergio Flesca +2 more
openaire +2 more sources
In this paper we deal with inconsistent databases and propose a logic framework that allows specifying sets of actions which should be performed to make databases consistent (repairs). The motivation of this work stems from the observation that in repairing a database it is natural to express among a set of update operations, the (preferred) actions ...
Sergio Flesca +2 more
openaire +2 more sources
On Simplification of Database Integrity Constraints
Fundamenta Informaticae, 2006Without proper simplification techniques, database integrity checking can be prohibitively time consuming. Several methods have been developed for producing simplified incremental checks for each update but none until now of sufficient quality and generality for providing a true practical impact, and the present paper is an attempt to fill this gap. On
H. CHRISTIANSEN, D. MARTINENGHI
openaire +5 more sources
Schema integration with integrity constraints
1997In this paper we discuss the use and treatment of integrity constraints in the federated database design process. We consider different situations occurring frequently in the schema transformation and schema integration process. Based on that, general rules are given which describe the correct treatment of integrity constraints.
Stefan Conrad 0001 +4 more
openaire +1 more source
Integrating rules and constraints
Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94, 2002Constraint satisfaction problem (CSP) is a deductive problem of a special kind, while rule-based systems are the practical programs that have implemented many of the ideas and techniques of deductive systems. Incorporating CSP into a rule-based system allows the rule-based system to exploit the power of CSP techniques in handling this special class of ...
openaire +1 more source
On integrated chance constraints
1986In Chapter 3 we introduced integrated chance constraints (ICCs) as a modeling tool for here-and-now stochastic programming problems; see (3.28). In the present chapter we analyze the mathematical properties of this new concept in some detail. Let us review its rationale. As indicated in Section 3.2, if in the constraints of a linear programming problem
openaire +2 more sources
On mining XML integrity constraints
2011 Sixth International Conference on Digital Information Management, 2011Since XML documents can appear in any semi-structured form, structural and integrity constraints are often imposed on the data that are to be modified or processed. These constraints are formally defined in a schema. But, despite the obvious advantages, the presence of a schema is not mandatory and many XML documents are not joined with any ...
Stanislav Fajt +2 more
openaire +1 more source
Integrity constraints in multiversion databases
1996This paper analyses the extension of integrity constraint mechanisms in order to maintain consistency in multiversion databases is studied. Unlike monoversion databases, a multiversion database represents several states of the modeled universe. Thus, both the notion of consistency and the means to maintain it have to be extended.
Anne Doucet +3 more
openaire +1 more source
Semantics and Pragmatics of Integrity Constraints
2013Modeling of semantics is one of the most difficult tasks in database design. Constraints are used to express database semantics. They are used differently in database modeling languages. They express domain restrictions, specify relationships between components and state database behavior. The utilization depends on the richness of the type system used
Ove Sörensen, Bernhard Thalheim
openaire +1 more source
Integrating ACO and Constraint Propagation
2004Ant Colony Optimisation algorithms perform competitively with other meta-heuristics for many types of optimisation problems, but unfortunately their performance does not always degrade gracefully when the problem contains hard constraints. Many industrially relevant problems, such as fleet routing, rostering and timetabling, are typically subject to ...
Bernd Meyer 0001, Andreas T. Ernst
openaire +1 more source
Transactions and integrity constraints
Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems, 1985Serge Abiteboul, Victor Vianu
openaire +1 more source