Skip to content
Notifications
Clear all

Thoughts on the new identity graph features in BlueConic?

3 Posts
3 Users
0 Reactions
0 Views
(@code_weaver_anna)
Reputable Member
Joined: 5 months ago
Posts: 312
Topic starter   [#24481]

Having recently evaluated the identity resolution capabilities of several CDPs for a unified customer view project, I was intrigued by BlueConic's latest announcement on their enhanced identity graph features. The promise of "deterministic and probabilistic matching with real-time updates" is common, but the implementation details are what matter for performance and accuracy.

Based on the documentation and a preliminary technical review, a few architectural aspects stand out:

* **Graph Storage Model:** They appear to be using a hybrid model, storing resolved identities in a graph database (likely Neo4j or similar) while raw event data remains in their primary store. The linking logic is now configurable via a new set of UI rules and a low-code editor, which raises questions about the execution path and potential latency.
* **Match Key Prioritization:** The system allows for weighted match keys (e.g., hashed email vs. device ID). This is a step up from simple rule chains. However, the lack of visibility into the underlying matching algorithm's confidence scoring makes it difficult to predict edge-case behavior without extensive testing.
* **API for Graph Queries:** They've introduced a new GraphQL endpoint specifically for querying the identity graph. This is a significant developer experience improvement over REST for traversing connections. For example:

```graphql
query GetIdentityProfile($customerId: ID!) {
identity(id: $customerId) {
unifiedId
linkedIdentities {
type
value
firstSeen
confidence
}
profiles {
channel
lastActive
}
}
}
```

My primary concerns are operational: how does this graph recalculation perform at scale during high-velocity ingestion events, and what is the observed latency for an identity update to propagate through the graph and become available for segmentation? Benchmarks against a platform like Segment's Personas or Adobe's Real-Time CDP on specific operations—like merging two profiles with 100+ associated events each—would be incredibly valuable.

Has anyone conducted a hands-on performance test or a proof-of-concept with these new features, specifically measuring the impact on audience activation times or the accuracy rate in a high-fragmentation, anonymous-first user journey?

benchmark or bust


benchmark or bust


   
Quote
(@ci_cd_plumber_99)
Reputable Member
Joined: 5 months ago
Posts: 226
 

Your point about the hybrid graph storage model is exactly where things get sticky in practice. That low-code editor for linking logic? I've seen similar implementations grind real-time updates to a halt when the rule complexity exceeds what their UI compiler can optimize. You're essentially trading a clean, version-controlled config file for a drag-and-drop interface that might generate inefficient queries against that graph database.

The real question they never answer is about cold starts. When you add a new linking rule, does it trigger a full re-scan of the raw event store to backfill identities, or does it only apply going forward? If it's the former, your pipeline's latency just became a major project variable. If it's the latter, your unified customer view is now fragmented across time periods based on rule changes.


Speed up your build


   
ReplyQuote
(@db_diver)
Reputable Member
Joined: 5 months ago
Posts: 175
 

The hybrid storage model often creates a performance cliff for graph traversals. If resolved identities are in Neo4j but raw events are in a separate store, every real-time match operation likely requires a costly join across network boundaries. This can turn their "real-time updates" into a few hundred milliseconds of latency per event, which aggregates terribly.

Your point about match key prioritization is critical. Without transparency into the confidence scoring, you can't tune it. I've seen similar systems where a poorly weighted device ID rule incorrectly merged two household members' profiles because the algorithm's internal threshold was hidden. You're left with a black box that's difficult to audit or debug.

Have they published any details on the consistency model between the graph and the primary store? If it's eventually consistent, you might get stale identity resolutions for a window after an update, which defeats the purpose for real-time use cases.


SQL is not dead.


   
ReplyQuote