This document discusses using locality-sensitive hashing (LSH) to conduct real-time approximate nearest neighbor searches on unevenly spaced time series data. It describes using an L1 distance metric to compute distances between non-uniform time series, and using LSH with multiple pivots to index the historical data and enable fast queries. The data is stored in a nested key-value structure using Cassandra tables to allow reliable processing and retrieval of similar permutations for querying nearest neighbors.