An Efficient Two-Level-Partitioning-Based Double Array and Its Parallelization
An Efficient Two-Level-Partitioning-Based Double Array and Its Parallelization
About this item
Full title
Author / Creator
Publisher
Basel: MDPI AG
Journal title
Language
English
Formats
Publication information
Publisher
Basel: MDPI AG
Subjects
More information
Scope and Contents
Contents
Trie is one of the most common data structures for string storage and retrieval. As a fast and efficient implementation of trie, double array (DA) can effectively compress strings to reduce storage spaces. However, this method suffers from the problem of low index construction efficiency. To address this problem, we design a two-level partition (TL...
Alternative Titles
Full title
An Efficient Two-Level-Partitioning-Based Double Array and Its Parallelization
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_doaj_primary_oai_doaj_org_article_6d3384fa051342e7891bb7488d3d68aa
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_doaj_primary_oai_doaj_org_article_6d3384fa051342e7891bb7488d3d68aa
Other Identifiers
ISSN
2076-3417
E-ISSN
2076-3417
DOI
10.3390/app10155266
