Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Vassilis Stamatopoulos

dblp:313/1792 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
4since 2021 · last 2026
0000-0002-9044-796XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 4 · 1 first-author · 4 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

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 · 50% Spatial and temporal data management · 50%
Computer graphics and multimedia
1 paper
Visualization and visual analytics · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Query processing and optimization
approximate query processing
0.812024
Visualization-aware Time Series Min-Max Caching with Error Bound Guarantees · Proc. VLDB Endow. 2024
Spatial and temporal data management › temporal query processing
time series query processing
0.812024
Visualization-aware Time Series Min-Max Caching with Error Bound Guarantees · Proc. VLDB Endow. 2024
Visualization and visual analytics
interactive data exploration
0.212024
Visualization-aware Time Series Min-Max Caching with Error Bound Guarantees · Proc. VLDB Endow. 2024

Methods — techniques the papers use, named apart from their topics

error bound guarantees · 1.5adaptive caching · 1.5
YearPublicationVenuePosition
2026 Interpretable Highlights for Experiment Tracking
Vassilis Stamatopoulos, Panagiotis Gidarakos, Stavros Maroulis, George Papastefanatos, Panos Vassiliadis
DOLAP1
2025 QueryER: A Framework for Fast Analysis-Aware Deduplication over Dirty Data
George Alexiou, George Papastefanatos, Vassilis Stamatopoulos, Georgia Koutrika, Nectarios Koziris
EDBT3
2024 Visualization-aware Time Series Min-Max Caching with Error Bound Guarantees
abstract
This paper addresses the challenges in interactive visual exploration of large multi-variate time series data. Traditional data reduction techniques may improve latency but can distort visualizations. State-of-the-art methods aimed at 100% accurate visualization often fail to maintain interactive response times or require excessive preprocessing and additional storage. We propose an in-memory adaptive caching approach, MinMaxCache, that efficiently reuses previous query results to accelerate visualization performance within accuracy constraints. MinMaxCache fetches data at adaptively determined aggregation granularities to maintain interactive response times and generate approximate visualizations with accuracy guarantees. Our results show that it is up to 10 times faster than current solutions without significant accuracy compromise.
Stavros Maroulis, Vassilis Stamatopoulos, George Papastefanatos, Manolis Terrovitis
Proc. VLDB Endow.2
2022 Machine Learning Platform for Extreme Scale Computing on Compressed IoT Data
abstract
With the lowering costs of sensors, high-volume and high-velocity data are increasingly being generated and analyzed, especially in IoT domains like energy and smart homes. Consequently, applications that require accurate short-term forecasts and predictions are also steadily increasing. In this paper, we provide an overview of a novel end-to-end platform that provides efficient ingestion, compression, transfer, query processing, and machine learning-based analytics for high-frequency and high-volume time series from IoT. The performance of the platform is evaluated using real-world dataset from RES installations. The results show the importance of high-frequency analytics and the surprisingly positive impact of error bounded lossy compression on machine learning in the form of AutoML. For example, when detecting yaw misalignments in wind turbines, an improvement of 9% in accuracy was observed for AutoML models on lossy compressed data compared to the current industry standard of 10-minute aggregated data. Thus, these small-scale experiments show the potential of the platform, and larger pilots are planned.
Seshu Tirupathi, Dhaval Salwala, Giulio Zizzo, Ambrish Rawat, Mark Purcell, Søren Kejser Jensen, Christian Thomsen 0001, Nguyen Ho, Carlos Muñiz Cuza, Jonas Brusokas, Torben Bach Pedersen, George Alexiou, Giorgos Giannopoulos, Panagiotis Gidarakos, Alexandros Kalimeris, Stavros Maroulis, George Papastefanatos, Ioannis Psarros, Vassilis Stamatopoulos, Manolis Terrovitis
IEEE Big Data19