Vasiliki Kalavri

Vasiliki Kalavri

Auto-generated profile, based on publicly available information

Vasiliki Kalavri

Boston University, Boston, USA

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 November 2023 in The VLDB Journal
Verified
Journal Article
Open access
PDF file
MFMarios Fragkoulis
Marios Fragkoulis
PCParis Carbone
Paris Carbone
VKVasiliki Kalavri
Vasiliki Kalavri
AKAsterios Katsifodimos
Asterios Katsifodimos
Stream processing has been an active research field for more than 20 years, but it is now witnessing its prime time due to recent successful efforts by the research community and numerous worldwide open-source communities. This survey provides a comprehensive overview of fundamental aspects of stream processing systems and their evolution in the functional areas of out-of-order data management, state management, fault tolerance, high availability, load management, elasticity, and reconfiguration. We review noteworthy past research findings, outline the similarities and differences between the first (’00–’10) and second (’11–’23) generation of stream processing systems, and discuss future trends and open problems.

12 October 2017 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
VKVasiliki Kalavri
Vasiliki Kalavri
VVVladimir Vlassov
Vladimir Vlassov
SHSeif Haridi
Seif Haridi
Efficient processing of large-scale graphs in distributed environments has been an increasingly popular topic of research in recent years. Inter-connected data that can be modeled as graphs arise in application domains such as machine learning, recommendation, web search, and social network analysis. Writing distributed graph applications is inherently hard and requires programming models that can cover a diverse set of problem domains, including iterative refinement algorithms, graph transformations, graph aggregations, pattern matching, ego-network analysis, and graph traversals. Several high-level programming abstractions have been proposed and adopted by distributed graph processing systems and big data platforms. Even though significant work has been done to experimentally compare distributed graph processing frameworks, no qualitative study and comparison of graph programming abstractions has been conducted yet. In this survey, we review and analyze the most prevalent high-level programming models for distributed graph processing, in terms of their semantics and applicability. We review 34 distributed graph processing systems with respect to the graph processing models they implement and we survey applications that appear in recent distributed graph systems papers. Finally, we discuss trends and open research questions in the area of distributed graph processing.

30 November 2021 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
MBMaciej Besta
Maciej Besta
MFMarc Fischer
Marc Fischer
VKVasiliki Kalavri
Vasiliki Kalavri
MKMichael Kapralov
Michael Kapralov
THTorsten Hoefler
Torsten Hoefler
Graph processing has become an important part of various areas of computing, including machine learning, medical applications, social network analysis, computational sciences, and others. A growing amount of the associated graph processing workloads are dynamic, with millions of edges added or removed per second. Graph streaming frameworks are specifically crafted to enable the processing of such highly dynamic workloads. Recent years have seen the development of many such frameworks. However, they differ in their general architectures (with key details such as the support for the concurrent execution of graph updates and queries, or the incorporated graph data organization), the types of updates and workloads allowed, and many others. To facilitate the understanding of this growing field, we provide the first analysis and taxonomy of dynamic and streaming graph processing. We focus on identifying the fundamental system designs and on understanding their support for concurrency, and for different graph updates as well as analytics workloads. We also crystallize the meaning of different concepts associated with streaming graph processing, such as dynamic, temporal, online, and time-evolving graphs, edge-centric processing, models for the maintenance of updates, and graph databases. Moreover, we provide a bridge with the very rich landscape of graph streaming theory by giving a broad overview of recent theoretical related advances, and by discussing which graph streaming models and settings could be helpful in developing more powerful streaming frameworks and designs. We also outline graph streaming workloads and research challenges.

30 March 2025
Verified
Conference Paper
Open access
YWYuanli Wang
Yuanli Wang
LHLei Huang
Lei Huang
ZWZikun Wang
Zikun Wang
VKVasiliki Kalavri
Vasiliki Kalavri
IMIbrahim Matta
Ibrahim Matta

12 October 2025
Verified
Conference Paper
Open access
EBEli Baum
Eli Baum
SBSam Buxbaum
Sam Buxbaum
NMNitin Mathai
Nitin Mathai
MFMuhammad Faisal
Muhammad Faisal
VKVasiliki Kalavri
Vasiliki Kalavri
JLJohn Liagouris
John Liagouris

9 June 2024
Verified
Conference Paper
Open access
YSYuhang Song
Yuhang Song
PCPo Hao Chen
Po Hao Chen
YLYuchen Lu
Yuchen Lu
NANaima Abrar
Naima Abrar
VKVasiliki Kalavri
Vasiliki Kalavri
Graph Neural Network (GNN) training algorithms commonly perform neighborhood sampling to construct fixed-size mini-batches for weight aggregation on GPUs. State-of-the-art disk-based GNN frameworks compute sampling on the CPU, transferring edge partitions from disk to memory for every mini-batch. We argue that this design incurs significant waste of PCIe bandwidth, as entire neighborhoods are transferred to main memory only to be discarded after sampling. In this paper, we make the first step towards an inherently different approach that harnesses near-storage compute technology to achieve efficient large-scale GNN training. We target a single machine with one or more SmartSSD devices and develop a high-throughput, epoch-wide sampling FPGA kernel that enables pipelining across epochs. When compared to a baseline random-access sampling kernel, our solution achieves up to 4.26× lower sampling time per epoch.