2019
DOI: 10.1007/s12626-019-00045-1
|View full text |Cite
|
Sign up to set email alerts
|

Application-Oriented Succinct Data Structures for Big Data

Abstract: A data structure is called succinct if its asymptotical space requirement matches the original data size. The development of succinct data structures is an important factor to deal with the explosively increasing big data. Moreover, wider variations of big data have been produced in various fields recently and there is a substantial need for the development of more application-specific succinct data structures. In this study, we review the recently proposed application-oriented succinct data structures motivat… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 74 publications
0
1
0
Order By: Relevance
“…One thing to note is that KARGAMobile uses an in-memory database which is loaded at each program execution, without any data transforms or succinct structures, e.g., integer hashing of strings, Burrows-Wheeler transform, or FM-index ( Shibuya, 2019 ). ARGs are several orders of magnitude smaller in size than bacterial genes and genomes.…”
Section: Methodsmentioning
confidence: 99%
“…One thing to note is that KARGAMobile uses an in-memory database which is loaded at each program execution, without any data transforms or succinct structures, e.g., integer hashing of strings, Burrows-Wheeler transform, or FM-index ( Shibuya, 2019 ). ARGs are several orders of magnitude smaller in size than bacterial genes and genomes.…”
Section: Methodsmentioning
confidence: 99%