I have a work related puzzle that I can't seem to solve. There's a database with two million records. I need the average of every record timestamped 10:15 on Monday. Sounds simple right? The simple query doesn't meet performance criteria. It takes far too long to run on two million records.
So anyway, we started over. Now every interval has unique integer associated with it. So midnight is 0, 12:15 is 1, 12:30 is 2, 12:45 is 3, so on and so forth. Now instead of comparing dates, we are searching for integers.
Still takes too long.
I need all the records that have a unique integer of, for example, 5. Takes 35 seconds to run over two million records
Ok, after only a tiny amount of research, I think I have something I want to try
We have a bug in currently that says that the data is not being read in fast enough.
We also have a ton of indexes already in place
"As with most performance optimization techniques, there are tradeoffs. For example, with more indexes, SELECT queries will potentially run faster. However, DML (INSERT, UPDATE, and DELETE) operations will slow down significantly because more indexes must be maintained with each operation"
I'm gonna try wiping out every index we have, so that the inserts aren't hogging all of the resources
261 289 characters
Regex with backreferences, 289 characters
Yes, it is possible!
/^(?=.{64}2\)\?\.\*\\.{204}\\2\\\(\)\{2\}\.\{11\}\$\/$)((.*)(\2\2)?.*\/\2\^\2\(\2\?=\2\.\2\{64\2\}2\2\\\2\)\2\\\2\?\2\\\2\.\2\\\2\*\2\\\2\\\2\.\2\{204\2\}\2\\\2\\2\2\\\2\\\2\\\2\(\2\\\2\)\2\\\2\{2\2\\\2\}\2\\\2\....
The question Find i^n, given n does not clearly state whether the solution must be a compilable program or can be an expression, neither does it identify where the input shall come from.
This leads to answers like this, which are a mixture of both and neither short nor compilable.
For verbose l...
It seems to me that if you apply a regular expression to a body of text, and also highlight all the matches, then sure, you have output. But the part in bold is not a regular expression (the way I learned it anyway)
So I guess regex is short for take a regular expression and also highlight all the matches
Hmmm... spend all weekend listening to saw tooth noises on repeat, or spend all weekend pitting wolves and lions and bears and rocks against each other in an ultimate battle royale? I think I'll pass on the saw tooth noises
my father lied to me and I ate something containing Pork many many years ago
this may be why I'm a paranoid nutcase
my brother is much more sensible, he's vegetarian at home by virtue of not buying meat because it's expensive and such, but he doesn't decline food that other people try and give him, which I always will
Addition with Regex
code-challenge (code-golf?) regular-expression arithmetic
I want to try a new type of regex golf challenge, which will ask you to use regex substitutions for tasks it really wasn't meant for.
We'll start simple: given a string containing two positive integers, as decimal nu...
261 289 characters
Regex with backreferences, 289 characters
Yes, it is possible!
/^(?=.{64}2\)\?\.\*\\.{204}\\2\\\(\)\{2\}\.\{11\}\$\/$)((.*)(\2\2)?.*\/\2\^\2\(\2\?=\2\.\2\{64\2\}2\2\\\2\)\2\\\2\?\2\\\2\.\2\\\2\*\2\\\2\\\2\.\2\{204\2\}\2\\\2\\2\2\\\2\\\2\\\2\(\2\\\2\)\2\\\2\{2\2\\\2\}\2\\\2\....
The question Find i^n, given n does not clearly state whether the solution must be a compilable program or can be an expression, neither does it identify where the input shall come from.
This leads to answers like this, which are a mixture of both and neither short nor compilable.
For verbose l...
Addition with Regex
code-challenge (code-golf?) regular-expression arithmetic
I want to try a new type of regex golf challenge, which will ask you to use regex substitutions for tasks it really wasn't meant for.
We'll start simple: given a string containing two positive integers, as decimal nu...
