Results 21 to 30 of about 165 (120)
Profiles of Patricia Tries [PDF]
, 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 +1 more source
Fast as a shadow, expressive as a tree: Optimized memory monitoring for C [PDF]
, 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
Compact Suffix Trees Resemble PATRICIA Tries: Limiting Distribution of the Depth [PDF]
, 2008 . Suffix trees are the most frequently used data structures in algorithms on words. In this paper, we consider the depth of a compact suffix tree, also known as the PAT tree, under some simple probabilistic assumptions. For a biased memoryless source, we
Wojciech Szpankowski, Bonita Mcvey
core
Fast as a shadow, expressive as a tree: Hybrid memory monitoring for C. [PDF]
, 2015 Conference of 30th Annual ACM Symposium on Applied Computing, SAC 2015 ; Conference Date: 13 April 2015 Through 17 April 2015; Conference Code:117701International audienceOne classical approach to ensuring memory safety of C programs is based on storing ...
Signoles, J. +5 more
core +1 more source
Compact Suffix Trees Resemble Patricia Tries: Limiting Distribution of Depth [PDF]
, 1992 Projet ICSLASuffix trees are the most frequently used data structure in algorithms on words. Despite this, little is known about their behavior in a probabilistic framework. In this paper, we consider the depth of a compact suffix tree, also known as the
Rais, Bonita +4 more
core +1 more source
Compact suffix trees resemble PATRICIA tries : limiting distribution of depth [PDF]
, 1993 Projet ICSLASuffix trees are the most frequently used data structure in algorithms on words. Despite this, little is known about their behavior in a probabilistic framework. In this paper, we consider the depth of a compact suffix tree, also known as the
Jacquet, Philippe +2 more
core
Impelementasi Struktur Data Patricia Tree pada Autocomplete Seacrh Box [PDF]
, 2011 ABSTRAKSI: Autocomplete pada search box berhubungan dengan data yang begitu besar. Sehingga ketika dilakukan pencarian frase/kata pada database terdapat kendala, dimana ketika semua frase harus ditelusuri untuk mendapatkan hasil dan terdapat hubungan ...
Zusni Adisya
core
Compressed string dictionaries via Rear coding and succinct Patricia Trie [PDF]
In this thesis, we will illustrate a two-level approach to compress and index string dictionaries, which are a crucial component of many software platforms for big data applications.
ROTUNDO, MARIAGIOVANNA
core
Optimizing Frequency Queries for Data Mining Applications [PDF]
, 2007 Data mining algorithms use various Trie and bitmap-based representations to optimize the support (i.e., frequency) counting performance. In this paper, we compare the memory requirements and support counting performance of FP Tree, and Compressed ...
Malik, Hassan H., Kender, John R.
core +2 more sources
Distributed true string B-tree peer-to-peer overlay networks [PDF]
, 2006 A fundamental problem that confronts P2P Internet applications is to efficiently locate the physical (IP) node that stores a particular data item. To tackle this application-level routing problem, this thesis proposes a new P2P overlay network, called ...
Wu, Li
core +3 more sources