We present a new data structure, DISCS, closely related to other well-known digital data structures: tries, Patricia tries and digital search trees. We compare the four of them from the point of view of search efficiency (internal path length, depth of insertion, key-bit inspection) and space (internal nodes, height). Completing some previous results, we derive asymptotic expressions for these parameters, notably for DISCS. We conclude by indications on the domain of application of these different data structures.
CITATION STYLE
Luccio, F., Régnier, M., & Schott, R. (1989). Discs and other related data structures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 382 LNCS, pp. 192–205). Springer Verlag. https://doi.org/10.1007/3-540-51542-9_17
Mendeley helps you to discover research relevant for your work.