Representation transformations of ordered lists

Ásványi, Tibor (2015) Representation transformations of ordered lists Annales Mathematicae et Informaticae. 44. pp. 5-13. ISSN 1787-5021 (Print), 1787-6117 (Online)

pdf AMI_44_from5to13.pdf Download (707kB) [error in script]

Absztrakt (kivonat)

Search and update operations of dictionaries have been well studied, due to their practical significance. There are many different representations of them, and some applications prefer this, the others that representation. A main point is the size of the dictionary: for a small one a sorted array can be the best representation, while for a bigger one an AVL tree or a red-black tree might be the optimal choice (depending on the necessary operations and their frequencies), and for an extra large one we may prefer a B+-tree, for example. Consequently it can be desirable to transform such a collection of data from one representation into another, efficiently. There is a common feature of the data structures mentioned: they can be considered strictly ordered lists. Thus in this paper we start a new topic of interest: How to transform a strictly ordered list form one representation into another, efficiently? What about the time and space complexities of such transformations? Keywords: strictly increasing list, representation-transformation, data structure (DS), linear, array, binary tree (BT), balanced, search tree

Mű típusa:	Folyóiratcikk - Journal article
Szerző:	Szerző neve Email MTMT azonosító ORCID azonosító Közreműködés Ásványi, Tibor NEM RÉSZLETEZETT NEM RÉSZLETEZETT NEM RÉSZLETEZETT Szerző
Megjegyzés:	Selected papers of the 9th International Conference on Applied Informatics
Kapcsolódó URL-ek:	Folyóirat honlapja
Nyelv:	angol
Kötetszám:	44.
ISSN:	1787-5021 (Print), 1787-6117 (Online)
Felhasználó:	Tibor Gál
Dátum:	27 Feb 2019 18:19
Utolsó módosítás:	27 Feb 2019 18:19
URI:	http://publikacio.uni-eszterhazy.hu/id/eprint/2977

Műveletek (bejelentkezés szükséges)

Tétel nézet