Cognitive Memory Graph Indexing, Storage and Retrieval Techniques

摘要

The present disclosure provides a fast approximate and accurate hierarchical network storage and retrieval system and method for encoding and indexing graphs or networks and identifying substructure matches or similarities within graph data. A generalized combinatorial map and a new quantum intuitive Q-hashing to summarize the local structure of the graph according to reduction and graph property calculations to build index data structures called attribute signatures, called identity signatures, for attribute-based, similarity- The algorithm is used to encode the graph. The system and method of the present invention is suitable for storing and indexing all or part of a graph or sub-structure or analog, as well as a traffic graph or a dynamically changing graph such as a sequence of moving and moving images. The system and method have the advantage that the attributes of the cognitive signature of the graph can be used for associating with the attributes of the underlying data, and this advantage makes the system ideal for semantic indexing of large capacity graph data sets.