Dong Xin
Authored Publications
Google Publications
Other Publications
Sort By
Graph cube: on warehousing and OLAP multidimensional networks
Peixiang Zhao
Xialolei Li
Jiawei Han
SIGMOD - Proceedings of the 2011 International Conference on Management of Data, ACM, New York, NY
Preview abstract
We consider extending decision support facilities toward large sophisticated networks, upon which multidimensional attributes are associated with network entities, thereby forming the so-called multidimensional networks. Data warehouses and OLAP (Online Analytical Processing) technology have proven to be effective tools for decision support on relational data. However, they are not well equipped to handle the new yet important multidimensional networks. In this paper, we introduce Graph Cube, a new data warehousing model that supports OLAP queries effectively on large multidimensional networks. By taking account of both attribute aggregation and structure summarization of the networks, Graph Cube goes beyond the traditional data cube
model involved solely with numeric value based group-by’s,
thus resulting in a more insightful and structure-enriched
aggregate network within every possible multidimensional
space. Besides traditional cuboid queries, a new class of
OLAP queries, crossboid, is introduced that is uniquely useful in multidimensional networks and has not been studied
before. We implement Graph Cube by combining special
characteristics of multidimensional networks with the existing well-studied data cube techniques. We perform extensive experimental studies on a series of real world data sets and Graph Cube is shown to be a powerful and efficient tool for decision support on large multidimensional networks.
View details
A framework for robust discovery of entity synonyms
Fast personalized PageRank on MapReduce
EntityTagger: automatically tagging entities with descriptive phrases
SEISA: set expansion by iterative similarity aggregation
Query portals: dynamically generating portals for entity-oriented web queries
Sanjay Agrawal
Kaushik Chakrabarti
Surajit Chaudhuri
Venkatesh Ganti
Arnd Christian König
SIGMOD Conference (2010), pp. 1171-1174
Keyword++: A Framework to Improve Keyword Search Over Entity Databases
Promotion Analysis in Multi-Dimensional Space
Exploiting web search to generate synonyms for entities
Top-down mining of frequent closed patterns from very high dimensional data
Hongyan Liu
Xiaoyu Wang
Jun He
Jiawei Han
Zheng Shao
Inf. Sci., vol. 179 (2009), pp. 899-924
Exploiting web search engines to search structured databases
Sanjay Agrawal
Kaushik Chakrabarti
Surajit Chaudhuri
Venkatesh Ganti
Arnd Christian König
WWW (2009), pp. 501-510
Detecting gene clusters under evolutionary constraint in a large number of genomes
Mining Document Collections to Facilitate Accurate Approximate Entity Matching
Efficiently Identifying Max-Gap Clusters in Pairwise Genome Comparison
ARCube: supporting ranking aggregate queries in partially materialized data cubes
An efficient filter for approximate membership checking
Kaushik Chakrabarti
Surajit Chaudhuri
Venkatesh Ganti
SIGMOD Conference (2008), pp. 805-818
P-Cube: Answering Preference Queries in Multi-Dimensional Space
Frequent pattern mining: current status and future directions
Computing Iceberg Cubes by Top-Down and Bottom-Up Integration: The StarCubing Approach
Jiawei Han
Xiaolei Li
Zheng Shao
Benjamin W. Wah
IEEE Trans. Knowl. Data Eng., vol. 19 (2007), pp. 111-126
Progressive and selective merge: computing top-k with ad-hoc ranking functions
Optimization of Bounds in Temporal Flexible Plans with Dynamic Controllability
Benjamin W. Wah
International Journal on Artificial Intelligence Tools, vol. 16 (2007), pp. 17-44
Semantic annotation of frequent patterns
On compressing frequent patterns
Integrating OLAP and Ranking: The Ranking-Cube Methodology
DataScope: Viewing Database Contents in Google Maps' Way
C-Cubing: Efficient Computation of Closed Cubes by Aggregation-Based Checking
Towards Robust Indexing for Ranked Queries
Ranking objects based on relationships
Top-Down Mining of Interesting Patterns from Very High Dimensional Data
Mining Interesting Patterns from Very High Dimensional Data: A Top-Down Row Enumeration Approach
Discovering interesting patterns through user's interactive feedback
Answering Top-k Queries with Multi-Dimensional Selections: The Ranking Cube Approach
Generating semantic annotations for frequent patterns with context analysis
Extracting redundancy-aware top-k patterns
Mining Compressed Frequent-Pattern Sets
Summarizing itemset patterns: a profile-based approach
Mining Evolving Customer-Product Relationships in Multi-Dimensional Space
Optimization of Bounds in Temporal Flexible Planning with Dynamic Controllability
MM-Cubing: Computing Iceberg Cubes by Factorizing the Lattice Space
Star-Cubing: Computing Iceberg Cubes by Top-Down and Bottom-Up Integration
Exploiting support vector machines in hidden Markov models for speaker verification
