World-set decompositions: Expressiveness and efficient algorithms

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

Volumn 4353 LNCS, Issue , 2006, Pages 194-208

  Antova, Lyublena ^a   Koch, Christoph ^a   Olteanu, Dan ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EXPRESSIVE POWER; MANAGEMENT SCENARIOS; NATURAL GENERALIZATION; POLYNOMIAL-TIME ALGORITHMS; POSSIBLE WORLDS; REAL-WORLD; UNCERTAIN DATAS; UNCERTAIN INFORMATIONS;

INFORMATION MANAGEMENT;

ALGORITHMS;

EID: 84878745829     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11965893_14     Document Type: Conference Paper

References (18)

1. S. Abiteboul and O. M. Duschka. "Complexity of Answering Queries Using Materialized Views". In Proc. PODS, pages 254-263, 1998.
2. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
3. S. Abiteboul, P. Kanellakis, and G. Grahne. On the representation and querying of sets of possible worlds. Theor. Comput. Sci., 78(1):158-187, 1991.
4. P. Andritsos, A. Fuxman, and R. J. Miller. Clean answers over dirty databases: A probabilistic approach. In Proc. ICDE, 2006.
5. L. Antova, C. Koch, and D. Olteanu. World-set decompositions: Expressiveness and efficient algorithms. Technical Report INFOSYS-TR-2006-12, Saarland University.
6. 106 worlds and beyond: Efficient representation and processing of incomplete information. In Proc. ICDE, 2007.
7. M. Arenas, L. E. Bertossi, and J. Chomicki. "Answer sets for consistent query answering in inconsistent databases". TPLP, 3(4-5):393-424, 2003.
8. O. Benjelloun, A. D. Sarma, A. Halevy, and J. Widom. ULDBs: Databases with uncertainty and lineage. In Proc. VLDB, 2006.
9. L. E. Bertossi, L. Bravo, E. Franconi, and A. Lopatenko. "Complexity and Approximation of Fixing Numerical Attributes in Databases Under Integrity Constraints". In Proc. DBPL, pages 262-278, 2005.
10. P. Bohannon, W. Fan, M. Flaster, and R. Rastogi. "A Cost-Based Model and Effective Heuristic for Repairing Constraints by Value Modification". In Proc. SIGMOD, June 2005.
11. R. K. Bryant. Factoring logic functions. IBM J. Res. Develop., 31(2), 1987.
12. D. Calvanese, G. D. Giacomo, M. Lenzerini, and R. Rosati. "Logical Foundations of Peer-To-Peer Data Integration". In PODS 2004, pages 241-251, 2004.
13. J. Chomicki, J. Marcinkowski, and S. Staworko. "Computing consistent query answers using conflict hypergraphs". In Proc. CIKM, pages 417-426, 2004.
14. N. Dalvi and D. Suciu. Efficient query evaluation on probabilistic databases. In Proc. VLDB, pages 864-875, 2004.
15. G. Grahne. Dependency satisfaction in databases with incomplete information. In Proc. VLDB, pages 37-45, 1984.
16. G. Grahne. The Problem of Incomplete Information in Relational Databases. Number 554 in LNCS. Springer-Verlag, 1991.
17. T. J. Green and V. Tannen. "Models for Incomplete and Probabilistic Information". In International Workshop on Incompleteness and Inconsistency in Databases (IIDB), 2006.
18. T. Imielinski and W. Lipski. Incomplete information in relational databases. Journal of ACM, 31:761-791, 1984.