While a significant number of databases are deployed in cloud environments, pushing part or all data storage and querying planes closer to their sources (i.e., to the edge) can provide advantages in latency, connectivity, privacy, energy, and scalability. This article dissects the advantages provided by databases in edge and fog environments by surveying application domains and discussing the key drivers for pushing database systems to the edge. At the same time, it also identifies the main challenges faced by developers in this new environment and analyzes the mechanisms employed to deal with them. By providing an overview of the current state of edge and fog databases, this survey provides valuable insights into future research directions.
The increasing demand for real-time analytics requires the fusion of Transactional (OLTP) and Analytical (OLAP) systems, eschewing ETL processes and introducing a plethora of proposals for the so-called Hybrid Analytical and Transactional Processing (HTAP) systems. Unfortunately, current benchmarking approaches are not able to comprehensively produce a unified metric from the assessment of an HTAP system. The evaluation of both engine types is done separately, leading to the use of disjoint sets of benchmarks such as TPC-C or TPC-H. In this paper we propose a new benchmark, HTAPBench, providing a unified metric for HTAP systems geared toward the execution of constantly increasing OLAP requests limited by an admissible impact on OLTP performance. To achieve this, a load balancer within HTAPBench regulates the coexistence of OLTP and OLAP workloads, proposing a method for the generation of both new data and requests, so that OLAP requests over freshly modified data are comparable across runs. We demonstrate the merit of our approach by validating it with different types of systems: OLTP, OLAP and HTAP; showing that the benchmark is able to highlight the differences between them, while producing queries with comparable complexity across experiments with negligible variability.
The ability to access and query data stored in multiple versions is an important asset for many applications, such as Web graph analysis, collaborative editing platforms, data forensics, or correlation mining. The storage and retrieval of versioned data requires a specific API and support from the storage layer. The choice of the data structures used to maintain versioned data has a fundamental impact on the performance of insertions and queries. The appropriate data structure also depends on the nature of the versioned data and the nature of the access patterns. In this paper we study the design and implementation space for providing versioning support on top of a distributed key-value store (KVS). We define an API for versioned data access supporting multiple writers and show that a plain KVS does not offer the necessary synchronization power for implementing this API. We leverage the support for listeners at the KVS level and propose a general construction for implementing arbitrary types of data structures for storing and querying versioned data. We explore the design space of versioned data storage ranging from a flat data structure to a distributed sharded index. The resulting system, ALEPH, is implemented on top of an industrial-grade open-source KVS, Infinispan. Our evaluation, based on real-world Wikipedia access logs, studies the performance of each versioning mechanisms in terms of load balancing, latency and storage overhead in the context of different access scenarios.
30 May 2025 in Current Sustainable/Renewable Energy Reports
Purpose of Review: This paper reviews the flexibility-centric value chain (FCVC) and analyses how coordinating digital platforms along the FCVC is essential for enabling FCVC activities and supporting key actors. Based on the FCVC, the digital infrastructure needed to support flexibility provision in power systems is reviewed, with special focus on the role of energy communities (ECs) as emerging relevant actors and potential aggregators of its members. Recent Findings: We review the Grid Data and Business Network (GDBN), a platform developed by the authors to support the FCVC, with special focus on those stages of the FCVC not properly supported by existing solutions. It also analyses platforms used in local flexibility markets (LFMs), and it presents the RECreation digital platform designed to manage ECs to support the participation in flexibility markets. Summary: Digital platforms are necessary for scaling flexibility services. The GDBN offers a comprehensive approach by enabling the FCVC and facilitating interoperability with existing platforms dedicated to specific segments, such as ECs and LFMs. By addressing current limitations in platform integration, this paper contributes to a clearer understanding of how digital tools can enable an efficient flexibility ecosystem.
The evolution of the electrical power sector due to the advances in digitalization, decarbonization and decentralization has led to the increase in challenges within the current distribution network. Therefore, there is an increased need to analyze the impact of the smart grid and its implemented solutions in order to address these challenges at the earliest stage, i.e., during the pilot phase and before large-scale deployment and mass adoption. Therefore, this paper presents the scalability and replicability analysis conducted within the European project InteGrid. Within the project, innovative solutions are proposed and tested in real demonstration sites (Portugal, Slovenia, and Sweden) to enable the DSO as a market facilitator and to assess the impact of the scalability and replicability of these solutions when integrated into the network. The analysis presents a total of three clusters where the impact of several integrated smart tools is analyzed alongside future large scale scenarios. These large scale scenarios envision significant penetration of distributed energy resources, increased network dimensions, large pools of flexibility, and prosumers. The replicability is analyzed through different types of networks, locations (country-wise), or time (daily). In addition, a simple replication path based on a step by step approach is proposed as a guideline to replicate the smart functions associated with each of the clusters.
Window functions are a sub-class of analytical operators that allow data to be handled in a derived view of a given relation, while taking into account their neighboring tuples. Currently, systems bypass parallelization opportunities which become especially relevant when considering Big Data as data is naturally partitioned. We present a shuffling technique to improve the parallel execution of window functions when data is naturally partitioned when the query holds a partitioning clause that does not match the natural partitioning of the relation. We evaluated this technique with a non-cumulative ranking function and we were able to reduce data transfer among parallel workers in 85 % when compared to a naive approach.