Succinct data structure for dynamic trees with faster queries

Dekel Tsur

doi:10.1016/j.tcs.2019.02.005

Succinct data structure for dynamic trees with faster queries

Dekel Tsur

Research output: Contribution to journal › Article › peer-review

Abstract

Navarro and Sadakane [19] gave a dynamic succinct data structure for storing an ordinal tree. The structure supports tree queries in either O(log⁡n/log⁡log⁡n) or O(log⁡n) time, and insertion or deletion of a single node in O(log⁡n) time. In this paper we improve the result of Navarro and Sadakane by reducing the time complexities of some queries (e.g. degree and level_ancestor) from O(log⁡n) to O(log⁡n/log⁡log⁡n).

Original language	English
Pages (from-to)	12-19
Number of pages	8
Journal	Theoretical Computer Science
Volume	780
DOIs	https://doi.org/10.1016/j.tcs.2019.02.005
State	Published - 9 Aug 2019

Keywords

Ordinal trees
Succinct data structures

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1016/j.tcs.2019.02.005

Cite this

@article{ec6c36167f9344b7b9b12eb175f3de12,

title = "Succinct data structure for dynamic trees with faster queries",

abstract = "Navarro and Sadakane [19] gave a dynamic succinct data structure for storing an ordinal tree. The structure supports tree queries in either O(log⁡n/log⁡log⁡n) or O(log⁡n) time, and insertion or deletion of a single node in O(log⁡n) time. In this paper we improve the result of Navarro and Sadakane by reducing the time complexities of some queries (e.g. degree and level\_ancestor) from O(log⁡n) to O(log⁡n/log⁡log⁡n).",

keywords = "Ordinal trees, Succinct data structures",

author = "Dekel Tsur",

note = "Publisher Copyright: {\textcopyright} 2019 Elsevier B.V.",

year = "2019",

month = aug,

day = "9",

doi = "10.1016/j.tcs.2019.02.005",

language = "English",

volume = "780",

pages = "12--19",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Succinct data structure for dynamic trees with faster queries

AU - Tsur, Dekel

PY - 2019/8/9

Y1 - 2019/8/9

N2 - Navarro and Sadakane [19] gave a dynamic succinct data structure for storing an ordinal tree. The structure supports tree queries in either O(log⁡n/log⁡log⁡n) or O(log⁡n) time, and insertion or deletion of a single node in O(log⁡n) time. In this paper we improve the result of Navarro and Sadakane by reducing the time complexities of some queries (e.g. degree and level_ancestor) from O(log⁡n) to O(log⁡n/log⁡log⁡n).

AB - Navarro and Sadakane [19] gave a dynamic succinct data structure for storing an ordinal tree. The structure supports tree queries in either O(log⁡n/log⁡log⁡n) or O(log⁡n) time, and insertion or deletion of a single node in O(log⁡n) time. In this paper we improve the result of Navarro and Sadakane by reducing the time complexities of some queries (e.g. degree and level_ancestor) from O(log⁡n) to O(log⁡n/log⁡log⁡n).

KW - Ordinal trees

KW - Succinct data structures

UR - https://www.scopus.com/pages/publications/85061307823

U2 - 10.1016/j.tcs.2019.02.005

DO - 10.1016/j.tcs.2019.02.005

M3 - Article

SN - 0304-3975

VL - 780

SP - 12

EP - 19

JO - Theoretical Computer Science

JF - Theoretical Computer Science

ER -

Succinct data structure for dynamic trees with faster queries

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this