The Hybrid Probabilistic Query Algorithms Based on Inconsistent Database

Author(s):  
Hongyu Gao
2014 ◽  
Vol 14 (5&6) ◽  
pp. 467-492
Author(s):  
Asif Shakeel

The Hidden Subgroup Problem (HSP) is at the forefront of problems in quantum algorithms. In this paper, we introduce a new query, the \textit{character} query, generalizing the well-known phase kickback trick that was first used successfully to efficiently solve Deutsch's problem. An equal superposition query with $\vert 0 \rangle$ in the response register is typically used in the ``standard method" of single-query algorithms for the HSP. The proposed character query improves over this query by maximizing the success probability of subgroup identification under a uniform prior, for the HSP in which the oracle functions take values in a finite abelian group. We apply our results to the case when the subgroups are drawn from a set of conjugate subgroups and obtain a success probability greater than that found by Moore and Russell.


2011 ◽  
Vol 4 (11) ◽  
pp. 1169-1180 ◽  
Author(s):  
Liping Peng ◽  
Yanlei Diao ◽  
Anna Liu

Author(s):  
Meghyn Bienvenu ◽  
Camille Bourgaux

In this paper, we explore the issue of inconsistency handling over prioritized knowledge bases (KBs), which consist of an ontology, a set of facts, and a priority relation between conflicting facts. In the database setting, a closely related scenario has been studied and led to the definition of three different notions of optimal repairs (global, Pareto, and completion) of a prioritized inconsistent database. After transferring the notions of globally-, Pareto- and completion-optimal repairs to our setting, we study the data complexity of the core reasoning tasks: query entailment under inconsistency-tolerant semantics based upon optimal repairs, existence of a unique optimal repair, and enumeration of all optimal repairs. Our results provide a nearly complete picture of the data complexity of these tasks for ontologies formulated in common DL-Lite dialects. The second contribution of our work is to clarify the relationship between optimal repairs and different notions of extensions for (set-based) argumentation frameworks. Among our results, we show that Pareto-optimal repairs correspond precisely to stable extensions (and often also to preferred extensions), and we propose a novel semantics for prioritized KBs which is inspired by grounded extensions and enjoys favourable computational properties. Our study also yields some results of independent interest concerning preference-based argumentation frameworks.


2014 ◽  
Vol 05 (03) ◽  
pp. 757-772 ◽  
Author(s):  
R. Benkert ◽  
P. Dennehy ◽  
J. White ◽  
A. Hamilton ◽  
C. Tanner ◽  
...  

SummaryBackground: In this new era after the Health Information Technology for Economic and Clinical Health (HITECH) Act of 2009, the literature on lessons learned with electronic health record (EHR) implementation needs to be revisited.Objectives: Our objective was to describe what implementation of a commercially available EHR with built-in quality query algorithms showed us about our care for diabetes and hypertension populations in four safety net clinics, specifically feasibility of data retrieval, measurements over time, quality of data, and how our teams used this data.Methods: A cross-sectional study was conducted from October 2008 to October 2012 in four safety-net clinics located in the Midwest and Western United States. A data warehouse that stores data from across the U.S was utilized for data extraction from patients with diabetes or hypertension diagnoses and at least two office visits per year. Standard quality measures were collected over a period of two to four years. All sites were engaged in a partnership model with the IT staff and a shared learning process to enhance the use of the quality metrics.Results: While use of the algorithms was feasible across sites, challenges occurred when attempting to use the query results for research purposes. There was wide variation of both process and outcome results by individual centers. Composite calculations balanced out the differences seen in the individual measures. Despite using consistent quality definitions, the differences across centers had an impact on numerators and denominators. All sites agreed to a partnership model of EHR implementation, and each center utilized the available resources of the partnership for Center-specific quality initiatives.Conclusions: Utilizing a shared EHR, a Regional Extension Center-like partnership model, and similar quality query algorithms allowed safety-net clinics to benchmark and improve the quality of care across differing patient populations and health care delivery models.Citation: Benkert R, Dennehy P, White J, Hamilton A, Tanner C, Pohl JM. Diabetes and hypertension quality measurement in four safety-net sites: Lessons learned after implementation of the same commercial electronic health record. Appl Clin Inf 2014; 5: 757–772http://dx.doi.org/10.4338/ACI-2014-03-RA-0019


Author(s):  
Sergio Flesca ◽  
Sergio Greco ◽  
Ester Zumpano

Integrity constraints are a fundamental part of a database schema. They are generally used to define constraints on data (functional dependencies, inclusion dependencies, exclusion dependencies, etc.), and their enforcement ensures a semantically correct state of a database. As the presence of data inconsistent with respect to integrity constraints is not unusual, its management plays a key role in all the areas in which duplicate or conflicting information is likely to occur, such as database integration, data warehousing, and federated databases (Bry, 1997; Lin, 1996; Subrahmanian, 1994). It is well known that the presence of inconsistent data can be managed by “repairing” the database, that is, by providing consistent databases, obtained by a minimal set of update operations on the inconsistent original environment, or by consistently answering queries posed over the inconsistent database.


2019 ◽  
Vol 48 (3) ◽  
pp. 903-925 ◽  
Author(s):  
Srinivasan Arunachalam ◽  
Jop Briët ◽  
Carlos Palazuelos

Sign in / Sign up

Export Citation Format

Share Document