Skip to main content

Blog - Page 24

Nonviolent Communication is not about appearing friendly, nor is it about getting others to do what we want; it concerns mutual understanding between people. There are two ways to strengthen connections and understanding between individuals: expressing our feelings and needs vulnerably; and actively listening to the feelings and needs of others.

Read more →

KYC is not easy; employees outside the marketing department may never have the opportunity to understand buyers' needs. Buyer persona = buyer profile (who will buy) + buyer insights (when/how/why they buy)

Read more →

The relational database is the default choice for most storage use cases, by reason of atomicity, consistency, isolation, and durability. How is consistency here different from the one in CAP theorem? Why do we need 3NF and DB proxy?

Read more →

When customers evaluate a product or service, they weigh perceived value against actual price. The elements of value include functional value; emotional value; life-changing; and social impact.

Read more →

When reading data from a hard disk, a database join operation is time-consuming and 99% of the time is spent on disk seek. To optimize read performance, denormalization is introduced and four categories of NoSQL are here to help.

Read more →

To better sell products, you need to know your customers better. A generic buyer profile doesn’t help in knowing his buying decision. The most effective way to build buyer personas is to interview buyers who have weighed their options but finally made the decision you expect.

Read more →

What are CAC, LTV, and PBP in marketing? CAC (Customer Acquisition Cost), LTV (Customer Lifetime Value), PBP (Payback Period). The LTV:CAC ratio helps you determine how much you should spend to acquire a customer for sustainable growth.

Read more →

Judgments and violence are tragic expressions of unmet needs. Nonviolent communication can improve communication quality by valuing everyone’s needs. It is NOT about being nice or making others do what we want.

Read more →

A bloom filter is a data structure used to detect whether an element is in a set in a time and space efficient way. A query returns either "possibly in set" or "definitely not in set".

Read more →

A skip-list is essentially a linked list that allows you to do a binary search on. The way it accomplishes this is by adding extra nodes that will enable you to ‘skip’ sections of the linked-list. There are LevelDB MemTable, Redis SortedSet and Lucene inverted index using this.

Read more →

A skip list is essentially a linked list that allows for binary search. It achieves this by adding extra nodes that enable you to "skip" parts of the linked list. Given a random number generator to create these extra nodes, a skip list has O(log n) complexity for search, insert, and delete operations.

Read more →

A Bloom filter is a data structure that is used to determine whether an element is a member of a set with a much higher space and time efficiency than other general algorithms. The results obtained using a Bloom filter may yield false positive matches, but cannot yield false negative matches. Elements can be added to the set, but cannot be removed; the more elements added to the set, the greater the likelihood of false positives.

Read more →