Demo Data from EDBT 2026 / reviewers in the wild / expert
Paul Luh
dblp:224/6356
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 2
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 |
Data models and query languages · 77% Information retrieval · 23% | |
| Computer graphics and multimedia
2 papers |
Visualization and visual analytics · 100% |
Topics — the 3 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data models and query languages
query language |
0.4 | 1 | 2020 | ShapeSearch: A Flexible and Efficient System for Shape-based Exploration of Trendlines · SIGMOD Conference 2020 |
Visualization and visual analytics › interactive data exploration
visual exploration |
0.3 | 1 | 2018 | ShapeSearch: Flexible Pattern-based Querying of Trend Line Visualizations · Proc. VLDB Endow. 2018 |
Information retrieval
pattern search |
0.1 | 1 | 2020 | ShapeSearch: A Flexible and Efficient System for Shape-based Exploration of Trendlines · SIGMOD Conference 2020 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | ShapeSearch: A Flexible and Efficient System for Shape-based Exploration of TrendlinesabstractIdentifying trendline visualizations with desired patterns is a common task during data exploration. Existing visual analytics tools offer limited flexibility, expressiveness, and scalability for such tasks, especially when the pattern of interest is under-specified and approximate. We propose ShapeSearch, an efficient and flexible pattern-searching tool, that enables the search for desired patterns via multiple mechanisms: sketch, natural-language, and visual regular expressions. We develop a novel shape querying algebra, with a minimal set of primitives and operators that can express a wide variety of shape search queries, and design a natural- language and regex-based parser to translate user queries to the algebraic representation. To execute these queries within interactive response times, ShapeSearch uses a fast shape algebra execution engine with query-aware optimizations, and perceptually-aware scoring methodologies. We present a thorough evaluation of the system, including a user study, a case study involving genomics data analysis, as well as performance experiments, comparing against state-of-the-art trendline shape matching approaches-that together demonstrate the usability and scalability of ShapeSearch. Tarique Siddiqui, Paul Luh, Zesheng Wang 0001, Karrie Karahalios, Aditya G. Parameswaran |
SIGMOD Conference | 2 |
| 2018 | ShapeSearch: Flexible Pattern-based Querying of Trend Line VisualizationsabstractFinding visualizations with desired patterns is a common goal during data exploration. However, due to the limited expressiveness and flexibility of existing visual analytics systems, pattern-based querying of visualizations has largely been a manual process. We demonstrate ShapeSearch, a system that enables users to express their desired patterns in trend lines using multiple flexible mechanisms --- including natural language and visual regular expressions, and automates the search via an optimized execution engine. Internally, the system leverages an expressive shape query algebra that supports a range of operators and primitives for representing ShapeSearch queries. In our demonstration, conference attendees will learn how the various components of ShapeSearch help accelerate scientific discovery by automating the search for meaningful patterns in trend lines in domains such as genomics and material science. Tarique Siddiqui, Paul Luh, Zesheng Wang 0001, Karrie Karahalios, Aditya G. Parameswaran |
Proc. VLDB Endow. | 2 |