Demo Data from EDBT 2026 / reviewers in the wild / expert
Weichen Ke
dblp:202/1923
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Databases, data management, data science and information retrieval · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Databases, data mining, and information retrieval
1 paper |
Query processing and optimization · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Query processing and optimization
aggregate query processing |
0.3 | 1 | 2018 | BigIN4: Instant, Interactive Insight Identification for Multi-Dimensional Big Data · KDD 2018 |
Query processing and optimization
approximate query processing |
0.3 | 1 | 2018 | BigIN4: Instant, Interactive Insight Identification for Multi-Dimensional Big Data · KDD 2018 |
Query processing and optimization › OLAP
data cube |
0.3 | 1 | 2018 | BigIN4: Instant, Interactive Insight Identification for Multi-Dimensional Big Data · KDD 2018 |
Query processing and optimization › aggregation
online aggregation |
0.3 | 1 | 2018 | BigIN4: Instant, Interactive Insight Identification for Multi-Dimensional Big Data · KDD 2018 |
Methods — techniques the papers use, named apart from their topics
data cube · 0.3bayesian network · 0.3approximate query processing · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2018 | BigIN4: Instant, Interactive Insight Identification for Multi-Dimensional Big DataabstractThe ability to identify insights from multi-dimensional big data is important for business intelligence. To enable interactive identification of insights, a large number of dimension combinations need to be searched and a series of aggregation queries need to be quickly answered. The existing approaches answer interactive queries on big data through data cubes or approximate query processing. However, these approaches can hardly satisfy the performance or accuracy requirements for ad-hoc queries demanded by interactive exploration. In this paper, we present BigIN4, a system for instant, interactive identification of insights from multi-dimensional big data. BigIN4 gives insight suggestions by enumerating subspaces and answers queries by combining data cube and approximate query processing techniques. If a query cannot be answered by the cubes, BigIN4 decomposes it into several low dimensional queries that can be directly answered by the cubes through an online constructed Bayesian Network and gives an approximate answer within a statistical interval. Unlike the related works, BigIN4 does not require any prior knowledge of queries and does not assume a certain data distribution. Our experiments on ten real-world large-scale datasets show that BigIN4 can successfully identify insights from big data. Furthermore, BigIN4 can provide approximate answers to aggregation queries effectively (with less than 10% error on average) and efficiently (50x faster than sampling-based methods). Qingwei Lin, Weichen Ke, Jian-Guang Lou, Hongyu Zhang 0002, Kaixin Sui, Yong Xu 0010, Bo Qiao 0001, Dongmei Zhang 0001 |
KDD | 2 |