Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Practical Implementation of Space-Efficient Dynamic Keyword Dictionaries

From MaRDI portal
Publication:5150934
Jump to:navigation, search

DOI10.1007/978-3-319-67428-5_19zbMath1454.68031OpenAlexW2750614659MaRDI QIDQ5150934

Shunsuke Kanda, Masao Fuketa, Kazuhiro Morita

Publication date: 16 February 2021

Published in: String Processing and Information Retrieval (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-67428-5_19

zbMATH Keywords

triespath decompositioncompact data structureskeyword dictionaries


Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20) Algorithms on strings (68W32)


Related Items

Dynamic Path-decomposed Tries, Top tree compression of tries


Uses Software

  • UbiCrawler
  • LUBM
  • PATRICIA


Cites Work

  • Unnamed Item
  • Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing
  • Fast Compressed Tries through Path Decompositions
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5150934&oldid=19701705"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 16:01.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki