Y-fast trie
id:
y-fast-trie-232-3102490
title:
Y-fast trie
text:
In computer science, a y-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) 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 to decrease the O(n log M) space used by an x-fast trie.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Y-fast_trie
date created:
date modified:
2024-03-09T02:16:46Z
main entity:
{"identifier":"Q8045718","url":"https://www.wikidata.org/entity/Q8045718"}
image:
fields total:
13
integrity:
13