Project-Join-Repair: An Approach to Consistent Query Answering Under Functional Dependencies
نویسنده
چکیده
Algebra-based identification of tree patterns in XQuery p. 13 Approximate querying of XML fuzzy data p. 26 Relaxation paradigm in a flexible querying context p. 39 A functional model for data analysis p. 51 Materialization-based range and k-nearest neighbor query processing algorithms p. 65 Flexible querying using structural and event based multimodal video data model p. 75 Reverse nearest neighbor search in peer-to-peer systems p. 87 On tuning OWA operators in a flexible querying interface p. 97 Towards a flexible visualization tool for dealing with temporal data p. 109 XML-structured documents : retrievable units and inheritance p. 121 Term disambiguation in natural language query for XML p. 133 Using structural relationships for focused XML retrieval p. 147 XML fuzzy ranking p. 159 A flexible news filtering model exploiting a hierarchical fuzzy categorization p. 170 Query phrase suggestion from topically tagged session logs p. 185 Why using structural hints in XML retrieval? p. 197 A fuzzy extension for the XPath query language p. 210 Towards flexible information retrieval based on CP-nets p. 222 Highly heterogeneous XML collections : how to retrieve precise results? p. 232 Evaluation of system measures for incomplete relevance judgment in IR p. 245 A hierarchical document clustering environment based on the induced bisecting k-means p. 257 Search strategies for finding annotations and annotated documents : the FAST service p. 270 Assisted query formulation using normalised word vector and dynamic ontological filtering p. 282 Fuzzy query answering in motor racing domain p. 295 Using a fuzzy object-relational database for colour image retrieval p. 307 Structural and semantic modeling of audio for content-based querying and browsing p. 319 Similarity between multi-valued thesaurus attributes : theory and application in multimedia systems p. 331 Robust query processing for personalized information access on the semantic Web p. 343 Navigating multimodal meeting recordings with the meeting miner p. 356 Personalized Web recommendation based on path clustering p. 368 The lookahead principle for preference elicitation : experimental results p. 378 Improving the user-system interaction in a Web multi-agent system using fuzzy multi-granular linguistic information p. 390 Using dynamic fuzzy ontologies to understand creative environments p. 404
منابع مشابه
Consistent Query Answers in the Presence of Universal Constraints
The framework of consistent query answers and repairs has been introduced to alleviate the impact of inconsistent data on the answers to a query. A repair is a minimally different consistent instance and an answer is consistent if it is present in every repair. In this article we study the complexity of consistent query answers and repair checking in the presence of universal constraints. We pr...
متن کاملS ep 2 00 8 Consistent Query Answers in the Presence of Universal Constraints ⋆
The framework of consistent query answers and repairs has been introduced to alleviate the impact of inconsistent data on the answers to a query. A repair is a minimally different consistent instance and an answer is consistent if it is present in every repair. In this article we study the complexity of consistent query answers and repair checking in the presence of universal constraints. We pr...
متن کاملCertain Query Answering in Partially Consistent Databases
A database is called uncertain if two or more tuples of the same relation are allowed to agree on their primary key. Intuitively, such tuples act as alternatives for each other. A repair (or possible world) of such uncertain database is obtained by selecting a maximal number of tuples without ever selecting two tuples of the same relation that agree on their primary key. For a Boolean query q, ...
متن کاملOn the finite controllability of conjunctive query answering in databases under open-world assumption
In this paper we study queries over relational databases with integrity constraints (ICs). The main problem we analyze is OWA query answering, i.e., query answering over a database with ICs under open-world assumption. The kinds of ICs that we consider are inclusion dependencies and functional dependencies, in particular key dependencies; the query languages we consider are conjunctive queries ...
متن کاملSome Research Directions in Consistent Query Answering: A Vision
Research in consistent query answering (CQA) in databases was initiated in the database community with the publication of [1], where the main goal was to formalize the notion of consistent answer to a query posed to a possibly inconsistent database, i.e. that fails to satisfy a given set of integrity constraints (ICs) that are not enforced by the system. For many reasons [9], such inconsistenci...
متن کاملQuery Rewriting in the Presence of Functional Dependencies with Lossless Join Decomposition
Query rewriting is an essential issue in data integration systems over the Web and has received considerable attention. Many rewriting algorithms, e.g., the bucket algorithm, the inverse rules algorithm, the SVB algorithm and the MiniCon algorithm, have been proposed to address this issue in the absence of functional dependencies. These algorithms can be divided into two categories: bucket-base...
متن کامل