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

Aristodemos Paphitis

dblp:121/8107 · DBLP profile ↗
← Back
8ranked-venue papers
1as first author
3since 2021 · last 2023
—ORCID · none

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

Computer networks · 3Databases, data management, data science and information retrieval · 2 · 2 since 2021Security and privacy · 1 · 1 first-author · 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
2 papers
Distributed and cloud data management · 50% Transaction processing and concurrency control · 50%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Distributed systems · 54% Cloud and datacenter computing · 46%

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

TopicWeightPapersLastEvidence papers
Distributed and cloud data management
data replication
1.122022
Hihooi: A Database Replication Middleware for Scaling Transactional Databases Consistently · IEEE Trans. Knowl. Data Eng. 2022
Attaining Workload Scalability and Strong Consistency for Replicated Databases with Hihooi · SIGMOD Conference 2021
Transaction processing and concurrency control › consistency
strong consistency
1.122022
Hihooi: A Database Replication Middleware for Scaling Transactional Databases Consistently · IEEE Trans. Knowl. Data Eng. 2022
Attaining Workload Scalability and Strong Consistency for Replicated Databases with Hihooi · SIGMOD Conference 2021
Distributed and cloud data management › data replication
replica consistency
0.512021
Attaining Workload Scalability and Strong Consistency for Replicated Databases with Hihooi · SIGMOD Conference 2021
Transaction processing and concurrency control › distributed transaction processing
transaction routing
0.512021
Attaining Workload Scalability and Strong Consistency for Replicated Databases with Hihooi · SIGMOD Conference 2021
Distributed systems
replication
0.212022
Hihooi: A Database Replication Middleware for Scaling Transactional Databases Consistently · IEEE Trans. Knowl. Data Eng. 2022

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

fine-grained routing · 1.1asynchronous replication · 1.1
YearPublicationVenuePosition
2023 Resilience of Blockchain Overlay Networks
Aristodemos Paphitis, Nicolas Kourtellis, Michael Sirivianos
NSS1
2022 Hihooi: A Database Replication Middleware for Scaling Transactional Databases Consistently
abstract
With the advent of the Internet and Internet-connected devices, modern business applications can experience rapid increases as well as variability in transactional workloads. Database replication has been employed to scale performance and improve availability of relational databases but past approaches have suffered from various issues including limited scalability, performance versus consistency tradeoffs, and requirements for database or application modifications. This paper presents Hihooi, a replication-based middleware system that is able to achieve workload scalability, strong consistency guarantees, and elasticity for existing transactional databases at a low cost. A novel replication algorithm enables Hihooi to propagate database modifications asynchronously to all replicas at high speeds, while ensuring that all replicas are consistent. At the same time, a fine-grained routing algorithm is used to load balance incoming transactions to available replicas in a consistent way. Our thorough experimental evaluation with several well-established benchmarks shows how Hihooi is able to achieve almost linear workload scalability for transactional databases.
Michael A. Georgiou, Aristodemos Paphitis, Michael Sirivianos, Herodotos Herodotou
IEEE Trans. Knowl. Data Eng.2
2021 Attaining Workload Scalability and Strong Consistency for Replicated Databases with Hihooi
abstract
Database replication can be employed for scaling transactional workloads while maintaining strong consistency semantics. However, past approaches suffer from various issues such as limited scalability, performance versus consistency tradeoffs, and requirements for database or application modifications. Hihooi is a new replication-based master-slave middleware system that is able to overcome the aforementioned limitations. The novelty of Hihooi lies in its modern architecture as well as its replication and transaction routing algorithms. In particular, Hihooi replicates all write statements asynchronously and applies them in parallel at the replica nodes, while ensuring replica consistency. At the same time, a fine-grained transaction routing algorithm ensures that all read transactions are load balanced to the replicas consistently. This demonstration will showcase the key functionalities of Hihooi, including (i) practical management of system components and databases (e.g., add a new replica node), (ii) increased scalability compared to state-of-the-art approaches, and (iii) support for elasticity by suspending and resuming database replicas online without service interruption.
Michael A. Georgiou, Michael Panayiotou, Lambros Odysseos, Aristodemos Paphitis, Michael Sirivianos, Herodotos Herodotou
SIGMOD Conference4
2018 Demo: Physical and Network Layer Interconnection Module for Realistic Planning of IoT Sensor Networks
Akis Kokkinis, Aristodemos Paphitis, Loizos Kanaris, Charalambos Sergiou, Stavros Stavrou
EWSN2
2017 Competition: Dynamic Alternative Path Selection in Wireless Sensor Networks
Charalambos Sergiou, Vasos Vassiliou, Chryssis Georgiou, Christiana Ioannou, Natalie Temene, Aristodemos Paphitis
EWSN6
2015 Estimating queue formation rate in Wireless Sensor Networks using a fluid dynamic model
abstract
Estimating the rate, with which the buffers of the nodes in a Wireless Sensor Network (WSN) fill-up, can contribute to the efficient operation of congestion control algorithms. In this paper we attempt, using a macroscopic fluid dynamic model, to estimate the rate with which the buffers of nodes fill-up, when congestion occurs in the network. This estimation can become a useful tool for the development of particular mechanisms, for congestion or overload control algorithms, that can improve their performance.
Charalambos Sergiou, Vasos Vassiliou, Aristodemos Paphitis
ISCC3
2014 Congestion control in Wireless Sensor Networks through dynamic alternative path selection
Charalambos Sergiou, Vasos Vassiliou, Aristodemos Paphitis
Comput. Networks3
2013 Hierarchical Tree Alternative Path (HTAP) algorithm for congestion control in wireless sensor networks
Charalambos Sergiou, Vasos Vassiliou, Aristodemos Paphitis
Ad Hoc Networks3