Demo Data from EDBT 2026 / reviewers in the wild / expert
Weiqing Yang
dblp:23/8814
· DBLP profile ↗
4ranked-venue papers
1as first author
0since 2021 · last 2019
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 4 · 1 first-authorArtificial intelligence and machine learning · 2Applied, interdisciplinary, general and emerging computing · 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
2 papers |
Query processing and optimization · 45% Data integration and cleaning · 26% Distributed and cloud data management · 22% |
Topics — the 5 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data integration and cleaning
data provenance |
0.4 | 1 | 2019 | SAC: A System for Big Data Lineage Tracking · ICDE 2019 |
Distributed and cloud data management
distributed query processing |
0.3 | 1 | 2018 | SHC: Distributed Query Processing for Non-Relational Data Store · ICDE 2018 |
Query processing and optimization › query optimization › predicate optimization
predicate pushdown |
0.3 | 1 | 2018 | SHC: Distributed Query Processing for Non-Relational Data Store · ICDE 2018 |
Query processing and optimization
query optimization |
0.3 | 1 | 2018 | SHC: Distributed Query Processing for Non-Relational Data Store · ICDE 2018 |
Indexing and storage engines
key-value store |
0.1 | 1 | 2018 | SHC: Distributed Query Processing for Non-Relational Data Store · ICDE 2018 |
Methods — techniques the papers use, named apart from their topics
visual lineage representation · 0.4dependency tracking · 0.4predicate pushdown · 0.3partition pruning · 0.3column pruning · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | SAC: A System for Big Data Lineage TrackingabstractIn the era of big data, a data processing flow contains various types of tasks. It is nontrivial to discover the data flow/movement from its source to destination, such that monitoring different transformations and hops on its way in an enterprise environment. Therefore, data lineage or provenance is useful to learn how the data gets transformed along the way, how the representation and parameters change, and how the data splits or converges after each hop. However, existing systems offer limited support for such use cases in a distributed computing setup. To address this issue, we build Spark-Atlas-Connector (short as SAC), a new system to track data lineage in a distributed computation platform, e.g., Spark. SAC tracks different processes involved in the data flow and their dependencies, supporting different data storage (e.g., HBase, HDFS, and Hive) and data processing paradigms (e.g., SQL, ETL, machine learning, and streaming). SAC provides a visual representation of data lineage to track data from its origin to downstreams, and is deployed in a distributed production environment for demonstrating its efficiency and scalability. MingJie Tang, Saisai Shao, Weiqing Yang, Yanbo Liang, Yongyang Yu, Bikas Saha, Dongjoon Hyun |
ICDE | 3 |
| 2018 | Optimizing Generalized Linear Models with Billions of VariablesabstractThe use of large-scale machine learning~(ML) is becoming ubiquitous in various domains ranging from business intelligence to self-driving cars. Many companies are building ML pipelines in a unified data processing environment, and leveraging well-tuned numerical optimization packages for obtaining model parameters. However, most existing optimization tools are specifically designed for a single machine setup, and cannot handle vast volume of data. In this work, we build a distributed computing framework towards optimizing generalized linear models with billions of variables. We at first design a new distributed vector to represent data points from extremely large feature space. Then, we introduce an efficient and scalable approach to compute the second order derivatives of loss function, and optimizes model parameters with limited memory requirement. Experiments on real-world datasets demonstrate that our proposed techniques can scale up for ML models with billions of variables, and achieves better performance than state-of-the-art systems on a wide range of applications, e.g., ad CTR prediction and rideshare price bidding. Yanbo Liang, Yongyang Yu, MingJie Tang, Chaozhuo Li, Weiqing Yang, Ruifeng Zheng |
CIKM | 5 |
| 2018 | SHC: Distributed Query Processing for Non-Relational Data StoreabstractWe introduce a simple data model to process non-relational data for relational operations, and SHC (Apache Spark - Apache HBase Connector), an implementation of this model in the cluster computing framework, Spark. SHC leverages optimization techniques of relational data processing over the distributed and column-oriented key-value store (i.e., HBase). Compared to existing systems, SHC makes two major contributions. At first, SHC offers a much tighter integration between optimizations of relational data processing and non-relational data store, through a plug-in implementation that integrates with Spark SQL, a distributed in-memory computing engine for relational data. The design makes the system maintenance relatively easy, and enables users to perform complex data analytics on top of key-value store. Second, SHC leverages the Spark SQL Catalyst engine for high performance query optimizations and processing, e.g., data partitions pruning, columns pruning, predicates pushdown and data locality. SHC has been deployed and used in multiple production environments with hundreds of nodes, and provides OLAP query processing on petabytes of data efficiently. Weiqing Yang, MingJie Tang, Yongyang Yu, Yanbo Liang, Bikas Saha |
ICDE | 1 |
| 2015 | Early experience with optimizing I/O performance using high-performance SSDs for in-memory cluster computingabstractThis paper describes our experience with storage optimization that utilizes cost-effective PCIe solid-state drives (SSDs) to improve the overall performance of a Spark framework. A key problem we address is the limited memory system performance. In particular, we adopt high-performance SSDs to alleviate the saturated DRAM bandwidth and its limited capacity. We utilize SSDs to store shuffle data and persisted RDDs. As a result, the overall performance improves due to the larger capacity of SSDs and the increased bandwidth provided by SSDs while alleviating memory contentions. Our experiments show that we can improve the performance of data-intensive applications by 23.1% on average, compared to the performance of the memory-only approach. To our knowledge, this is the first work to demonstrate performance optimizations using PCIe SSDs on Spark. I. Stephen Choi, Weiqing Yang, Yang-Suk Kee |
IEEE BigData | 2 |