Lesson plan

TreapDB

TreapDB is a kind of NoSQL data store, and it is based on Treap data structure. Treap is a randomized balanced search tree, which has O(log(n)) complexity to insert or find a key. TreapDB supports many operations besides "get" and "set". For example, "prefix foo" fetch all the pairs whose key startswith "foo". TreapDB can be used in two ways: embedded library or standalone server. TreapDB is sponsored by Sino-German Joint Laboratory of Software Integration.

Back to article

Article summary

TreapDB is a kind of NoSQL data store, and it is based on Treap data structure. Treap is a randomized balanced search tree, which has O(log(n)) complexity to insert or find a key. TreapDB supports many operations besides "get" and "set". For example, "prefix foo" fetch all the pairs whose key startswith "foo". TreapDB can be used in two ways: embedded library or standalone server. TreapDB is sponsored by Sino-German Joint Laboratory of Software Integration.

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.