cql - How Cassandra can provide optimized solution for a Overlapping range check -
I have a key in my input, low limit R1, an upper bound limit R1 and some data. Only after doing this data must be included that my input range R1 should not overlap any existing limit in the cassandra.
Therefore, before each converge I have a selected query
key | Lower arrears | Upper bound | Data ------ + ------------ + ------------ + ---------------- -------------------------------------------------- ------ 1024 | 1000 | 1100 | & Lt; Blob & gt; 1024 | 1500 | 1900 | & Lt; Blob & gt; 1024 | 2000. 2900 | & Lt; Blob & gt; 1024 | 3000 3900 | & Lt; Blob & gt; 1024 | 4000 4500 & Lt; Blob & gt; Given range 1, range R (S, E) = (1,999), this is a positive case therefore the system should contain data Case2: given range R (S, E) = (1001,1010) This is a The negative case is therefore the system should be left out
I have a solution with a range query and a programmatic check solution
Please let me know that the solution to this type of problem is in Kassandra, if so,
Not a better solution to your problem It is: This is the only way maybe light transactions in the future can also help in these situations, but now you have the only solution that is to read before writing. Another idea: Be sure to avoid double insertion in satisfactory condition (if it can be in your application).
Cheers, Carlo
Comments
Post a Comment