Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Distributed hash table (view), Concurrent hash table (view)

searching for Hash table 76 found (326 total)

alternate case: hash table

Unique key (1,172 words) [view diff] no match in snippet view article find links to article

In relational database management systems, a unique key is a candidate key. All the candidate keys of a relation can uniquely identify the records of the

Succinct data structure (2,896 words) [view diff] exact match in snippet view article find links to article

log ⁡ log ⁡ n ) {\displaystyle O(m\log \log \log n)} bits. A succinct hash table, also known as a succinct unordered dictionary, is a data structure that

Level set (data structures) (1,262 words) [view diff] case mismatch in snippet view article

fashion, a technique introduced by Nielsen & Museth's similar DT-Grid. The Hash Table Local Level Set method, introduced in 2011 by Eyiyurekli and Breen and

Primary clustering (1,272 words) [view diff] exact match in snippet view article find links to article

a linear probing hash table, they have a tendency to cluster together into long runs (i.e., long contiguous regions of the hash table that contain no free

Bitboard (3,017 words) [view diff] exact match in snippet view article find links to article

the two unidirectional vectors indexed from the hash table. The number of entries in the hash table is modest, on the order of 8*2^8 or 2K bytes, but

Episode filesystem (107 words) [view diff] exact match in snippet view article find links to article

1992; 33 years ago (1992) Structures Directory contents 8KB blocks with hash table File allocation inode-based Limits Max filename length 256 bytes Features

Parameter (computer programming) (3,856 words) [view diff] no match in snippet view article

representing the hash key for the data: class HASH_TABLE [G, K -> HASHABLE] … When a class becomes a client to HASH_TABLE, the formal generic parameters are substituted

Approximate membership query filter (1,639 words) [view diff] exact match in snippet view article find links to article

quotient determines where in the hash table the remainder is stored. Additional three bits for every slot in the hash table are used to resolve soft collisions

F2FS (2,017 words) [view diff] exact match in snippet view article find links to article

scans the hash table in level #0 to find the dentry consisting of the file name and its inode number. If not found, F2FS scans the next hash table in level

Vsync (library) (318 words) [view diff] case mismatch in snippet view article

replicated data, a distributed key-value store (also called a Distributed Hash Table or DHT), and scalable aggregation. The system implements the virtual synchrony

Array (504 words) [view diff] exact match in snippet view article find links to article

data structure model composed of key-value pairs, often implemented as a hash table or search tree or various kinds of the above, such as: Bit array or bit

Cuckoo filter (1,071 words) [view diff] exact match in snippet view article find links to article

Cuckoo filters were first described in 2014. A cuckoo filter uses a hash table based on cuckoo hashing to store the fingerprints of items. The data structure

Voldemort (distributed data store) (415 words) [view diff] exact match in snippet view article

and the ACID properties, but rather is a big, distributed, persistent hash table. A 2012 study comparing systems for storing application performance management

842 (compression algorithm) (521 words) [view diff] exact match in snippet view article

sub-phrases of 8, 4 and 2 bytes. A hash of each phrase is used to look up a hash table with offsets to a sliding window buffer of past encoded data. Matches

Symmetric hash join (73 words) [view diff] exact match in snippet view article find links to article

data streams. For each input, create a hash table. For each new record, hash and insert into inputs hash table. Test if input is equal to a predefined

Linux From Scratch (1,349 words) [view diff] exact match in snippet view article find links to article

hash table, in form of C or C++ code, for looking up a value depending on the input string. The hash function is perfect, which means that the hash table

VMDS (945 words) [view diff] exact match in snippet view article find links to article

each key in the hash table corresponds to the name of the field (or column) in # the collection (or table) valve_data << hash_table.new_with( :asset_id

Perl virtual machine (930 words) [view diff] exact match in snippet view article find links to article

contains all variables that are defined within a package. Each value in this hash table is a Glob Value (GV). Special Array Value is padlist which is an array

Software transactional memory (2,117 words) [view diff] exact match in snippet view article find links to article

compose: correct fragments may fail when combined. For example, consider a hash table with thread-safe insert and delete operations. Now suppose that we want

Ikarus (Scheme implementation) (460 words) [view diff] exact match in snippet view article

libraries". Finally, the paper "Generation-Friendly Eq Hash Tables" covers the hash table implementation in Ikarus. Ikarus runs on x86 but requires SSE2 support

Retrieval Data Structure (1,514 words) [view diff] exact match in snippet view article find links to article

construct a perfect hash function: First insert the keys into a cuckoo hash table with H = 2 r {\displaystyle H=2^{r}} hash functions h i {\displaystyle

Shared memory (1,301 words) [view diff] exact match in snippet view article find links to article

Richard Stevens "UNIX Network Programming, Volume 2, Second Edition: Interprocess Communications". SharedHashFile, An open source, shared memory hash table.

Ramesh Govindan (848 words) [view diff] exact match in snippet view article find links to article

International Computer Science Institute and UCLA have developed a geographic hash table which was later used along with data-centric storage system. In 2004,

Re-Pair (1,230 words) [view diff] exact match in snippet view article find links to article

updated. A hash table to keep track of already defined pairs. This table is updated each time a new pair is created or removed. Since the hash table and the

Pharos network coordinates (402 words) [view diff] exact match in snippet view article find links to article

in many well-known internet systems, such as Bamboo DHT (Distributed hash table), Stream-Based Overlay Network (SBON) and Azureus BitTorrent. Pharos is

Mmap (1,137 words) [view diff] exact match in snippet view article find links to article

function is somewhat equivalent to mmap. More example source code: SharedHashFile, An open source, shared memory hash table implemented using mmap().

Hash (Unix) (204 words) [view diff] exact match in snippet view article

values: 0 Successful completion 1 An Error occurred $ hash Print the hash table. $ hash cat Searches for command cat in the path specified by PATH environmental

Delta encoding (1,680 words) [view diff] exact match in snippet view article find links to article

Package Manager is based on a heavily modified bsdiff that can use a hash table for matching. FreeBSD also uses bsdiff for updates. Since the 4.3 release

TLA+ (4,068 words) [view diff] exact match in snippet view article find links to article

the Memoir security architecture, components of the Pastry distributed hash table, and the Spire consensus algorithm. It is distributed separately from

Unix File System (1,966 words) [view diff] exact match in snippet view article find links to article

Dirhash system, developed by Ian Dowse. This system maintains an in-memory hash table to speed up directory lookups. Dirhash alleviates a number of performance

Triangle mesh (1,047 words) [view diff] exact match in snippet view article find links to article

tmap The maps support the standard insertion and removal functions for a hash table. Insertion occurs only if the item does not already exist. Removal occurs

Jenkins hash function (852 words) [view diff] case mismatch in snippet view article find links to article

hash functions Jenkins, Bob (November 3, 2013). "A hash function for hash Table lookup". Retrieved February 9, 2018. Jenkins, Bob (September 1997). "Hash

KLV (564 words) [view diff] exact match in snippet view article find links to article

endian: The first few bytes are the Key, much like a key in a standard hash table data structure. Keys can be 1, 2, 4, or 16 bytes in length. Presumably

Peter Druschel (257 words) [view diff] exact match in snippet view article find links to article

systems. Along with Ant Rowstron, Druschel developed the Pastry distributed hash table technique at Microsoft. In 2008 Druschel was elected a member of the German

JXTA (968 words) [view diff] case mismatch in snippet view article find links to article

Distributed Index (SRDI). After that, the rendezvous applies a Distributed Hash Table (DHT) function so that it can forward the index to another peer in the

RSX Reality Synthesizer (1,716 words) [view diff] case mismatch in snippet view article find links to article

FF80000-FFFFFFF 512KB RAMIN: Instance Memory FF90000-FF93FFF 16KB RAMHT: Hash Table FFA0000-FFA0FFF 4KB RAMFC: FIFO Context FFC0000-FFCFFFF 64KB DMA Objects

Simple API for XML (1,656 words) [view diff] exact match in snippet view article find links to article

element events, but can also be provided as separate events, or via a hash table or similar collection of all the attributes. For another, some implementations

Cross-layer interaction and service mapping (235 words) [view diff] case mismatch in snippet view article find links to article

2007 P.Venkata Krishna, N.Ch.S.N.Iyengar and Sudip Misra, "An Efficient Hash Table Node Identification Method For Bandwidth Reservation in Hybrid Cellular

NEC HYDRAstor (406 words) [view diff] exact match in snippet view article find links to article

Dubnicki; Cristian Ungureanu; Wojciech Kilian (2004). "FPN: a distributed hash table for commercial applications". Proceedings. 13th IEEE International Symposium

Libslack (131 words) [view diff] exact match in snippet view article find links to article

(with reader/writer lock implementation if missing) map map data type (hash table) with flexible locking mem memory helper functions, dynamic n-dimensional

Racket features (3,502 words) [view diff] exact match in snippet view article find links to article

]rkt$" path) (printf "source file: ~a\n" path))) The next example uses a hash table to record previously seen lines and print only unique ones. #lang racket

H2 (database) (976 words) [view diff] exact match in snippet view article

disk-based tables. Tables can be persistent or temporary. Index types are hash table and tree for in-memory tables, and b-tree for disk-based tables. All data

Java ConcurrentMap (3,133 words) [view diff] exact match in snippet view article find links to article

java.util.concurrent.ConcurrentMap. The mechanism is a hash access to a hash table with lists of entries, each entry holding a key, a value, the hash, and

Fringe search (856 words) [view diff] no match in snippet view article find links to article

lookup of a node in the list to be done in constant time. g is stored as a hash-table, and a last marker array is stored for constant-time lookup of whether

PowerPC (5,400 words) [view diff] exact match in snippet view article find links to article

with a different endianness. Accesses to the "inverted page table" (a hash table that functions as a TLB with off-chip storage) are always done in big-endian

Control plane (1,681 words) [view diff] exact match in snippet view article find links to article

is in the RIB. If the FIB is smaller than the RIB, and the FIB uses a hash table or other data structure that does not easily update, the existing FIB

List comprehension (2,556 words) [view diff] exact match in snippet view article find links to article

enumerate('ABCD') if val not in 'CB'} >>> s {0: 'A', 3: 'D'} >>> Racket hash table comprehensions generate Racket hash tables (one implementation of the

Ruby (programming language) (5,482 words) [view diff] exact match in snippet view article

to other new features. Ruby 2.4.0 includes performance improvements to hash table, Array#max, Array#min, and instance variable access. Other notable changes

Conway's Game of Life (6,227 words) [view diff] no match in snippet view article find links to article

live-coordinate array. The drawback is that counting live neighbours becomes a hash-table lookup or search operation, slowing down simulation speed. With more sophisticated

Rabin–Karp algorithm (1,976 words) [view diff] exact match in snippet view article find links to article

algorithm can find all k patterns in O(n+km) expected time, assuming that a hash table check works in O(1) expected time. % is 'mod' or modulo, or remainder

F Sharp (programming language) (4,082 words) [view diff] exact match in snippet view article

includes for loops while loops arrays, created with the [| ... |] syntax hash table, created with the dict [ ... ] syntax or System.Collections.Generic.Dictionary<_

BLAST (biotechnology) (4,974 words) [view diff] exact match in snippet view article

Popular approaches to parallelize BLAST include query distribution, hash table segmentation, computation parallelization, and database segmentation (partition)

Jumble (1,048 words) [view diff] exact match in snippet view article find links to article

alphabetical order, preserving duplicates Look up sorted letters in a hash table, initialised with a dictionary, that maps a sorted set of letters to unscrambled

Executable and Linkable Format (2,183 words) [view diff] exact match in snippet view article find links to article

table 0x4 SHT_RELA Relocation entries with addends 0x5 SHT_HASH Symbol hash table 0x6 SHT_DYNAMIC Dynamic linking information 0x7 SHT_NOTE Notes 0x8 SHT_NOBITS

Zero-based numbering (2,933 words) [view diff] exact match in snippet view article find links to article

Because of this, many formulas in algorithms (such as that for calculating hash table indices) can be elegantly expressed in code using the modulo operation

Time-of-check to time-of-use (1,376 words) [view diff] exact match in snippet view article find links to article

scheduling quantum inside a single system call traversing the kernel's hash table of cached file names. The attacker creates a very large number of files

Locality-sensitive hashing (4,024 words) [view diff] exact match in snippet view article find links to article

n non-zero entries, one can reduce the amount of memory used per each hash table to O ( n ) {\displaystyle O(n)} using standard hash functions. Given a

TBOX (381 words) [view diff] exact match in snippet view article find links to article

use-after-free # double-free, invalid free # memory leaks implements hash table, single list, double list, vector, stack, queue and min/max heap. supports

Pigeonhole principle (4,155 words) [view diff] exact match in snippet view article find links to article

a reference to their representative values (their "hash codes") in a "hash table" for fast recall. Typically, the number of unique objects in a data set

Naming convention (programming) (3,744 words) [view diff] no match in snippet view article

dashes to separate words in identifiers, as in with-open-file and make-hash-table. Dynamic variable names conventionally start and end with asterisks: *map-walls*

Schwartz–Zippel lemma (2,147 words) [view diff] exact match in snippet view article find links to article

small degree. Prime numbers are used in a number of applications such as hash table sizing, pseudorandom number generators and in key generation for cryptography

Burst buffer (1,538 words) [view diff] case mismatch in snippet view article find links to article

Light-Weight Reliable Persistent Dynamic Scalable Zero-Hop Distributed Hash Table". 2013 IEEE 27th International Symposium on Parallel and Distributed Processing

Quicksort (9,949 words) [view diff] exact match in snippet view article find links to article

with K in Θ(log N), as if K is smaller we can sort in O(N) time using a hash table or integer sorting. If K ≫ log N but elements are unique within O(log

Interval tree (3,577 words) [view diff] exact match in snippet view article find links to article

membership queries in expected constant time can be implemented with a hash table, updated in lockstep with the interval tree. This may not necessarily

Pseudoforest (4,054 words) [view diff] exact match in snippet view article find links to article

one can form a graph, the "cuckoo graph", whose vertices correspond to hash table locations and whose edges link the two locations at which one of the keys

Pseudoforest (4,054 words) [view diff] exact match in snippet view article find links to article

one can form a graph, the "cuckoo graph", whose vertices correspond to hash table locations and whose edges link the two locations at which one of the keys

SenseTalk (1,752 words) [view diff] exact match in snippet view article find links to article

of properties in a property list (SenseTalk’s name for a dictionary or hash table). Put {Name:"Green", HexCode:"#00FF00"} into AColor put aColor's name

List of women innovators and inventors by country (2,640 words) [view diff] exact match in snippet view article find links to article

2010s), drug delivery systems Sylvia Ratnasamy (born 1976), distributed hash table Sheila Sri Prakash (born 1955), prefabricated rotationally moulded inspection

Threaded code (3,996 words) [view diff] exact match in snippet view article find links to article

in which operations are identified by strings, usually looked up by a hash table. This was used in Charles H. Moore's earliest Forth implementations and

TRSDOS (3,793 words) [view diff] exact match in snippet view article find links to article

position in this table corresponds to a specific directory entry record. The hash table, being one sector in length, can index a maximum of 256 directory records

Multiple dispatch (5,854 words) [view diff] exact match in snippet view article find links to article

combination of techniques (compressed dispatch tables, collision free integer hash table) to implement method calls in constant time, while mitigating memory usage

RNA-Seq (11,110 words) [view diff] exact match in snippet view article find links to article

break reads into sequences of length k and collapse all k-mers into a hash table. Overlap graphs were used with Sanger sequencing, but do not scale well

CONFIG.SYS (7,088 words) [view diff] exact match in snippet view article find links to article

FASTOPEN (DR‑DOS 3.31 and higher and PTS-DOS only) Specified the size of the hash table for fast file open operations. Works considerably differently from the

Database encryption (3,212 words) [view diff] exact match in snippet view article find links to article

encryption is the fact that a malicious user could potentially use an Input to Hash table rainbow table for the specific hashing algorithm that the system uses

C Sharp syntax (10,518 words) [view diff] exact match in snippet view article find links to article

number corresponding to the value of the object to support the use of a hash table. GetType - Gets the Type of the current instance. ToString - Creates a

History of Ruby (2,283 words) [view diff] exact match in snippet view article find links to article

and dependency The 2.4 branch also includes performance improvements to hash table, Array#max, Array#min, and instance variable access. Ruby 2.5.0 was released