Efficient allocation algorithms for OLAP over imprecise data

VLDB 2006 - Proceedings of the 32nd International Conference on Very Large Data Bases

Volumn , Issue , 2006, Pages 391-402

  Burdick, Doug ^a   Deshpande, Prasad M ^c   Jayram, T S ^b   Ramakrishnan, Raghu ^d   Vaithyanathan, Shivakumar ^b  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

^c IBM RESEARCH INDIA   (India)

^d YAHOO RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

QUERY PROCESSING;

AGGREGATION QUERIES; ALLOCATION ALGORITHM; ALLOCATION POLICIES; DATA AMBIGUITIES; EFFICIENT ALLOCATIONS; EVALUATION APPROACH; FACT TABLES; IMPRECISE DATA; MULTIPLE ITERATIONS; UNCERTAINTY;

ITERATIVE METHODS;

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

References (16)

1. AGARWAI. S., AGRAWAL R., DESHPANDE, P., GUPTA A., NAUGHTON, J. F., RAMAKRISHNAN, R., AND SARAWAGI, S. On the computation of multidimensional aggregates. In VLDB (1996).
2. AGRAWAL, R. DAR. S., AND JAGADISH, H. V. Direct transitive closure algorithms: Design and performance evaluation. In ACM Transactions on Database Systems (1990), Vol. 15.
3. BOLLOBÁS, B. Random Graphs. Academic Press, London. 1985.
4. BRADLEY. P., FAYYAD, U., and REINA, C. Scaling KM (expectation maximization) clustering to large datahases. Tech. Rep. MSR-TK-98-35, Microsoft Research Report, August 1998.
5. BURDICK, D., DKSHPANDE, P. M., and JAYRAM., T. S., RAMAKRISHNAN. R., AND VAITHYANATHAN, S. Olap over uncertain and imprecise data. In VLDB (2005).
6. BURDICK, D., DESHPANDE, P. M. JAYRAM, T. S., RAMAKRISHNAN, R. and VAITHYANATHAN, S. Olap over uncertain and imprecise data. In Submitted to VLDB Journal (2006).
7. CHENG. R., and KALASHNIKOV., D. V., and PRABHAKAR, S. Evaluating Probabilistic Queries over Imprecise Data. In SICMOD Conference (2003), pp. 551-562.
8. CORMAN, T. H., LEIERSON, C. E. and RlVEST, T. L. Introduction to Algorithms. The MIT Press, 2001.
9. DALVI, N. N., AND SUNU D. Efficient Query Evaluation on Probabilistic Databases. In VLDB (2004), pp. 864-875.
10. DAR, S., and RAMAKRISHNAN, R. A performance study of transitive closure algorithms. In SIGMOD (1994), pp. 454-465.
11. DEMPSTER, A., LAIRD, N. and RUBIN, D. Maximum Likelihood from Incomplete Data via the EM Algorithm. Journal of the Royal Statistical Society (1977).
12. GUTTMAN. A. R-trees: adynamic index structure for spatial searching. In SIGMOD (1984). pp. 47-57.
13. HADJIELEFTHERIOU, M. Source code for r-tree implementation. R-tree source code: http://www.dblab.ece.ntua.gr/mario/rtree/rtree-source.zip.
14. HARINARAYAN, V. RAJARAMAN, A., and ULIMAN. J. D. Implementing data cubes efficiently. In SIGMOD (1996).
15. Ross, K. A., and SRIVASTAVA, D. Fast computation of sparse datacubes. In VUDB (1997).
16. WIDOM, J. Trio: A System for Integrated Management of Data. Accuracy, and Lineage. In CIDR (2005), pp. 262-276.