EDBT 2026 Demo / reviewers in the wild / expert
Lu Liu 0017
dblp:31/2088-17
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2014
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 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.
| Computer graphics and multimedia
1 paper |
Visualization and visual analytics · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Storage systems · 62% High-performance computing · 38% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Visualization and visual analytics
flow visualization |
0.2 | 1 | 2014 | Advection-Based Sparse Data Management for Visualizing Unsteady Flow · IEEE Trans. Vis. Comput. Graph. 2014 |
Visualization and visual analytics › flow visualization
unsteady flow visualization |
0.2 | 1 | 2014 | Advection-Based Sparse Data Management for Visualizing Unsteady Flow · IEEE Trans. Vis. Comput. Graph. 2014 |
Storage systems
key-value storage |
0.2 | 1 | 2014 | Advection-Based Sparse Data Management for Visualizing Unsteady Flow · IEEE Trans. Vis. Comput. Graph. 2014 |
High-performance computing › data-intensive computing
large-scale data processing |
0.1 | 1 | 2014 | Advection-Based Sparse Data Management for Visualizing Unsteady Flow · IEEE Trans. Vis. Comput. Graph. 2014 |
High-performance computing
scientific computing systems |
0.1 | 1 | 2014 | Advection-Based Sparse Data Management for Visualizing Unsteady Flow · IEEE Trans. Vis. Comput. Graph. 2014 |
Methods — techniques the papers use, named apart from their topics
task-parallel particle advection · 0.4parallel key-value store · 0.4advection-based prefetching · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | Advection-Based Sparse Data Management for Visualizing Unsteady FlowabstractWhen computing integral curves and integral surfaces for large-scale unsteady flow fields, a major bottleneck is the widening gap between data access demands and the available bandwidth (both I/O and in-memory). In this work, we explore a novel advection-based scheme to manage flow field data for both efficiency and scalability. The key is to first partition flow field into blocklets (e.g. cells or very fine-grained blocks of cells), and then (pre)fetch and manage blocklets on-demand using a parallel key-value store. The benefits are (1) greatly increasing the scale of local-range analysis (e.g. source-destination queries, streak surface generation) that can fit within any given limit of hardware resources; (2) improving memory and I/O bandwidth-efficiencies as well as the scalability of naive task-parallel particle advection. We demonstrate our method using a prototype system that works on workstation and also in supercomputing environments. Results show significantly reduced I/O overhead compared to accessing raw flow data, and also high scalability on a supercomputer for a variety of applications. Hanqi Guo 0001, Jiang Zhang 0002, Richen Liu, Lu Liu 0017, Xiaoru Yuan, Jian Huang 0007, Xiangfei Meng, Jingshan Pan |
IEEE Trans. Vis. Comput. Graph. | 4 |