Partitioned Elias–Fano indexes
| ← Previous revision | Revision as of 06:38, 20 April 2026 | ||
| Line 1: | Line 1: | ||
{{Orphan|date=June 2025}} |
{{Orphan|date=June 2025}} |
||
'''Partitioned Elias–Fano (PEF) indexes''' are a compressed [[data structure]] designed for efficiently representing sorted integer sequences, notably [[inverted index]]es in information retrieval. Introduced by Giuseppe Ottaviano and Rossano Venturini in 2014, PEF indexes enhance classic Elias–Fano encoding by dividing sequences into partitions or chunks to leverage local clustering, thus achieving superior compression without sacrificing query speed.{{cite conference|last1=Ottaviano|first1=Giuseppe|last2=Venturini |first2=Rossano|chapter=Partitioned Elias–Fano indexes|title=Proceedings of the 37th International ACM SIGIR Conference on Research & Development in Information Retrieval|year=2014|pages=273–282 |doi=10.1145/2600428.2609615|isbn=9781450322577}} |
'''Partitioned Elias–Fano (PEF) indexes''' are a compressed [[data structure]] designed for efficiently representing sorted integer sequences, notably [[inverted index]]es in information retrieval. Introduced by Giuseppe Ottaviano and Rossano Venturini in 2014, PEF indexes enhance classic Elias–Fano encoding by dividing sequences into partitions or chunks to leverage local clustering, thus achieving superior compression without sacrificing query speed.{{cite conference|last1=Ottaviano|first1=Giuseppe|last2=Venturini |first2=Rossano|chapter=Partitioned Elias–Fano indexes|title=Proceedings of the 37th International ACM SIGIR Conference on Research & Development in Information Retrieval|year=2014|pages=273–282 |doi=10.1145/2600428.2609615 |doi-access=free |isbn=9781450322577}} |
||
== Background == |
== Background == |
||
