Automatic subspace clustering of high dimensional data for data mining applications
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Simultaneous optimization and evaluation of multiple dimensional queries
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Covering rectilinear polygons with axis-parallel rectangles
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Convex Decomposition of Simple Polygons
ACM Transactions on Graphics (TOG)
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Logical Approach to Multidimensional Databases
EDBT '98 Proceedings of the 6th International Conference on Extending Database Technology: Advances in Database Technology
Modeling Multidimensional Databases
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Rewriting OLAP Queries Using Materialized Views and Dimension Hierarchies in Data Warehouses
Proceedings of the 17th International Conference on Data Engineering
A Foundation for Multi-dimensional Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Approximation Algorithms for Covering Polygons with Squares and Similar Problems
RANDOM '97 Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science
Querying Multidimensional Databases
DBLP-6 Proceedings of the 6th International Workshop on Database Programming Languages
Optimizing multiple dimensional queries simultaneously in multidimensional databases
The VLDB Journal — The International Journal on Very Large Data Bases
CHIRP: a new classifier based on composite hypercubes on iterated random projections
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Discovering context-topic rules in search engine logs
SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval
ACM Transactions on Knowledge Discovery from Data (TKDD) - Special Issue on the Best of SIGKDD 2011
| Hi-index | 0.00 |
We study the problem of economical representation of subsets of structured sets, which are sets equipped with a set cover or a family of preorders. Given a structured set U, and a language L whose expressions define subsets of U, the problem of minimum description length in L (L-MDL) is: “given a subset V of U, find a shortest string in L that defines V.” Depending on the structure and the language, the MDL-problem is in general intractable. We study the complexity of the MDL-problem for various structures and show that certain specializations are tractable. The families of focus are hierarchy, linear order, and their multidimensional extensions; these are found in the context of statistical and OLAP databases. In the case of general OLAP databases, data organization is a mixture of multidimensionality, hierarchy, and ordering, which can also be viewed naturally as a cover-structured ordered set. Efficient algorithms are provided for the MDL-problem for hierarchical and linearly ordered structures, and we prove that the multidimensional extensions are NP-complete. Finally, we illustrate the application of the theory to summarization of large result sets and (multi) query optimization for ROLAP queries.