Dynamic Compressed Data Structures

A special issue of Algorithms (ISSN 1999-4893).

Deadline for manuscript submissions: closed (31 January 2022) | Viewed by 332

Special Issue Editors


E-Mail Website
Guest Editor
Department of Environmental Sciences, Informatics and Statistics, Ca' Foscari University of Venice, 30123 Venezia VE, Italy
Interests: data structures; algorithms; data compression; bioinformatics
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
Department of Computer Science, Florida State University, Tallahassee, FL 32303, USA
Interests: combinatorial optimization; submodular optimization; machine learning

Special Issue Information

Dear Colleagues,

In the last two decades, the field of compressed data structures has generated very powerful results including but not limited to compressed indexes, compressed geometric data structures, and computation over compressed data. Such results have found fundamental applications in areas such as computational biology and information retrieval. Many of these results, however, involve static data structures, in the sense that any modification to the underlying data requires re-building the whole data structure. Dynamic compressed data structures (for example: dynamic integer sequences), on the other hand, add to this landscape the possibility of editing, as well as querying, compressed data with only a small (typically polylogarithmic) slow-down in edit/query times. Especially from the practical point of view, however, such dynamic data structures are much less mature than their static counterparts in that query times are typically orders of magnitude larger.

We invite you to submit your latest research on the topic to this Special Issue on dynamic compressed data structures. Potential topics include but are not limited to: computation over compressed data, succinct and compressed dynamic sequences, dictionaries, graphs, and geometric data structures, implementations and libraries, benchmarks of existing implemented compressed data structures, cache-efficient and/or external-memory dynamic compressed data structures, computation and update of compressibility measures under edit operations, and sensitivity of compressibility measures under edit operations. Surveys on the topic are also welcome.

Dr. Nicola Prezza
Dr. Alan Kuhnle
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • dynamic data structures
  • lossless compression
  • indexing

Published Papers

There is no accepted submissions to this special issue at this moment.
Back to TopTop