Using B+ Trees and consistent hashes, the authors of this work suggest a new approach to distributed real-time database indexing. First, in a distributed system, all storage nodes and TAG points are mapped to a circular hash space. This allows us to find exactly where each TAG point is stored. Second, construct a TAG point hash table that stores the index location for each TAG point in each storage node. Finally, a B+ Tree index is created to store and catalogue information on a single TAG point through time. The suggested strategy has been shown to be effective via both theoretical analysis and experimental findings.