Results 21 to 30 of about 165 (120)
Do We Really Need to Balance Patricia Tries?
, 1987 In this paper, we give exact and asymptotic approximations for variance of the external path length in a symmetric Patricia trie. The problem was open up to now.
Wojciech Szpankowski +5 more
core
Geohash-Based Rapid Query Method of Regional Transactions in Blockchain for Internet of Vehicles. [PDF]
Sensors (Basel), 2022 Zhou C, Lu H, Xiang Y, Wu J, Wang F.
europepmc +1 more source
k-d range search with binary patricia tries
, 2004 We use Patricia tries to represent textual and spatial data, and present a range search algorithm for reporting all k-d records from a set of size n intersecting a query rectangle. Data and queries include both textual and spatial data.
Qingxiu Shi, Bradford G. Nickerson
core
, 2010 The difference between ordinary tries and Patricia tries lies in the fact that all unary nodes are removed in the latter. Their average number is thus easily determined from earlier results on the size of tries/Patricia tries.
Wagner, Stephan
core +1 more source
Grateful Workers, Satisfied Workers? A Portuguese Study about Organizational Happiness during COVID-19 Quarantine. [PDF]
Behav Sci (Basel), 2023 Ataíde I +5 more
europepmc +1 more source
Do we really need to balance Patricia tries? (Extended Abstract)
, 2008 In this paper, we give exact and asymptotic approximations for the variance of the external path length in a symmetric Patricia trie. The problem was open up to now. We prove that for the binary Patricia trie, the variance is asymptotically equal to 0.37.
Wojciech Szpankowski +2 more
core
Using Ethereum Smart Contracts to Store and Share COVID-19 Patient Data. [PDF]
Cureus, 2022 Batchu S +8 more
europepmc +1 more source
, 2015 Digital trees are data structures that represent sets of strings according to their shared prefix structure. In the most fundamental of such trees, a trie, each string in the set is represented by a sequence of edges, each representing a single letter ...
Magner, Abram, Magner, Abram N
core
Fast as a shadow, expressive as a tree: Optimized memory monitoring for C
, 2016 International audienceOne classical approach to ensuring memory safety of C programs is based on storing block metadata in a tree-like datastructure. However it becomes relatively slow when the number of memory locations in the tree becomes high. Another
Signoles, J. +2 more
core +1 more source
Data structure set-trie for storing and querying sets: Theoretical and empirical analysis. [PDF]
PLoS One, 2021 Savnik I +3 more
europepmc +1 more source