Berlin Buzzwords 2015: Adrien Grand – Algorithms & data-structures that power Lucene & ElasticSearch

preview_player
Показать описание
When you want to make search fast, 80% of the job involves organizing your data so that it can be accessed with as little work as possible. This is the exact reason why Lucene is based on an inverted index. But there are some very interesting algorithms and data structures involved in that last 20% of the job.

In this talk, you will gain insights into some internals of Lucene and ElasticSearch, and see how priority queues, finite state machines, bit twiddling hacks and several other algorithms and data structures help make them fast.

Read more:

About Adrien Grand:

Рекомендации по теме
Комментарии
Автор

Agenda:
conjunctions: 1:30
regexp queries: 9:15
numeric doc values compression: 14:47
cardinality aggregation: 24:46

davids
Автор

Succintly explained. Thanks a lot for sharing.

AmanGarg
Автор

Which values are being hashed in hyperloglog?

tarunjain