Demo Data from VLDB 2026 / reviewers in the wild / expert
Gregory L. Eyink
dblp:120/7483
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2012
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 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 architecture, parallel and distributed computing, and storage systems
1 paper |
High-performance computing · 75% Hardware accelerators and domain-specific architectures · 25% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computational science and engineering · 100% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
High-performance computing
parallel i/o |
0.1 | 1 | 2012 | Data-intensive spatial filtering in large numerical simulation datasets · SC 2012 |
Hardware accelerators and domain-specific architectures
query processing |
0.1 | 1 | 2012 | Data-intensive spatial filtering in large numerical simulation datasets · SC 2012 |
High-performance computing
scientific data management |
0.1 | 1 | 2012 | Data-intensive spatial filtering in large numerical simulation datasets · SC 2012 |
High-performance computing
streaming i/o |
0.1 | 1 | 2012 | Data-intensive spatial filtering in large numerical simulation datasets · SC 2012 |
Methods — techniques the papers use, named apart from their topics
summed volumes · 0.3decomposable kernel evaluation · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2012 | Data-intensive spatial filtering in large numerical simulation datasetsabstractWe present a query processing framework for the efficient evaluation of spatial filters on large numerical simulation datasets stored in a data-intensive cluster. Previously, filtering of large numerical simulations stored in scientific databases has been impractical owing to the immense data requirements. Rather, filtering is done during simulation or by loading snapshots into the aggregate memory of an HPC cluster. Our system performs filtering within the database and supports large filter widths. We present two complementary methods of execution: I/O streaming computes a batch filter query in a single sequential pass using incremental evaluation of decomposable kernels, summed volumes generates an intermediate data set and evaluates each filtered value by accessing only eight points in this dataset. We dynamically choose between these methods depending upon workload characteristics. The system allows us to perform filters against large data sets with little overhead: query performance scales with the cluster's aggregate I/O throughput. Kalin Kanov, Randal C. Burns, Gregory L. Eyink, Charles Meneveau, Alex Szalay |
SC | 3 |