OLAP over imprecise data with domain constraints

33rd International Conference on Very Large Data Bases, VLDB 2007 - Conference Proceedings

Volumn , Issue , 2007, Pages 39-50

  Burdick, Doug ^a   Doan, An Hai ^a   Ramakrishnan, Raghu ^b   Vaithyanathan, Shivakumar ^c  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

^b YAHOO RESEARCH   (United States)

^c IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

QUERY LANGUAGES; SEMANTICS;

AGGREGATION QUERIES; CONSTRAINT LANGUAGE; CONSTRAINT SPACES; DOMAIN CONSTRAINT; IMPRECISE DATA; INTEGRITY CONSTRAINTS; MULTI-DIMENSIONAL SPACE; QUERY ANSWERING;

QUERY PROCESSING;

EID: 85011117077     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
2. R. Agrawal, S. Dar, and H. V. Jagadish. Direct transitive closure algorithms: Design and performance evaluation. ACM Trans. Database Syst., 15(3):427-458, 1990.
3. P. Andritsos, A. Fuxman, and R. J. Miller. Clean answers over dirty databases: A probabilistic approach. In ICDE 2006.
4. L. Antova, C. Koch, and D. Olteanu. 10(106) worlds and beyond: Efficient representation and processing of incomplete information. In ICDE 2007.
5. M. Arenas, L. Bertossi, J. Chomicki, X. He, V. Raghavan, and J. Spinrad. Scalar aggregation in inconsistent databases. Theor. Comput. Sci., 296(3):405-434, 2003.
6. L. Bertossi. Consistent query answering in databases. SIGMOD Rec., 35(2):68-76, 2006.
7. D. Burdick, P. M. Deshpande, T. S. Jayram, R. Ramakrishnan, and S. Vaithyanathan. Efficient allocation algorithms for OLAP over imprecise data. In VLDB 2006.
8. D. Burdick, P. M. Deshpande, T. S. Jayram, R. Ramakrishnan, and S. Vaithyanathan. OLAP over uncertain and imprecise data. In VLDB 2005.
9. D. Burdick, A. Doan, R. Ramakrishnan, and S. Vaithyanathan. OLAP over imprecise data with domain constraints. UW-Madison CS Dept tech report cs-tr-1595. 2007.
10. S. Chaudhuri and U. Dayal. An overview of data warehousing and OLAP technology. ACM SIGMOD Record, 26(1):65-74, 1997.
11. J. Chomicki, J. Marcinkowski, and S. Staworko. Computing consistent query answers using conflict hypergraphs. In CIKM 2004.
12. N. N. Dalvi and D. Suciu. Efficient query evaluation on probabilistic databases. In VLDB 2004.
13. S. Dar and R. Ramakrishnan. A performance study of transitive closure algorithms. In SIGMOD 1994.
14. P. DeRose, W. Shen, F. Chen, A. Doan, and R. Ramakrishnan. Building structured web community portals: A top-down, compositional, and incremental approach. In VLDB 2007.
15. S. Flesca, F. Furfaro, and F. Parisi. Consistent query answers on numerical databases under aggregate constraints. In DBPL 2005.
16. J. Gray, S. Chaudhuri, A. Bosworth, A. Layman, D. Reichart, M. Venkatrao, F. Pellow, and H. Pirahesh. Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals. DMKD, 1(1):29-53, 1997.
17. R. Gupta and S. Sarawagi. Creating probabilistic databases from information extraction models. In VLDB 2006.
18. M. Halldorsson. Approximations of weighted independent set and hereditary subset problems. Journal of Graph Algorithms and Applications, 4(1):1-16, 2000.
19. J. Y. Halpern. Reasoning about Uncertainty. MIT Press, Cambridge, MA, USA, 2003.
20. C. Huang and A. Darwiche. Inference in belief networks: A procedural guide. International Journal of Approximate Reasoning, 15(3):225-263, 1996.
21. C. A. Hurtado and A. O. Mendelzon. Olap dimension constraints. In PODS 2002.
22. T. Imielinski and W. L. Jr. Incomplete information in relational databases. J. ACM, 31(4):761-791, 1984.
23. T. S. Jayram, R. Krishnamurthy, S. Raghavan, S. Vaithyanathan, and H. Zhu. Avatar information extraction system. IEEE Data Eng. Bull., 29(1):40-48, 2006.
24. S. A. Kripke. Semantical considerations on modal logic. Acta Philosophica Fennica, 16:83-94, 1963.
25. J. Lechtenbörger, H. Shu, and G. Vossen. Aggregate Queries Over Conditional Tables. JIIS, 19(3):343-362, 2002.
26. H.-J. Lenz and A. Shoshani. Summarizability in olap and statistical data bases. In SSDBM 1997.
27. M. Rafanelli. Multidimensional Databases: Problems and Solutions. Idea Group Inc (IGI), 2003.
28. K. A. Ross, D. Srivastava, P. J. Stuckey, and S. Sudarshan. Foundations of aggregation constraints. In Principles and Practice of Constraint Programming 1994.
29. P. Sen and A. Deshpande. Representing and Querying Correlated Tuples in Probabilistic Databases. UM Computer Science Dept Tech Report CS-TR-4820. 2006.
30. M. Vardi. On the integrity of databases with incomplete information. In PODS 1986.
31. J. Vitter. External memory algorithms and data structures: dealing with massive data. ACM Computing Surveys, 33:209-271, 2001.
32. J. Widom. Trio: A system for integrated management of data, accuracy, and lineage. In CIDR 2005.
33. C. Zaniolo. Database relations with null values. J. Comput. Syst. Sci., 28(1):142-166, 1984.