Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Towards on-line analytical mining in large databases
ACM SIGMOD Record
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
CACTUS—clustering categorical data using summaries
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
i3: intelligent, interactive investigation of OLAP data cubes
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
A survey of logical models for OLAP databases
ACM SIGMOD Record
Discrete Mathematical Structures with Applications to Computer Science
Discrete Mathematical Structures with Applications to Computer Science
COOLCAT: an entropy-based algorithm for categorical clustering
Proceedings of the eleventh international conference on Information and knowledge management
Discovery-Driven Exploration of OLAP Data Cubes
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
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Total
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
A Foundation for Multi-dimensional Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
On the Complexity of the Generalized Block Distribution
IRREGULAR '96 Proceedings of the Third International Workshop on Parallel Algorithms for Irregularly Structured Problems
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
ROCK: A Robust Clustering Algorithm for Categorical Attributes
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
How to build a WebFountain: An architecture for very large-scale text analytics
IBM Systems Journal
The integration of business intelligence and knowledge management
IBM Systems Journal
Framework and algorithms for trend analysis in massive temporal data sets
Proceedings of the thirteenth ACM international conference on Information and knowledge management
Quotient cube: how to summarize the semantics of a data cube
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
The Data Warehouse Lifecycle Toolkit
The Data Warehouse Lifecycle Toolkit
Efficient implementation of large-scale multi-structural databases
VLDB '05 Proceedings of the 31st international conference on Very large data bases
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Hierarchical topic segmentation of websites
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
A method for online analytical processing of text data
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
WSDM '08 Proceedings of the 2008 International Conference on Web Search and Data Mining
Supporting OLAP operations over imperfectly integrated taxonomies
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Scenique: a multimodal image retrieval interface
AVI '08 Proceedings of the working conference on Advanced visual interfaces
Relaxation in text search using taxonomies
Proceedings of the VLDB Endowment
Galois connections, T-CUBES, and P2P data mining
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
Finding effectors in social networks
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Interesting-phrase mining for ad-hoc text analytics
Proceedings of the VLDB Endowment
Querying databases with taxonomies
ER'10 Proceedings of the 29th international conference on Conceptual modeling
A functional model for data analysis
FQAS'06 Proceedings of the 7th international conference on Flexible Query Answering Systems
SHIATSU: tagging and retrieving videos without worries
Multimedia Tools and Applications
| Hi-index | 0.00 |
We introduce the Multi-Structural Database, a new dataframework to support efficient analysis of large, complex datasets. An instance of the model consists of a set of data objects,together with a schema that specifies segmentations of the set ofdata objects according to multiple distinct criteria (e.g., into ataxonomy based on a hierarchical attribute). Within this model, wedevelop a rich set of analytical operations and design highlyefficient algorithms for these operations. Our operations areformulated as optimization problems, and allow the user to analyzethe underlying data in terms of the allowed segmentations.Our algorithms and results extend those of Fagin et al. [8] whostudied composition of mappings given by several kinds ofconstraints. In particular, they proved that full source-to-targettuple-generating dependencies (tgds) are closed under composition,but embedded source-to-target tgds are not. They introduced a classof second-order constraints, SO tgds, that isclosed under composition and has desirable properties for dataexchange.We study constraints that need not be source-to-target and weconcentrate on obtaining (first-order) embedded dependencies. Aspart of this study, we also consider full dependencies andsecond-order constraints that arise from Skolemizing embeddeddependencies. For each of the three classes of mappings that westudy, we provide (a) an algorithm that attempts to compute thecomposition and (b) sufficient conditions on the input mappingsthat guarantee that the algorithm will succeed.In addition, we give several negative results. In particular, weshow that full dependencies are not closed under composition, andthat second-order dependencies that are not limited to besource-to-target are not closed under restricted composition.Furthermore, we show that determining whether the composition canbe given by these kinds of dependencies is undecidable.