Concise descriptions of subsets of structured sets

ACM Transactions on Database Systems

Volumn 30, Issue 1, 2005, Pages 211-248

  Pu, Ken Q ^a   Mendelzon, Alberto O ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

Minimal description length; OLAP; Query optimization; Summarization

Indexed keywords

OLAP; QUERY OPTIMIZATION; SUMMARIZATION;

ALGORITHMS; DATABASE SYSTEMS; FORMAL LANGUAGES; HIERARCHICAL SYSTEMS; OPTIMIZATION; PROBLEM SOLVING;

SET THEORY;

EID: 23944444342     PISSN: 03625915     EISSN: None     Source Type: Journal    
DOI: 10.1145/1061318.1061324     Document Type: Article

References (22)

1. AGRAWAL, R., GEHRKE, J., GUNOPULOS, D., AND RAGHAVAN, P. 1998. Automatic subspace clustering of high dimensional data for data mining applications. In Proceedings of SIGMOD 1998. ACM Press, New York, NY, 94-105.
2. AGRAWAL, R., GUPTA, A., AND SARAWAGI, S. 1997. Modeling multidimensional databases. In Proceedings of ICDE 1997. 232-243.
3. BATCHELOR, B. 1980. Hierarchical shape description based on convex hulls of concavities. J. Cybernet. 10, 205-210.
4. CABIBBO, L. AND TORLONE, R. 1997. Querying multidimensional databases. In Proceedings of the 6th DBPL Workshop. 319-335.
5. CABIBBO, L. AND TORLONE, R. 1998. A logical approach to multidimensional databases. In Proceedings of EDBT 1998. 183-197.
6. EDMONDS, J., GRYZ, J., LIANG, D., AND MILLER, R. J. 2001. Mining for empty rectangles in large data sets. In Proceedings of ICDT 2001. 174-188.
7. GAREY, M. R. AND JOHNSON, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, NY.
8. GYSSENS, M. AND LAKSHMANAN, L. 1997. A foundation for multi-dimensional databases. In Proceedings of VLDB 1997. 106-115.
9. HANSEN, M. H. AND YU, B. 2001. Model selection and the principle of minimum description length. J. Amer. Statist. Assoc. 96, 454, 746-774.
10. HURTADO, C. AND MENDELZON, A. 2002. OLAP dimensional constraints. In Proceedings of PODS 2002. 169-179.
11. KALNIS, P. AND PAPADIAS, D. 2001. Optimization Algorithms for Simultaneous Multidimensional Queries in OLAP Environments. Lecture Notes in Computer Science, vol. 2114. Springer-Verlag, Berlin, Germany, 264-273.
12. KEIL, J. 1999. Polygon decomposition. In Handbook of Computational Geometry. Elsevier Sciences, Amsterdem, The Netherlands, Chap. 11, 491-518.
13. KIMBALL, R. 1996. The Data Warehouse Toolkit. Wiley, New York, NY.
14. KUMAR, V. S. A. AND RAMESH, H. 1999. Covering rectilinear polygons with axis-parallel rectangles. In Proceedings of the ACM Symposium on Theory of Computing 1999. ACM Press, New York, NY, 445-454.
15. LAKSHMANAN, L., NG, R. T., WANG, C. X., ZHOU, X., AND JOHNSON, T. J. 1999. The generalized MDL approach for summarization. In Proceedings of VLDB 1999. 445-454.
16. LAM, W. AND BACCHUS, F. 1994. Learning Bayesian belief networks: An approach based on the MDL principle. Comput. Intel. 10, 269-293.
17. LEVCOPOULOS, C. AND GUDMUNDSSON, J. 1997. Approximation algorithms for covering polygons with squares and similar problems. In Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science. Lecture Notes in Computer Science, vol. 1269. Springer, Berlin, Germany, 27-41.
18. LIANG, W. AND ORLOWSKA, M. 2000. Optimizing multiple dimensional queries simultaneously in multidimensional databases. VLDB J. 8, 319-338.
19. LODI, E., LUCCIO, F., MUGNAI, C., AND PAGLI, L. 1979. On two-dimensional data organization I. Fundam. Inform. 2, 211-226.
20. PARK, C., KIM, M., AND LEE, Y. 2001. Rewriting OLAP queries using materialized views and dimension hierarchies in data warehouses. In Proceedings of ICDE 2001. 515-523.
21. TOR, S. AND MIDDLEDITCH, A. 1984. Convex decomposition of simple polygons. ACM Trans. Graph. 3, 244-265.
22. ZHAO, Y., DESHPANDE, P., NAUGHTON, J., AND SHUKLA, A. 1998. Simultaneous optimization and evaluation of multiple dimensional queries. In Proceedings of SIGMOD 1998. 271-282.