Filters








4,826 Hits in 6.1 sec

Burst tries: a fast, efficient data structure for string keys

Steffen Heinz, Justin Zobel, Hugh E. Williams
2002 ACM Transactions on Information Systems  
We experimentally determine good choices of parameters, and compare burst tries to other structures used for the same task, with a variety of data sets.  ...  We propose a new data structure, the burst trie, that has significant advantages over existing options for such applications: it requires no more memory than a binary tree; it is as fast as a trie; and  ...  We thank Adam Cannane and Sam Kimberley, and the anonymous referees for their detailed comments.  ... 
doi:10.1145/506309.506312 fatcat:a7kwr2e6z5gnpfcton2nth3q74

B-tries for disk-based string management

Nikolas Askitis, Justin Zobel
2008 The VLDB journal  
The B-tree, and its variants, are an efficient general-purpose diskbased data structure that is almost universally used for this task.  ...  The B-trie has the potential to be a competitive alternative for the storage of data where strings are used as keys, but has not previously been thoroughly described or tested.  ...  Acknowledgments This work was supported by the Australian Postgraduate Award, a scholarship from the Australian Research Council and the School of Computer Science and Information Technology at RMIT University  ... 
doi:10.1007/s00778-008-0094-1 fatcat:622pixpq5rc5xm6h4vj63vudey

Cache-conscious sorting of large sets of strings with dynamic tries

Ranjan Sinha, Justin Zobel
2005 ACM Journal of Experimental Algorithmics  
We propose a new sorting algorithm for strings, burstsort, based on dynamic construction of a compact trie in which strings are kept in buckets. It is simple, fast, and efficient.  ...  These experiments show that, for large sets of strings, burstsort is almost twice as fast as any previous algorithm, due primarily to a lower rate of cache miss.  ...  Cache-friendly sorting with tries A recent development in data structures is the burst trie, which has been demonstrated to be the fastest structure for maintaining a dynamic set of strings in sort order  ... 
doi:10.1145/1005813.1041517 fatcat:xdyz5k3ib5ctplt3kfmpv7vzuq

Dynamic Path-Decomposed Tries [article]

Shunsuke Kanda, Dominik Köppl, Yasuo Tabei, Kazuhiro Morita, Masao Fuketa
2020 arXiv   pre-print
A keyword dictionary is an associative array whose keys are strings. Recent applications handling massive keyword dictionaries in main memory have a need for a space-efficient implementation.  ...  However, as most succinct data structures are only efficient in the static case, it is still difficult to implement a keyword dictionary that is space efficient and dynamic.  ...  A part of this work was supported by JSPS KAKENHI Grant Numbers 17J07555 and JP18F18120.  ... 
arXiv:1906.06015v2 fatcat:67ygdoxoizehdk7musue7dnzvq

Dynamic Packed Compact Tries Revisited [article]

Kazuya Tsuruta and Dominik Köppl and Shunsuke Kanda and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda
2019 arXiv   pre-print
Given a dynamic set K of k strings of total length n whose characters are drawn from an alphabet of size σ, a keyword dictionary is a data structure built on K that provides lookup, prefix search, and  ...  An exhaustive practical evaluation highlights the practical usefulness of the proposed data structure, especially for prefix searches - one of the most essential keyword dictionary operations.  ...  [21] looks theoretically appealing, but uses theoretically sophisticated data structures for which an efficient implementation looks cumbersome. 2 Keyword Dictionary c-trie+ + Focusing on fast prefix  ... 
arXiv:1904.07467v2 fatcat:7fic6poagbgshjtnxrlsiv2hji

Using Random Sampling to Build Approximate Tries for Efficient String Sorting [chapter]

Ranjan Sinha, Justin Zobel
2004 Lecture Notes in Computer Science  
In earlier work, we introduced burstsort, a new string sorting algorithm that on large sets of strings is almost twice as fast as previous algorithms, primarily because it is more cache-efficient.  ...  Algorithms for sorting large datasets can be made more efficient with careful use of memory hierarchies and reduction in the number of costly memory accesses.  ...  It is based on the burst trie data structure [7] , where a set of strings is organised as a collection of buckets indexed by a small access trie.  ... 
doi:10.1007/978-3-540-24838-5_39 fatcat:sqcmdaqk2ndfhjafng5zezr3ze

Using random sampling to build approximate tries for efficient string sorting

Ranjan Sinha, Justin Zobel
2005 ACM Journal of Experimental Algorithmics  
In earlier work, we introduced burstsort, a new string sorting algorithm that on large sets of strings is almost twice as fast as previous algorithms, primarily because it is more cache-efficient.  ...  Algorithms for sorting large datasets can be made more efficient with careful use of memory hierarchies and reduction in the number of costly memory accesses.  ...  It is based on the burst trie data structure [7] , where a set of strings is organised as a collection of buckets indexed by a small access trie.  ... 
doi:10.1145/1064546.1180622 fatcat:3iugqkl2srfrbbczm7faov43xq

Redesigning the string hash table, burst trie, and BST to exploit cache

Nikolas Askitis, Justin Zobel
2010 ACM Journal of Experimental Algorithmics  
The most efficient current data structures for this task are the hash table with move-to-front chains and the burst trie, both of which use linked lists as a substructure, and variants of binary search  ...  A key decision when developing in-memory computing applications is choice of a mechanism to store and retrieve strings.  ...  Cache-Conscious Burst Tries The standard chained burst trie is currently one of the fastest and most compact data structures available for vocabulary accumulation when sorted access to strings is required  ... 
doi:10.1145/1671970.1921704 fatcat:eimxbg3zvjcpfefwa7jr7wx76i

Starlight Beneath The Waves: In Search Of Tev Photon Emission From Gamma-Ray Bursts With The Antares Neutrino Telescope

Tri L. Astraatmadja, Maarten de Jong
2013 Zenodo  
The origin of cosmic rays is still a mystery as their paths are deflected by magnetic fields to random directions. The most likely sources of cosmic rays are Gamma-Ray Bursts (GRB).  ...  This dissertation focuses on ANTARES telescope operated as a gamma-ray telescope, which is possible by searching for downgoing muons produced from the interaction of gamma-rays with the Earth's atmosphere  ...  A single detector line (Figure 6 .6) consists of 25 floors (or 5 sectors) linked together by the EMC. The line is anchored to the seabed by a Bottom String Structure (BSS).  ... 
doi:10.5281/zenodo.48199 fatcat:a7rlqr7wu5cybfeebnw3tv4cn4

Self-Adjusting of Ternary Search Tries Using Conditional Rotations and Randomized Heuristics

G. H. Badr
2005 Computer journal  
A Ternary Search Trie (TST) is a highly efficient dynamic dictionary structure applicable for strings and textual data.  ...  The strings are accessed based on a set of access probabilities and are to be arranged using a TST. We consider the scenario where the probabilities are not known a priori, and is time-invariant.  ...  Tries are widely used for the efficient storage, matching and retrieval of strings over a given alphabet.  ... 
doi:10.1093/comjnl/bxh073 fatcat:pbkshuxuqvgo3bovrzwbgghop4

KCMBT: ak-mer Counter based on Multiple Burst Trees

Abdullah-Al Mamun, Soumitra Pal, Sanguthevar Rajasekaran
2016 Bioinformatics  
Very fast and efficient algorithms are necessary to count k-mers in large data sets to be useful in such applications.  ...  Results: We propose a novel trie-based algorithm for this k-mer counting problem.  ...  Burst tries A burst trie (Heinz et al., 2002; Sinha and Zobel, 2004 ) is a trie that can be used to store a set of strings efficiently in almost sorted order.  ... 
doi:10.1093/bioinformatics/btw345 pmid:27283950 pmcid:PMC5939891 fatcat:bxsnlxx775ddvawcusuevzsfgm

Fast and Lean Immutable Multi-Maps on the JVM based on Heterogeneous Hash-Array Mapped Tries [article]

Michael J. Steindorfer, Jurgen J. Vinju
2016 arXiv   pre-print
An immutable multi-map is a many-to-many thread-friendly map data structure with expected fast insert and lookup operations.  ...  In this paper we propose a general framework for Hash-Array Mapped Tries on the JVM which can store type-heterogeneous keys and values: a Heterogeneous Hash-Array Mapped Trie (HHAMT).  ...  To efficiently encode multi-maps we propose a generalisation of the CHAMP data structure to allow for heterogeneous data shapes.  ... 
arXiv:1608.01036v1 fatcat:xkpdkeuxgvdvjpaqn5ln6rs22e

Transcriptomic analysis of the trade-off between endurance and burst-performance in the frog Xenopus allofraseri

Valérie Ducret, Adam J. Richards, Mathieu Videlier, Thibault Scalvenzi, Karen A. Moore, Konrad Paszkiewicz, Camille Bonneaud, Nicolas Pollet, Anthony Herrel
2021 BMC Genomics  
Remarkably, we revealed transcript isoforms of key genes with functions in metabolism, apoptosis, nuclear export and as a transcriptional corepressor, expressed in either burst-performant or endurant individuals  ...  In this study we identify the genes, signaling pathways, and regulatory processes possibly responsible for the trade-off between burst performance and endurance observed in Xenopus allofraseri, using a  ...  We want to thank the Sequencing Service and Computational core facilities at the University of Exeter for producing quality RNA-seq data.  ... 
doi:10.1186/s12864-021-07517-1 pmid:33757428 fatcat:mb6lzlrfjbftnkmrvjcrqo6g3i

Surveillance on Manycasting Over Optical Burst Switching (OBS) Networks under Secure Sparse Regeneration

C.Veera lakshmi
2013 IOSR Journal of Electronics and Communication Engineering  
For continuous burst transmission lightpath should be regenerated before it loses the information due to lack of signal strength.  ...  In wavelength-routed WDM optical networks requires regeneration for few light paths, when the strength of optical signal reduced and also security and privacy are essential before Optical Burst Switching  ...  Also the author would like to thank reviewers for their valuable comments to improve the quality of the paper.  ... 
doi:10.9790/2834-0460108 fatcat:5qasfbq4n5cbpln42h3pa3cucq

MMS SITL Ground Loop: Automating the Burst Data Selection Process

Matthew R. Argall, Colin R. Small, Samantha Piatt, Liam Breen, Marek Petrik, Kim Kokkonen, Julie Barnum, Kristopher Larsen, Frederick D. Wilder, Mitsuo Oka, William R. Paterson, Roy B. Torbert (+4 others)
2020 Frontiers in Astronomy and Space Sciences  
Only low-resolution survey data is available to the SITL, which is insufficient to resolve electron dynamics. A strategy for the SITL, then, is to select all MP crossings.  ...  MMS employs automated burst triggers onboard the spacecraft and a Scientist-in-the-Loop (SITL) on the ground to select intervals likely to contain diffusion regions.  ...  Fast survey data from each instrument was subjected to a preliminary set of calibrations to produce SITL-quality data, which is suitable for making informed decisions about burst selections but not for  ... 
doi:10.3389/fspas.2020.00054 pmid:34712702 pmcid:PMC8549770 fatcat:33iwxvc3ejdvjddp3f4wekb2yq
« Previous Showing results 1 — 15 out of 4,826 results