Scalar aggregation in fd-inconsistent databases

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1973, Issue , 2001, Pages 39-53

  Arenas, Marcelo ^a   Bertossi, Leopoldo ^b   Chomicki, Jan ^c  

^a UNIVERSITY OF TORONTO   (Canada)

^b PONTIFICIA UNIVERSIDAD CATÓLICA DE CHILE   (Chile)

^c Department of Computer Science and Engineering ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

QUERY LANGUAGES; QUERY PROCESSING;

AGGREGATION QUERIES; FUNCTIONAL DEPENDENCY; INCONSISTENT DATABASE; MINIMAL REPAIR; NOVEL APPLICATIONS; PERFECT GRAPH; QUERY EVALUATION;

GRAPH THEORY;

EID: 84949453663     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44503-x_3     Document Type: Conference Paper

References (15)

1. S. Agarwal, A.M. Keller, G. Wiederhold, and K. Saraswat. Flexible Relation: An Approach for Integrating Data from Multiple, Possibly Inconsistent Databases. In IEEE International Conference on Data Engineering, 1995.
2. M. Arenas, L. Bertossi, and J. Chomicki. Consistent Query Answers in Inconsistent Databases. In Proc. ACM Symposium on Principles of Database Systems (ACM PODS'99, Philadelphia), pages 68-79, 1999.
3. C. Baral, S. Kraus, J. Minker, and V.S. Subrahmanian. Combining Knowledge Bases Consisting of First-Order Theories. Computational Intelligence, 8:45-71, 1992.
4. D. P. Bovet and P. Crescenzi. Introduction to the Theory of Complexity. Prentice Hall, 1994.
5. A. Brandstädt, V. B. Le, and J. P. Spinrad. Graph Classes: A Survey. SIAM, 1999.
6. F. Bry. Query Answering in Information Systems with Integrity Constraints. In IFIP WG 11.5 Working Conference on Integrity and Control in Information Systems. Chapman &Hall, 1997.
7. A. K. Chandra and D. Harel. Computable Queries for Relational Databases. Journal of Computer and System Sciences, 21:156-178, 1980.
8. Phan Minh Dung. Integrating Data from Possibly Inconsistent Databases. In International Conference on Cooperative Information Systems, Brussels, Belgium, 1996.
9. Fanica Gavril. Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph. SIAM Journal on Computing, 1(2):180-187, 1972.
10. W-L. Hsu and G.L. Nemhauser. Algorithms for Minimum Covering by Cliques and Maximum Clique in Claw-free Perfect Graphs. Discrete Mathematics, 37:181-191, 1981.
11. T. Imieliński and W. Lipski. Incomplete Information in Relational Databases. Journal of the ACM, 31(4):761-791, 1984.
12. T. Imielinski, S. Naqvi, and K. Vadaparty. Incomplete Objects - A Data Model for Design and Planning Applications. In ACM SIGMOD International Conference on Management of Data, pages 288-297, Denver, Colorado, May 1991.
13. J. Lin and A. O. Mendelzon. Merging Databases under Constraints. International Journal of Cooperative Information Systems, 7(1):55-76, 1996.
14. R. van der Meyden. Logical Approaches to Incomplete Information: A Survey. In J. Chomicki and G. Saake, editors, Logics for Databases and Information Systems, chapter 10. Kluwer Academic Publishers, Boston, 1998.
15. M. Y. Vardi. The Complexity of Relational Query Languages. In ACM Symposium on Theory of Computing, pages 137-146, 1982.