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

Haifa Gaza

dblp:335/8990 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
0000-0003-3489-6143ORCID · corroborated

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

Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 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
Graph data management · 76% Web and social media mining · 14% Data stream processing · 5%

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

TopicWeightPapersLastEvidence papers
Graph data management
temporal graph mining
0.912025
Kairos: Enabling Prompt Monitoring of Information Diffusion Over Temporal Networks (Extended Abstract) · ICDE 2025
Graph data management › graph algorithms
graph traversal
0.812024
Kairos: Enabling Prompt Monitoring of Information Diffusion Over Temporal Networks · IEEE Trans. Knowl. Data Eng. 2024
Graph data management › dynamic graph processing
incremental graph processing
0.812024
Kairos: Enabling Prompt Monitoring of Information Diffusion Over Temporal Networks · IEEE Trans. Knowl. Data Eng. 2024
Web and social media mining
information diffusion
0.812024
Kairos: Enabling Prompt Monitoring of Information Diffusion Over Temporal Networks · IEEE Trans. Knowl. Data Eng. 2024
Graph data management
temporal graph
0.812024
Kairos: Enabling Prompt Monitoring of Information Diffusion Over Temporal Networks · IEEE Trans. Knowl. Data Eng. 2024
Query processing and optimization
incremental computation
0.212024
Kairos: Enabling Prompt Monitoring of Information Diffusion Over Temporal Networks · IEEE Trans. Knowl. Data Eng. 2024

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

incremental algorithm · 0.9graph traversal · 0.9incremental traversal · 0.8
YearPublicationVenuePosition
2025 Kairos: Enabling Prompt Monitoring of Information Diffusion Over Temporal Networks (Extended Abstract)
abstract
Analyses of temporal graphs provide valuable insights into temporal data through the use of two analytical approaches: temporal evolution and temporal information diffusion. The former shows how a network evolves over time; the latter explains how information spreads throughout a network over time. Systems have been mainly proposed to efficiently handle graph snapshots, which are suitable for temporal evolution but inappropriate for temporal information diffusion. For analyses of temporal information diffusion, temporal graph traversal platforms have recently been proposed; however, it is still infeasible to handle infinitely evolving temporal data, especially for monitoring applications. In this paper, we propose an incremental approach and its graph processing engine, Kairos, to enable prompt monitoring of temporal information diffusion. This approach makes it possible to immediately process diffusion results for sources of interest by traversing a part of the whole network, which avoids full traversals influenced by a small change in the network, thus making monitoring applications feasible. The recipes for implementing incremental versions of existing temporal graph traversal algorithms and metrics will make it easier for users to build their ad-hoc programs.
Haifa Gaza, Jaewook Byun
ICDE1
2024 Kairos: Enabling Prompt Monitoring of Information Diffusion Over Temporal Networks
abstract
Analyses of temporal graphs provide valuable insights into temporal data through the use of two analytical approaches: temporal evolution and temporal information diffusion. The former shows how a network evolves over time; the latter explains how information spreads throughout a network over time. Systems have been mainly proposed to efficiently handle graph snapshots, which are suitable for temporal evolution but inappropriate for temporal information diffusion. For analyses of temporal information diffusion, temporal graph traversal platforms have recently been proposed; however, it is still infeasible to handle infinitely evolving temporal data, especially for monitoring applications. In this paper, we propose an incremental approach and its graph processing engine, Kairos, to enable prompt monitoring of temporal information diffusion. This approach makes it possible to immediately process diffusion results for sources of interest by traversing a part of the whole network, which avoids full traversals influenced by a small change in the network, thus making monitoring applications feasible. The recipes for implementing incremental versions of existing temporal graph traversal algorithms and metrics will make it easier for users to build their ad-hoc programs.
Haifa Gaza, Jaewook Byun
IEEE Trans. Knowl. Data Eng.1