tintor

39 ms·

541.
by tintor 12y ago
It is interesting how the neural network labeled the woman in the lower right photo with the rectangle that includes the body only, without the head.
542.
Learn to Spritz(learn2spritz.com)
1 points by tintor 13y ago|2 comments
543.
by tintor 13y ago
MemSQL relational database has extensive support for JSON and online ALTER TABLE. Indexes can be created on fields within JSON documents for faster access. Online ALTER TABLE doesn't take any long running lock, so it can run in the bac
544.
by tintor 13y ago
Regarding MemSQL: - we have just released v2.5 with full support for JSON and online ALTER TABLE across cluster - MemSQL performs great on both OLAP and OLTP - it scales well: we have several hundred node cluster in production at Zynga - li
545.
by tintor 13y ago
GDB reverse debugger is very slow as it is saving the execution state after every instruction executed. There is a commercial plugin for GDB reverse debugger: UndoDB. It is much faster than just GDB (they claim only 1.7x slowdown), but unfo
546.
Meet Cortana, the new voice of Microsoft(www2.macleans.ca)
2 points by tintor 13y ago|0 comments
547.
by tintor 14y ago
What would happen to my package if BufferBox would happen to be full at the time of delivery? :)
548.
by tintor 14y ago
Have you read his entire blog post?
549.
Oracle Calls Out Microsoft over Vaporware Fantasy(forbes.com)
4 points by tintor 14y ago|0 comments
550.
by tintor 14y ago
What is the difference between DatabaseThreadSafe and DatabaseSuperThreadSafe? http://labs.codernity.com/codernitydb/design.html#how-it-s-b...
551.
by tintor 14y ago
How do you do lock-free updates to the R-tree structure?
552.
by tintor 14y ago
Nice job!
553.
by tintor 14y ago
Modern x64s have 128-bit CAS instruction, but the problem is that those two pointers can be far apart in memory, in two different elements of the list.
554.
by tintor 14y ago
@Criss Isolation levels are used to specify semantics only. DBMS is free to implement them in different ways. Take a look at this VLDB 2012 paper about optimistic concurrent control in main memory databases, like MemSQL, which also describe
555.
by tintor 14y ago
"How do you feel about the reported performance of "SELECT * FROM table ORDER BY id DESC LIMIT 5;"?" Index was missing on ID column in MemSQL's case, so MemSQL was running entire table scan instead of using the index as MySQL.
556.
by tintor 14y ago
In MemSQL transaction buffer is flushed continuously as long as it is not empty. Default value of 128M is there just to absorb bursts in workload.
557.
by tintor 14y ago
Skip list is essentially a hierarchy of linked lists. It is very hard to make a doubly linked list work concurrently without using locks. One would have to update two pointers atomically in order to insert a new element in a doubly linked l
558.
by tintor 14y ago
It is not about the cost of parsing SQL text. Think of it as intermediate bytecode for SQL that is interpreted as query is being executed. Every SQL database does some variation of it. What is unique about MemSQL is that this bytecode is a
559.
by tintor 14y ago
"and does it crash and burn and corrupt all its data if a malloc() fails" MemSQL is fully durable (with option of sync and async durability, similar to sync and async replication) with its transactional log. If MemSQL process is killed it w
560.
by tintor 14y ago
Recovery on the system restart is going at the "sequential scan" speed of hard disk.
561.
by tintor 14y ago
"Why not fork MySQL Cluster to add the SQL-to-C++ code generation (and lock-free storage engine)?" :) It is a little more complicated than that.
562.
by tintor 14y ago
No, original query plan will only expire if indexes are dropped or new ones are created.