Database Repairing and Consistent Query Answering

┬╖ Springer Nature
рдИ-рдмреБрдХ
105
рдкреЗрдЬ
рд░реЗрдЯрд┐рдВрдЧ рдФрд░ рд╕рдореАрдХреНрд╖рд╛рдУрдВ рдХреА рдкреБрд╖реНрдЯрд┐ рдирд╣реАрдВ рд╣реБрдИ рд╣реИ ┬ардЬрд╝реНрдпрд╛рджрд╛ рдЬрд╛рдиреЗрдВ

рдЗрд╕ рдИ-рдмреБрдХ рдХреЗ рдмрд╛рд░реЗ рдореЗрдВ рдЬрд╛рдирдХрд╛рд░реА

Integrity constraints are semantic conditions that a database should satisfy in order to be an appropriate model of external reality. In practice, and for many reasons, a database may not satisfy those integrity constraints, and for that reason it is said to be inconsistent. However, and most likely, a large portion of the database is still semantically correct, in a sense that has to be made precise. After having provided a formal characterization of consistent data in an inconsistent database, the natural problem emerges of extracting that semantically correct data, as query answers. The consistent data in an inconsistent database is usually characterized as the data that persists across all the database instances that are consistent and minimally differ from the inconsistent instance. Those are the so-called repairs of the database. In particular, the consistent answers to a query posed to the inconsistent database are those answers that can be simultaneously obtained from all the database repairs. As expected, the notion of repair requires an adequate notion of distance that allows for the comparison of databases with respect to how much they differ from the inconsistent instance. On this basis, the minimality condition on repairs can be properly formulated. In this monograph we present and discuss these fundamental concepts, different repair semantics, algorithms for computing consistent answers to queries, and also complexity-theoretic results related to the computation of repairs and doing consistent query answering. Table of Contents: Introduction / The Notions of Repair and Consistent Answer / Tractable CQA and Query Rewriting / Logically Specifying Repairs / Decision Problems in CQA: Complexity and Algorithms / Repairs and Data Cleaning

рд▓реЗрдЦрдХ рдХреЗ рдмрд╛рд░реЗ рдореЗрдВ

Leopoldo Bertossi has been Full Professor at the School of Computer Science, Carleton University (Ottawa, Canada) since 2001. He is Faculty Fellow of the IBM Center for Advanced Studies. He obtained a Ph.D. in Mathematics from the Pontifical Catholic University of Chile (PUC) in 1988. He has been the theme leader for тАЬAdaptive Data Quality and Data Cleaning" of the тАЬNSERC Strategic Network for Data Management for Business Intelligence" (BIN), an ongoing umbrella research project that involves more than 15 academic researchers across Canada plus several industrial partners. Until 2001 he was professor and departmental chair (1993тАУ1995) at the Department of Computer Science, PUC, and was also the President of the Chilean Computer Science Society (SCCC) in 1996 and 1999тАУ2000. He has been visiting professor at the computer science departments of the universities of Toronto (1989/90), Wisconsin-Milwaukee (1990/91), Marseille-Luminy (1997) and visiting re[1]searcher at the Technical University Berlin (1997/98), visiting researcher and professor at the Free University of Bolzano-Bozen (Italy). In 2006, he was a visiting researcher at the Technical University of Vienna as a Pauli Fellow of the тАЬWolfgang Pauli Institute (WPI) Vienna". Prof. BertossiтАЩs research interests include database theory, data integration, peer data management, semantic web, intelligent information systems, data quality for business intelligence, knowledge representation, logic programming, and computational logic.

рдЗрд╕ рдИ-рдмреБрдХ рдХреЛ рд░реЗрдЯрд┐рдВрдЧ рджреЗрдВ

рд╣рдореЗрдВ рдЕрдкрдиреА рд░рд╛рдп рдмрддрд╛рдПрдВ.

рдкрдарди рдЬрд╛рдирдХрд╛рд░реА

рд╕реНрдорд╛рд░реНрдЯрдлрд╝реЛрди рдФрд░ рдЯреИрдмрд▓реЗрдЯ
Android рдФрд░ iPad/iPhone рдХреЗ рд▓рд┐рдП Google Play рдХрд┐рддрд╛рдмреЗрдВ рдРрдкреНрд▓рд┐рдХреЗрд╢рди рдЗрдВрд╕реНрдЯреЙрд▓ рдХрд░реЗрдВ. рдпрд╣ рдЖрдкрдХреЗ рдЦрд╛рддреЗ рдХреЗ рд╕рд╛рде рдЕрдкрдиреЗ рдЖрдк рд╕рд┐рдВрдХ рд╣реЛ рдЬрд╛рддрд╛ рд╣реИ рдФрд░ рдЖрдкрдХреЛ рдХрд╣реАрдВ рднреА рдСрдирд▓рд╛рдЗрди рдпрд╛ рдСрдлрд╝рд▓рд╛рдЗрди рдкрдврд╝рдиреЗ рдХреА рд╕реБрд╡рд┐рдзрд╛ рджреЗрддрд╛ рд╣реИ.
рд▓реИрдкрдЯреЙрдк рдФрд░ рдХрдВрдкреНрдпреВрдЯрд░
рдЖрдк рдЕрдкрдиреЗ рдХрдВрдкреНрдпреВрдЯрд░ рдХреЗ рд╡реЗрдм рдмреНрд░рд╛рдЙрдЬрд╝рд░ рдХрд╛ рдЙрдкрдпреЛрдЧ рдХрд░рдХреЗ Google Play рдкрд░ рдЦрд░реАрджреА рдЧрдИ рдСрдбрд┐рдпреЛ рдХрд┐рддрд╛рдмреЗрдВ рд╕реБрди рд╕рдХрддреЗ рд╣реИрдВ.
eReaders рдФрд░ рдЕрдиреНрдп рдбрд┐рд╡рд╛рдЗрд╕
Kobo рдИ-рд░реАрдбрд░ рдЬреИрд╕реА рдИ-рдЗрдВрдХ рдбрд┐рд╡рд╛рдЗрд╕реЛрдВ рдкрд░ рдХреБрдЫ рдкрдврд╝рдиреЗ рдХреЗ рд▓рд┐рдП, рдЖрдкрдХреЛ рдлрд╝рд╛рдЗрд▓ рдбрд╛рдЙрдирд▓реЛрдб рдХрд░рдХреЗ рдЙрд╕реЗ рдЕрдкрдиреЗ рдбрд┐рд╡рд╛рдЗрд╕ рдкрд░ рдЯреНрд░рд╛рдВрд╕рдлрд╝рд░ рдХрд░рдирд╛ рд╣реЛрдЧрд╛. рдИ-рд░реАрдбрд░ рдкрд░ рдХрд╛рдо рдХрд░рдиреЗ рд╡рд╛рд▓реА рдлрд╝рд╛рдЗрд▓реЛрдВ рдХреЛ рдИ-рд░реАрдбрд░ рдкрд░ рдЯреНрд░рд╛рдВрд╕рдлрд╝рд░ рдХрд░рдиреЗ рдХреЗ рд▓рд┐рдП, рд╕рд╣рд╛рдпрддрд╛ рдХреЗрдВрджреНрд░ рдХреЗ рдирд┐рд░реНрджреЗрд╢реЛрдВ рдХрд╛ рдкрд╛рд▓рди рдХрд░реЗрдВ.