Search results

{{Short description|Data structure for anagram solving}} ...|volume=17|issue=1 |pages=2012 |doi=10.1145/2133803.2133804}}</ref> is a [[data structure]] designed to solve [[anagram]]s. Solving an anagram is the probl ...

...after, AMQ filters) comprise a group of space-efficient probabilistic data structures that support approximate membership queries. An approximate membership quer ...MQ filters support inserting elements one at a time without rebuilding the data structure. Other AMQ filters have to be rebuilt after each insertion. Those ...

{{Short description|Data structure for approximate set membership}} A '''cuckoo filter''' is a space-efficient [[probabilistic]] [[data structure]] that is used to test whether an [[Element (mathematics)|element ...

A '''counting Bloom filter''' is a [[probabilistic]] [[data structure]] that is used to test whether the number of occurrences of a giv ...ll set to 0. Similar to Bloom filter, there must also be ''k'' different [[hash function]]s defined, each of which [[Map (mathematics)|maps]] or hashes som ...

{{about|a data structure|retrieving information from texts|Information retrieval}} ...>{{cite thesis| type=PhD | title=Random hypergraphs for hashing-based data structures.|first1=Walzer|last1=Stefan|year=2020|pages=27–30|url=https://www.db-thueri ...

...|Programming technique for resolving duplicate hash values in a hash table data structure}} ...echnique for resolving [[hash collision|collisions]] in a [[hash table]] [[data structure]].<ref name="inventor">Fredman, M. L., Komlós, J., and Szemerédi, ...

{{short description|Lossless, but memory-consuming, data compression algorithm}} ...r''' (short for '''recursive pairing''') is a [[Grammar-based code|grammar-based compression]] algorithm that, given an input text, builds a [[straight-line ...

...ural information processing systems. 1989.</ref> but differs in its use of hash functions with low dependence, which makes it more practical. The inventors of this data structure offer the following iterative explanation of its operation:{{sfn ...

'''Skip graphs''' are a kind of distributed data structure based on [[skip list]]s. A nearly identical data structure called SkipNet was independently invented by Nicholas Harvey, Mic ...

{{Short description|Probabilistic data structure in computer science}} ...l |last=Cormode |first=Graham |author2=S. Muthukrishnan |title=An Improved Data Stream Summary: The Count-Min Sketch and its Applications |journal=J. Algor ...

{{Short description|Family of hash functions}} ...fs between the degree of independence and the efficiency of evaluating the hash function are well studied, and many ''k''-independent families have been pr ...

{{Short description|Hash functions computed by exclusive or}} ...''' is a method for constructing [[Universal hashing|universal families of hash functions]] by combining [[lookup table|table lookup]] with [[exclusive or] ...

{{Short description|Data mining technique}} In [[computer science]] and [[data mining]], '''MinHash''' (or the '''min-wise independent permutations''' [[l ...

A '''quotient filter''' is a space-efficient [[probabilistic]] [[data structure]] used to test whether an [[element (mathematics)|element]] is a ...uery. In addition it can also be merged and re-sized without having to re-hash the original keys (thereby avoiding the need to access those keys from seco ...

{{Short description|Topological data}} ...440px|An example of simplicial complex, and the corresponding simplex tree data structure. Notice the two lowest nodes have a path of 4 to the node, indica ...

...phy]], an '''accumulator''' is a [[one way function|one way]] membership [[hash function]]. It allows users to certify that potential candidates are a memb Benaloh and de Mare define a one-way hash function as a family of functions <math>h_{\ell}: X_{\ell}\times Y_{\ell}\t ...

...9 |pages=12–16 |access-date=2023-10-28}}</ref> The original formulation is based on [[graph canonization]], a normal form for graphs, while there is also a ==Weisfeiler-Leman-based Graph Isomorphism heuristics== ...

...2/https://blog.covidwatch.org/en/covid-watch-whitepaper-using-crowdsourced-data-to-slow-virus-spread}}</ref> develop,<ref name="github.com">{{Cite web|url= ...umr.pocoo.org/2020/4/9/tcn-contact-tracing/|title=Temporary Contact Number based Contact Tracing|website=lucumr.pocoo.org|access-date=2020-04-19}}</ref> Whe ...

...multiple straight forward approaches to implement such a trie as physical data structure. To state two: ...es named Array Mapped Tree (AMT). The [[Hash array mapped trie]] (HAMT) is based on AMT. The compact trie node representation uses a bitmap to mark every va ...

{{Short description|Graph data structure}} In [[computer science]], an '''e-graph''' is a [[data structure]] that stores an [[equivalence relation]] over [[Term (logic)|ter ...