Online capacity expansion method and device for distributed streaming computing application and computer equipment
A streaming computing and distributed technology, applied in special data processing applications, database design/maintenance, structured data retrieval, etc., can solve problems such as troublesome data migration and unavailable streaming applications
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
example 1
[0058]For a piece of data a that has just entered the distributed stream computing application, its partition key value is key1, and the timestamp corresponding to the partition key value key1 in the first data table of the entry node is time1, which is the first time of the data Stamped as time1. The size relationship obtained by comparing time1 with the timestamp in the second data table is: t0<time1<t1, it can be seen that the timestamp smaller than the first timestamp is only t0, so t0 is the second time of the data stamp, the node list of the second timestamp t0 is {node1, node2, node3}. The partition node inputs the partition key value of the piece of data into a hash function, and the obtained hash value corresponds to node2, so the piece of data is allocated to the node node2, and the node node2 performs related processing on the piece of data. Finally, update the local state on node node2.
example 2
[0060] For a piece of data b that has just entered the distributed streaming computing application, its partition key value is key3, and the timestamp corresponding to the partition key value key3 in the first data table of the entry node is time3, which is the first The timestamp is time3. The size relationship obtained by comparing Time3 with the timestamp in the second data table is: t0, t1t0, so t1 It is closer to time3 than t0, so t1 is the second timestamp of the piece of data, and the node list of the second timestamp t1 is {node4, node5, node6}. The partition node inputs the partition key value of the piece of data into a hash function, and the obtained hash value corresponds to node6, so the piece of data is allocated to node node6, and node node6 performs related processing on the piece of data. Finally, update the local state on node node6.
[0061] From the above example 1, it can be seen that the timestamp of the first appearance of the partition key value of da...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com