X-fast trie
id:
x-fast-trie-189-11838351
title:
X-fast trie
text:
In computer science, an x-fast trie is a data structure for storing integers from a bounded domain. It supports exact and predecessor or successor queries in time O(log log M), using O(n log M) space, where n is the number of stored values and M is the maximum value in the domain. The structure was proposed by Dan Willard in 1982, along with the more complicated y-fast trie, as a way to improve the space usage of van Emde Boas trees, while retaining the O(log log M) query time.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/X-fast_trie
date created:
2011-04-10T00:51:39Z
date modified:
2024-09-09T12:55:23Z
main entity:
{"identifier":"Q8041554","url":"https://www.wikidata.org/entity/Q8041554"}
image:
fields total:
13
integrity:
14