[09:51:47] lunch [13:01:01] o/ [13:22:36] \o [13:27:35] .o/ [13:27:38] o/ [13:28:10] I set the number of shard recoveries for codfw from 4 to 7 , hopefully that will speed up the reboot stuff. I'm keeping an eye out but if you notice P95 creeping up LMK [13:28:16] concerning index upgrades so we have now only have .ltr and .tasks indices left [13:28:55] should we schedule a quick switch-over to do the upgrades, not sure we can upgrade those without interruption [13:30:17] dcausse sure, we can do it now if you think it's low risk. Otherwise happy to schedule some time next week. I'll be out for the next 10 days after next week [13:31:18] I think the .tasks indices can be dropped, the .ltr ones I suspect the models are cached but that sounds risky [13:31:41] inflatador: sure [13:31:47] hmm, yea i think the ltr ones we have to move traffic for, wouldn't want to risk it [13:32:09] ACK, sounds like the preference is to schedule time next week then? Otherwise I can just failover now [13:32:59] perhaps not on a friday, I don't have any scripts ready to do it, next week is fine [13:33:24] OK, let's schedule for 30m before Monday's standup if that works? [13:33:38] +1 [13:33:49] monday is a holiday for me and IIRC in the us too? [13:33:55] oh duh, yea it is [13:34:02] Ooops [13:34:12] So much for my bright ideas. Tuesday it is ;P [13:34:16] :) [13:40:36] OK, I sent the invite but feel free to suggest a different time if that doesn't work [13:42:42] thanks! [14:40:17] OK, I updated my crappy maintenance dashboards to use tmuxp . Feel free to try out/offer suggestions if interested: https://gitlab.wikimedia.org/repos/search-platform/es-maint-viewer [16:14:55] i was curious about how effective the Soundness test was for regexes. Pulling it back to the previous implementation it gets 25 fails in 5k iterations. It might actually be useful :) [16:15:54] ex: Expression ((((bcc AND ccd) OR ((dba OR eba) AND bac AND acd)) AND cdb) OR (bab AND aba AND bad AND adb AND dba) OR (bab AND aba AND bad AND adb AND dbc) OR (bab AND aba AND bad AND add) OR (bac AND aca) OR ((((dba OR eba) AND bac AND aca AND cad) OR ((((dba OR eba) AND bac AND aca AND caa) OR (bab AND aba AND bad AND ada AND daa) OR (bab AND aba AND baa AND aaa)) AND aad) OR (bab AND [16:15:56] aba AND bad AND ada AND dad) OR (bab AND aba AND baa AND aad)) AND adb AND dbc)) not satisfied by 'ebcLbcebc񞓺bcc;bcadbccb' (regex: (([d-e]bac|.bc[c-d]?|babad*)+a*|(baca.)+)dbccb, rewritten: (([d-e]bac|[^﷐﷑]bc[c-d]?|babad*)+a*|(baca[^﷐﷑])+)dbccb, gramSize: 3) [16:15:59] * ebernhardson should have chose a shorter one [16:29:19] better example (looking for examples to put in notes for presenting this): (bae OR (((acc AND cca) OR aca OR (adc AND dca)) AND cae) OR adc) not satisfied by 'ι꭯bcae' (regex: ..+[b-c]ae, rewritten: [^﷐﷑][^﷐﷑]+[b-c]ae, gramSize: 3) [16:34:43] and it confirms (by skipping rewriting) that this is not due to rewriting, rewriting just made it more obvious [17:11:24] nice! the dfa approach had strong limitations indeed [17:11:35] heading out, have a nice week end [17:51:09] .o/ [17:51:38] FYI, it does look like the choice of qlever for WDQS is public now: https://www.wikidata.org/wiki/Wikidata:Wikidata_Platform_team/Newsletter#Backend_replacement_and_architectural_design_proposals [17:56:17] nice!