yud-bet / autocomplete Goto Github PK

Autocomplete UI
Ceeit on Air

With small data we can store it in the relational databases. However, fetching the top k search queries from a relational database is inefficient. The data structure trie (prefix tree) is used to overcome the problem.

To sort the result we need to store the frequency along with the node.

Updating the tree in realtime is not practical for 2 reasons:

• Users may enter billions of queries per day. Updating the trie on every query significantly slows down the query service.
• Top suggestions may not change much once the trie is built. Thus, it is unnecessary to update the trie frequently. So, we need to build the data gathering service.

It stores raw data about search queries.

The query logs is usually very large and data is not in the right format. We need to aggregate data so it can be easily proccess later.

Workers perform asynchronous jobs at regular intervals.

Cache most recent queries for a faster retrieval.

Trie is converted to hash table form and save to noSQL database.

Service that perform search autocomplete. We can futher optimize query service by cache the result in the browser.

The next thing we want to look at is scaling the database.

$ npm install

# development
$ npm run start

# watch mode
$ npm run start:dev

# production mode
$ npm run start:prod