That's the boring solution. If you don't have a use case, what kind of queries you would run then opt for maximum flexibility with the minimum setup of a managed solution.
If cost is prohibitive on the long run, you can figure out a more tailored solution based on the revealed preferences.
Fiddling with CSVs is the DWH version of the legendary "Dropbox HN commenter".
Disruptive tech monopolies upset entire existing industries for the sake of their owners/shareholders/employees, which is usually tiny compared to the said industries.
(Think of FB/Google advertisement centralisation as the end of other media providers.)
Hungary had and still has a state sponsored "elite" education for gifted children. From a relatively early age kids are regularly tested (both materially and curiosity wise) if they are interested in "better" Maths. So they are prepared to a STEM trajectory.
You don't need to be a genius just reasonably good and interested. I would think 10% of all kids take part.
Check out UKMT for the equivalent in the UK or Kangaroo competitions.
Secondary schools has a 130! year old journal (KOMAL) for competition Maths (again various difficulties) but those who go on to become mathematicians (an extremely selective subject in Hungary) pass the hardest tests as well.
So Hungary has various levels of gifted children support programs and has it for the last 100+ years (across 3-4 different government structures)
Hmm, I had to check this and came across this thread on Reddit. NIST has a standard for it, but the exact point is that _that_ can be influenced by them.
Also, somewhere in the thread, they mention that it is probably too hard to verify how it is actually implemented in the hardware.
I found that the best to think of graph implementation is sparse matrices of the adjacency matrix. CSR/CSC format has fast lookup abilities, building and switching between formats is "relative" efficient. Most graph algorithms need primitives that can be built on top of this.
For distributed computing one can look int GraphLab or its smaller version, now largely abandoned GraphChi.
I don't have anything against debuggers, but I feel more natural to write into the code and this simplifies it.
TBH I haven't tried this or snoop heavily and the project was more of a curiosity of how the internals of python work after I found a relevant SO post.
Honestly I was surprised how easy it was.
If you actually want to use something like this use snoop: https://pypi.org/project/snoop/ it is more feature rich and maintained.
I don't remember response speed mattered until at least ten years after Google's start.
Certainly not when they won.
They were better. Basic PageRank was better than anything else. And once they figured out advertisement, they kept making it better to seal their dominance.
Why?
That's the boring solution. If you don't have a use case, what kind of queries you would run then opt for maximum flexibility with the minimum setup of a managed solution.
If cost is prohibitive on the long run, you can figure out a more tailored solution based on the revealed preferences.
Fiddling with CSVs is the DWH version of the legendary "Dropbox HN commenter".