Trie Encoding And Decoding For Compact Customer Journey Analytics
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing trie data structures face scalability issues and computational intensity when used for filtering and querying customer interactions in contact centers, leading to inefficient processing and high operational costs.
Innovation Solution
A scalable solution using a single 'big picture' trie data structure that integrates bot flows and event attributes, combined with efficient encoding and decoding techniques to reduce data transmission and processing overhead.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional trie data structures are used to store customer interaction flows, then the system can represent customer journey paths, but the data transmission size becomes large and processing efficiency decreases
Solution Approach 1:
The patent extracts only the essential information needed to represent customer journey paths by removing redundant data. Instead of transmitting complete trie structures with all node details, the system transmits only the necessary path information and flow count data, significantly reducing data transmission size while maintaining processing efficiency.
Solution Approach 2:
The patent segments the trie data structure into meaningful components: path information is separated from flow count data, and only essential path nodes are transmitted. This segmentation allows for more efficient data transmission and processing by focusing only on critical information rather than transmitting the entire data structure.
2Adaptability or versatility
If complete trie data structures are transmitted to enable filtering and querying, then query functionality is maintained, but computational intensity and operational costs increase
Solution Approach 1:
The patent performs preliminary encoding of the trie data structure into a compact format before transmission. By pre-processing and encoding only the essential path and flow count information, the system reduces computational intensity during subsequent filtering and querying operations while maintaining full query functionality.
Solution Approach 2:
The patent creates a simplified copy of the essential trie information rather than transmitting the complete data structure. This copy contains only the necessary path information and flow counts, enabling query functionality with significantly reduced computational requirements compared to operating on the full original structure.
3Reliability
If redundant data is included in API responses for completeness, then data integrity is maintained, but transmission efficiency decreases
Solution Approach 1:
The patent extracts and removes redundant data from API responses while maintaining data integrity through careful selection of essential information. By transmitting only the necessary path information and flow count data, the system achieves both transmission efficiency and data integrity, eliminating the need to send redundant information.
Solution Approach 2:
The patent changes the parameters of data representation by encoding trie structures in a compact format that maintains integrity with reduced redundancy. This parameter transformation allows the system to transmit minimal necessary information while preserving data integrity, thereby improving transmission efficiency.
Data Source
AI summary
A method for efficiently encoding a trie data structure for transmission according to an embodiment includes receiving an application programming interface (API) request pertaining to the trie data structure that is indicative of flows of customer interactions with automated agents of a contact center, obtaining the trie data structure in which each of multiple nodes has an associated prefix key that defines a path from a root to the corresponding node, and encoding the nodes in a transmission format having a dictionary data structure. The nodes in the transmission format do not have the prefix key that defines the path from the root to the corresponding node. The method also includes transmitting a response to the API request based on the trie data structure encoded in the transmission format.