Multi-dimensional data structure to efficiently search data items
Abstract:
The disclosed embodiments include a computer-implemented method that can include generating a sub-map for each of multiple data items, which each includes keys, key values, and a data item value, and where each sub-map maps keys to key values. The method can further include creating a composite key for each sub-map, where a particular composite key is a composite of key values of a particular data item. The method can further include generating, based on the sub-maps, a multi-dimensional data structure including a dimension for each key of the sub-maps where each dimension maps any key values of the dimension's key to any composite key that includes the key value, and where the multi-dimensional data structure is searchable instead of searching the plurality of data items.
Public/Granted literature
Information query
Patent Agency Ranking
0/0