{"doi":"10.3390/a16030170","title":"Multiset-Trie Data Structure","abstract":"<jats:p>This paper proposes a new data structure, multiset-trie, that is designed for storing and efficiently processing a set of multisets. Moreover, multiset-trie can operate on a set of sets without efficiency loss. The multiset-trie structure is a search tree with properties similar to those of a trie. It implements all standard search tree operations together with the multiset containment operations for searching sub-multisets and super-multisets. Suppose that we have a set of multisets S and a multiset X. The multiset containment operations retrieve multisets from S that are either sub-multisets or super-multisets of X. We present the mathematical analysis of a multiset-trie that gives the time complexity of the algorithms and the space complexity of the data structure. Further, the empirical analysis of the data structure is implemented in a series of experiments. The experiments illuminate the time complexity space of the multiset containment operations.</jats:p>","journal":"Algorithms","year":2023,"id":607447,"datarank":0.16479184330021646,"base_score":1.0986122886681096,"endowment":1.0986122886681096,"self_citation_contribution":0.16479184330021646,"citation_network_contribution":0.0,"self_endowment_contribution":0.16479184330021646,"citer_contribution":0.0,"corpus_percentile":null,"corpus_rank":null,"citation_count":2,"citer_count":0,"citers_with_citation_signal":0,"citers_with_endowment":0,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":134992,"name":"Iztok Savnik","orcid":null,"position":1,"is_corresponding":false},{"id":1559784,"name":"Matjaž Krnc","orcid":"0000-0002-4960-8901","position":2,"is_corresponding":false},{"id":1559785,"name":"Riste Škrekovski","orcid":null,"position":3,"is_corresponding":false},{"id":1559783,"name":"Mikita Akulich","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"resolved":true,"title":"Multiset-Trie Data Structure","abstract":"<jats:p>This paper proposes a new data structure, multiset-trie, that is designed for storing and efficiently processing a set of multisets. Moreover, multiset-trie can operate on a set of sets without efficiency loss. The multiset-trie structure is a search tree with properties similar to those of a trie. It implements all standard search tree operations together with the multiset containment operations for searching sub-multisets and super-multisets. Suppose that we have a set of multisets S and a multiset X. The multiset containment operations retrieve multisets from S that are either sub-multisets or super-multisets of X. We present the mathematical analysis of a multiset-trie that gives the time complexity of the algorithms and the space complexity of the data structure. Further, the empirical analysis of the data structure is implemented in a series of experiments. The experiments illuminate the time complexity space of the multiset containment operations.</jats:p>","is_dataset_classified":null,"base_score":1.0986122886681096,"endowment":1.0986122886681096,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"23304386","pmcid":null,"openalex_id":"https://openalex.org/W4328119206","authors":[],"funders":[{"funder_name":"Slovenian Research Agency","grant_id":"P1-0383","title":null}],"total_grants":1,"fwci":0.3949,"citation_percentile":0.61478374,"influential_citations":0,"citation_trend":[{"year":2024,"count":2}],"oa_status":"gold","license":"cc-by","oa_locations":[{"url":"https://www.mdpi.com/1999-4893/16/3/170/pdf?version=1679416430","host_type":"journal"},{"url":"https://www.mdpi.com/1999-4893/16/3/170/pdf?version=1679416430","host_type":"publisher"},{"url":"https://www.mdpi.com/1999-4893/16/3/170/pdf","host_type":"publisher"},{"url":"https://doi.org/10.3390/a16030170","host_type":"journal"},{"url":"https://doaj.org/article/334d3f72c63a44f5b7703b1bddfcfa2c","host_type":"repository"},{"url":"https://dx.doi.org/10.3390/a16030170","host_type":"repository"}],"fields_of_study":["Data Quality and Management","Data Management and Algorithms","Data Mining Algorithms and Applications"],"mesh_terms":[],"keywords":["Multiset","Trie","Tree (set theory)","Set (abstract data type)","Computer science","Theoretical computer science","Data structure","Mathematics","Discrete mathematics","Combinatorics"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-07-30T06:24:34.470652Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}