World-set decompositions: Expressiveness and efficient algorithms

Theoretical Computer Science

Volumn 403, Issue 2-3, 2008, Pages 265-284

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

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b Department of Obstetrics Gynecology   (United States)

Author keywords

Databases; Incomplete information; Relational factorization; Representation systems

Indexed keywords

BOOLEAN FUNCTIONS; DATA PROCESSING; DATA STORAGE EQUIPMENT; DIGITAL SIGNAL PROCESSING; INFORMATION MANAGEMENT; MANAGEMENT INFORMATION SYSTEMS; NUCLEAR PROPULSION;

EFFICIENT ALGORITHMS; EXPRESSIVE POWER; FINITE SETS; NATURAL GENERALIZATION; NP-HARD; POLYNOMIAL-TIME ALGORITHMS; POSSIBLE WORLDS; REAL-WORLD DATA; UNCERTAIN DATA; UNCERTAIN INFORMATIONS;

SET THEORY;

EID: 48449092575     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.05.004     Document Type: Article

References (19)

1. S. Abiteboul, O.M. Duschka, Complexity of answering queries using materialized views, in: Proc. PODS, 1998, pp. 254-263
2. Abiteboul S., Hull R., and Vianu V. Foundations of Databases (1995), Addison-Wesley
3. Abiteboul S., Kanellakis P., and Grahne G. On the representation and querying of sets of possible worlds. Theoret. Comput. Sci. 78 1 (1991) 158-187
4. P. Andritsos, A. Fuxman, R.J. Miller, Clean answers over dirty databases: A probabilistic approach, in: Proc. ICDE, 2006
5. 106 worlds and beyond: Efficient representation and processing of incomplete information, in: Proc. ICDE, 2007
6. L. Antova, C. Koch, D. Olteanu, World-set decompositions: Expressiveness and efficient algorithms, in: Proc. ICDT, 2007, pp. 194-208
7. Arenas M., Bertossi L.E., and Chomicki J. Answer sets for consistent query answering in inconsistent databases. TPLP 3 4-5 (2003) 393-424
8. O. Benjelloun, A.D. Sarma, A. Halevy, J. Widom, ULDBs: Databases with uncertainty and lineage, in: Proc. VLDB, 2006
9. L.E. Bertossi, L. Bravo, E. Franconi, A. Lopatenko, Complexity and approximation of fixing numerical attributes in databases under integrity constraints, in: Proc. DBPL, 2005, pp. 262-278
10. P. Bohannon, W. Fan, M. Flaster, R. Rastogi, A cost-based model and effective heuristic for repairing constraints by value modification, in: Proc. SIGMOD, June 2005
11. Brayton R.K. Factoring logic functions. IBM J. Res. Dev. 31 2 (1987)
12. D. Calvanese, G.D. Giacomo, M. Lenzerini, R. Rosati, Logical foundations of peer-to-peer data integration, in: Proc. PODS, 2004, pp. 241-251
13. J. Chomicki, J. Marcinkowski, S. Staworko, Computing consistent query answers using conflict hypergraphs, in: Proc. CIKM, 2004, pp. 417-426
14. N. Dalvi, D. Suciu, Efficient query evaluation on probabilistic databases, in: Proc. VLDB, 2004, pp. 864-875
15. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freeman
16. G. Grahne, Dependency satisfaction in databases with incomplete information, in: Proc. VLDB, 1984, pp. 37-45
17. Grahne G. The Problem of Incomplete Information in Relational Databases. LNCS vol. 554 (1991), Springer-Verlag
18. T.J. Green, V. Tannen, Models for incomplete and probabilistic information, in: International Workshop on Incompleteness and Inconsistency in Databases, IIDB, 2006
19. Imielinski T., and Lipski W. Incomplete information in relational databases. J. ACM 31 (1984) 761-791