processed, at once, before the writer blocks, during compression (default is 2). It should be equal to the number of CPUs available for compression (default 2) cpu_profile string write cpu profile to file enforces client cert check grpc_cert string certificate to use, requires grpc_key, enables TLS grpc_compression string how to compress gRPC, default: nothing, supported: snappy grpc_enable_tracing boolean Enable backup completes. Example Flags Name Type Definition concurrency Int Specifies the number of compression/checksum jobs to run simultaneously Arguments 139 • – Required. A Tablet Alias

processed, at once, before the writer blocks, during compression (default is 2). It should be equal to the number of CPUs available for compression (default 2) cpu_profile string write cpu profile to file enforces client cert check grpc_cert string certificate to use, requires grpc_key, enables TLS grpc_compression string how to compress gRPC, default: nothing, supported: snappy grpc_enable_tracing boolean Enable backup completes. Example Flags Name Type Definition concurrency Int Specifies the number of compression/checksum jobs to run simultaneously Arguments • – Required. A Tablet Alias uniquely

consistent_lookup and consistent_lookup_unique. ### Corner cases to keep in mind Non-unique lookups: the above algorithm will work equally well for non-unique lookup. The only change will be the definition of a duplicate lookup insert results in a duplicate key error, the algorithm will have to fall back to individual inserts in order to implement the above algorithm 42 for rows that yield dup keys. For simplicity, we processed, at once, before the writer blocks, during compression (default is 2). It should be equal to the number of CPUs available for compression (default 2) cpu_profile string write cpu profile to file

consistent_lookup and consistent_lookup_unique. Corner cases to keep in mind Non-unique lookups: the above algorithm will work equally well for non-unique lookup. The only change will be the definition of a duplicate lookup insert results in a duplicate key error, the algorithm will have to fall back to individual inserts in order to implement the above algorithm for rows that yield dup keys. For simplicity, we may processed, at once, before the writer blocks, during compression (default is 2). It should be equal to the number of CPUs available for compression (default 2) cpu_profile string write cpu profile to file

consistent_lookup and consistent_lookup_unique. ### Corner cases to keep in mind Non-unique lookups: the above algorithm will work equally well for non-unique lookup. The only change will be the definition of a duplicate lookup insert results in a duplicate key error, the algorithm will have to fall back to individual inserts in order to implement the above algorithm 43 for rows that yield dup keys. For simplicity, we processed, at once, before the writer blocks, during compression (default is 2). It should be equal to the number of CPUs available for compression (default 2) cpu_profile string write cpu profile to file

consistent_lookup and consistent_lookup_unique. Corner cases to keep in mind Non-unique lookups: the above algorithm will work equally well for non-unique lookup. The only change will be the definition of a duplicate lookup insert results in a duplicate key error, the algorithm will have to fall back to individual inserts in order to implement the above algorithm for rows that yield dup keys. For simplicity, we may processed, at once, before the writer blocks, during compression (default is 2). It should be equal to the number of CPUs available for compression (default 2) cpu_profile string write cpu profile to file

order) is sufficient and this is the default if this field is omitted. See the comment on the ‘algorithm’ field for more restrictions and information. split_count int64 You can specify either an estimate Name Description num_rows_per_query_part int64 algorithm query.SplitQueryRequest.Algorithm The algorithm to use to split the query. The split algorithm is performed on each database shard in parallel EQUAL_SPLITS If this algorithm is selected then only the first ‘split_column’ given is used (or the first primary key column if the ‘split_column’ field is empty). In the rest of this algorithm’s description

order) is sufficient and this is the default if this field is omitted. See the comment on the ‘algorithm’ field for more restrictions and information. split_count int64 You can specify either an estimate Name Description num_rows_per_query_part int64 algorithm query.SplitQueryRequest.Algorithm The algorithm to use to split the query. The split algorithm is performed on each database shard in parallel EQUAL_SPLITS If this algorithm is selected then only the first ‘split_column’ given is used (or the first primary key column if the ‘split_column’ field is empty). In the rest of this algorithm’s description

categories: they are either not cryptographic primitives or Vitess are bound to use a specific hashing algorithm to comply with MySQLʼs interface. This table illustrate how each case is categorized: # Component security sensitive data. We consider this a security issue. We recommend using a secure hashing algorithm. The issue exists in vitess/go/mysql/auth_server.go in ScrambleMysqlNativePassword: https://github