Pith

open record

sign in

arxiv: 2504.07815 · v1 · pith:Y5OK7D44 · submitted 2025-04-10 · cs.IR

Siren Federate: Bridging document, relational, and graph models for exploratory graph analysis

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:Y5OK7D44record.jsonopen to challenge →

classification cs.IR
keywords graphanalysisexploratoryfederatequerysirenbridgingdecomposition
0
0 comments X
read the original abstract

Investigative workflows require interactive exploratory analysis on large heterogeneous knowledge graphs. Current databases show limitations in enabling such task. This paper discusses the architecture of Siren Federate, a system that efficiently supports exploratory graph analysis by bridging document-oriented, relational and graph models. Technical contributions include distributed join algorithms, adaptive query planning, query plan folding, semantic caching, and semi-join decomposition for path query. Semi-join decomposition addresses the exponential growth of intermediate results in path-based queries. Experiments show that Siren Federate exhibits low latency and scales well with the amount of data, the number of users, and the number of computing nodes.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.