Splunk Search

SPL: Longest common substring

jroedel
Path Finder

Hello everyone,

I am looking for a SPL-solution to determine how long the longest common substring of two strings is.

Is there any built-in way to do that? Or is there any app that provides me with some command for that?

 

Thanks in Advance!

Labels (1)
Tags (2)
0 Karma

PickleRick
SplunkTrust
SplunkTrust

No, there is no built-in command to find that.

You could try to implement it in SPL and that could be an interesting exercise in itself but it would most probably _not_ be a very effective solution.

If you really need that you should probably implement it as an external command using python.

0 Karma

psherman42
Engager

You probably need to use external scripting such as python to solve your algo processing needs as it falls outside simple text pattern matching. By design Splunk itself is more designed for data retrieval, aggregation and general text operations which I would consider the typical use case of Splunk. 



Tags (1)
0 Karma

richgalloway
SplunkTrust
SplunkTrust

I think you'll need an external command to do that.

---
If this reply helps you, Karma would be appreciated.
Got questions? Get answers!

Join the Splunk Community Slack to learn, troubleshoot, and make connections with fellow Splunk practitioners in real time!

Meet up IRL or virtually!

Join Splunk User Groups to connect and learn in-person by region or remotely by topic or industry.

Get Updates on the Splunk Community!

Laser Bananas and Edge Hubs: Exploring Operational Technology (OT) Data Through a ...

  OT is a different environment to traditional IT and can have interesting challenges when interfacing the ...

Event Series: Mastering AI Tokenomics and Splunk Agent Observability

Beyond the Black Box: Correlating AI Performance and Tokenomics with Splunk Agent Observability   As ...

span_metrics: The OpenTelemetry-Idiomatic Way to See Inside Your Services

You open a trace in Splunk Observability Cloud and everything looks fine. One root span, order-pipeline, with ...