By: Curt Monash
David, The Requests are Short in more than time. (Less true of the Processing.) Geordee, OnLine Request Processing was the first suggestion. But frankly, the OLAP term was problematic almost from the...
View ArticleBy: Michael Hummel
Hi Curt, my initial interpretation of short in respect to request processing would be “simple”. Although there can be very simple queries with short run-time, I guess there can be more complex ones...
View ArticleClik here to view.
By: Liran Zelkha
How about Micro Request Processing? It implies request is short, but also the response time is short.
View ArticleClik here to view.
By: Curt Monash
Liran, I don’t see what that adds. In particular, I don’t buy the implication. Anyhow, my real question is whether you’ll adopt whatever I end up with.
View ArticleBy: Mike Hogan
Simple Interactive Net Database = SIN DBMS “Net” could be exchanged with “Cloud” but the result is less catchy. This is more applicable to key-value stores than SQL DBMS though.
View ArticleBy: Martin Willcox
@Micheal – no, if we want a stable classification system then it would be a mistake to focus on execution times; execution times already vary significantly where similar requests are executed on...
View ArticleBy: An odd claim attributed to Mike Stonebraker | DBMS 2 : DataBase...
[...] an ideal way to do things, he’s surely right. That still leaves a lot of options for massive short-request databases, however, including transparently sharded RDBMS, scale-out in-memory DBMS...
View Article
