排序方式: 共有16条查询结果,搜索用时 0 毫秒
1.
Cristian Molinaro Jan Chomicki Jerzy Marcinkowski 《Annals of Mathematics and Artificial Intelligence》2009,57(2):103-124
This paper addresses the problem of representing the set of repairs of a possibly inconsistent database by means of a disjunctive database. Specifically, the class of denial constraints is considered. We show that, given a database and a set of denial constraints, there exists a (unique) disjunctive database, called canonical, which represents the repairs of the database w.r.t. the constraints and is contained in any other disjunctive database with the same set of minimal models. We propose an algorithm for computing the canonical disjunctive database. Finally, we study the size of the canonical disjunctive database in the presence of functional dependencies for both subset-based repairs and cardinality-based repairs. 相似文献
2.
Preference queries are relational algebra or SQL queries that contain occurrences of the winnow operator (find the most preferred tuples in a given relation). Such queries are parameterized by specific preference relations. Semantic optimization techniques make use of integrity constraints holding in the database. In the context of semantic optimization of preference queries, we identify two fundamental properties: containment of preference relations relative to integrity constraints and satisfaction of order axioms relative to integrity constraints. We show numerous applications of those notions to preference query evaluation and optimization. As integrity constraints, we consider constraint-generating dependencies, a class generalizing functional dependencies. We demonstrate that the problems of containment and satisfaction of order axioms can be captured as specific instances of constraint-generating dependency entailment. This makes it possible to formulate necessary and sufficient conditions for the applicability of our techniques as constraint validity problems. We characterize the computational complexity of such problems. 相似文献
3.
Nanomotion Detection Method for Testing Antibiotic Resistance and Susceptibility of Slow‐Growing Bacteria
下载免费PDF全文
![点击此处可从《Small (Weinheim an der Bergstrasse, Germany)》网站下载免费的PDF全文](/ch/ext_images/free.gif)
María Ines Villalba Petar Stupar Wojciech Chomicki Massimiliano Bertacchi Giovanni Dietler Laura Arnal María Elena Vela Osvaldo Yantorno Sandor Kasas 《Small (Weinheim an der Bergstrasse, Germany)》2018,14(4)
Infectious diseases are caused by pathogenic microorganisms and are often severe. Time to fully characterize an infectious agent after sampling and to find the right antibiotic and dose are important factors in the overall success of a patient's treatment. Previous results suggest that a nanomotion detection method could be a convenient tool for reducing antibiotic sensitivity characterization time to several hours. Here, the application of the method for slow‐growing bacteria is demonstrated, taking Bordetella pertussis strains as a model. A low‐cost nanomotion device is able to characterize B. pertussis sensitivity against specific antibiotics within several hours, instead of days, as it is still the case with conventional growth‐based techniques. It can discriminate between resistant and susceptible B. pertussis strains, based on the changes of the sensor's signal before and after the antibiotic addition. Furthermore, minimum inhibitory and bactericidal concentrations of clinically applied antibiotics are compared using both techniques and the suggested similarity is discussed. 相似文献
4.
Implementing temporal integrity constraints using an active DBMS 总被引:2,自引:0,他引:2
The paper proposes a general architecture for implementing temporal integrity constraints by compiling them into a set of active DBMS rules. The modularity of the design allows easy adaptation to different environments. Both differences in the specification languages and in the target rule systems can be easily accommodated. The advantages of this architecture are demonstrated on a particular temporal constraint compiler. This compiler allows automatic translation of integrity constraints formulated in Past Temporal Logic into rules of an active DBMS (in the current version of the compiler two active DBMS are supported: Starburst and INGRES). During the compilation the set of constraints is checked for the safe evaluation property. The result is a set of SQL statements that includes all the necessary rules needed for enforcing the original constraints. The rules are optimized to reduce the space overhead introduced by the integrity checking mechanism. There is no need for an additional runtime constraint monitor. When the rules are activated, all updates to the database that violate any of the constraints are automatically rejected (i.e., the corresponding transaction is aborted). In addition to straightforward implementation, this approach offers a clean separation of application programs and the integrity checking code 相似文献
5.
S?awek Staworko Jan Chomicki Jerzy Marcinkowski 《Annals of Mathematics and Artificial Intelligence》2012,64(2-3):209-246
A consistent query answer in an inconsistent database is an answer obtained in every (minimal) repair. The repairs are obtained by resolving all conflicts in all possible ways. Often, however, the user is able to provide a preference on how conflicts should be resolved. We investigate here the framework of preferred consistent query answers, in which user preferences are used to narrow down the set of repairs to a set of preferred repairs. We axiomatize desirable properties of preferred repairs. We present three different families of preferred repairs and study their mutual relationships. Finally, we investigate the complexity of preferred repairing and computing preferred consistent query answers. 相似文献
6.
We propose constraint databases as an intermediate level facilitating the interoperability of spatiotemporal data models. Constraint query languages are used to express translations between different data models. We illustrate our approach in the context of a number of temporal, spatial, and spatiotemporal data models. 相似文献
7.
The binary relation framework has been shown to be applicable to many real-life preference handling scenarios. Here we study preference contraction: the problem of discarding selected preferences. We argue that the property of minimality and the preservation of strict partial orders are crucial for contractions. Contractions can be further constrained by specifying which preferences should be protected. We consider preference relations that are finite or finitely representable using preference formulas. We present algorithms for computing minimal and preference-protecting minimal contractions for finite as well as finitely representable preference relations. We study relationships between preference change in the binary relation framework and belief change in the belief revision theory. We evaluate the proposed algorithms experimentally and present the results. 相似文献
8.
9.
Minimal-change integrity maintenance using tuple deletions 总被引:3,自引:0,他引:3
We address the problem of minimal-change integrity maintenance in the context of integrity constraints in relational databases. We assume that integrity-restoration actions are limited to tuple deletions. We focus on two basic computational issues: repair checking (is a database instance a repair of a given database?) and consistent query answers [in: ACM Symposium on Principles of Database Systems (PODS), 1999, 68] (is a tuple an answer to a given query in every repair of a given database?). We study the computational complexity of both problems, delineating the boundary between the tractable and the intractable cases. We consider denial constraints, general functional and inclusion dependencies, as well as key and foreign key constraints. Our results shed light on the computational feasibility of minimal-change integrity maintenance. The tractable cases should lead to practical implementations. The intractability results highlight the inherent limitations of any integrity enforcement mechanism, e.g., triggers or referential constraint actions, as a way of performing minimal-change integrity maintenance. 相似文献
10.
We study here fundamental issues involved in top-k query evaluation in probabilistic databases. We consider simple probabilistic databases in which probabilities are associated with individual tuples, and general probabilistic databases in which, additionally, exclusivity relationships between tuples can be represented. In contrast
to other recent research in this area, we do not limit ourselves to injective scoring functions. We formulate three intuitive
postulates for the semantics of top-k queries in probabilistic databases, and introduce a new semantics, Global-Topk, that satisfies those postulates to a large degree. We also show how to evaluate queries under the Global-Topk semantics. For simple databases we design dynamic-programming based algorithms. For general databases we show polynomial-time
reductions to the simple cases, and provide effective heuristics to speed up the computation in practice. For example, we
demonstrate that for a fixed k the time complexity of top-k query evaluation is as low as linear, under the assumption that probabilistic databases are simple and scoring functions
are injective.
Research partially supported by NSF grant IIS-0307434. An earlier version of some of the results in this paper was presented
in [1]. 相似文献