Hostname: page-component-8448b6f56d-mp689 Total loading time: 0 Render date: 2024-04-19T19:12:51.392Z Has data issue: false hasContentIssue false
  • English
  • Français

More on balanced diets

Part of: JFP Research Articles

Published online by Cambridge University Press:  07 January 2011

OLIVER FRIEDMANN  and
MARTIN LANGE
OLIVER FRIEDMANN
Affiliation:
Department of Computer Science, University of Munich, Germany (e-mail: Oliver.Friedmann@gmail.com)
MARTIN LANGE
Affiliation:
Department of Electrical Engineering and Computer Science, University of Kassel, Germany (e-mail: Martin.Lange@uni-kassel.de)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Discrete Interval Encoding Trees are data structures for the representation of fat, i.e. densely populated sets over a discrete linear order. In this paper, we introduce algorithms for set-theoretic operations like intersection, union, etc. on sets represented as balanced diets. We empirically analyse their performance and show that these algorithms can outperform previously known algorithms on sets, such as the ones implemented in OCaml's standard library.

Type
Articles
Information
Journal of Functional Programming , Volume 21 , Issue 2 , March 2011 , pp. 135 - 157
Copyright
Copyright © Cambridge University Press 2011

References

Adams, S. (1993) Efficient sets—A balancing act, J. Funct. Program., 3 (4), 553–561.Google Scholar
Adelson-Velskii, G. & Landis, E. M. (1962) An algorithm for the organization of information. Proc. USSR Acad. Sci., 146, 263–266.Google Scholar
Bayer, R. (1972) Symmetric binary B-trees: Data structure and maintenance algorithms, Acta Inform., 1, 290–306.Google Scholar
Cormen, T. H., Leiserson, C. E. & Rivest, R. L. (1992) Introduction to Algorithms. 6th ed., MIT and McGraw-Hill Book Company.Google Scholar
Erwig, M. (1998) Functional pearls: Diets for fat sets, J. Funct. Program., 8 (6), 627–632.CrossRefGoogle Scholar
Filliâtre, J.-C. (2008) Patricia Set. Available at: http://www.lri.fr/~filliatr/software.en.html.Google Scholar
Friedmann, O. & Lange, M. (2010) Camldiets. Available at: http://www2.tcs.ifi.lmu.de/camldiets.Google Scholar
Guibas, L. J. & Sedgewick, R. (1978) A dichromatic framework for balanced trees. In 9th Ann. Symp. on Foundations of Computer Science, FOCS'78. IEEE, pp. 8–21.Google Scholar
Gwehenberger, G. (1968) Anwendung einer binären verweiskettenmethode beim aufbau von listen, Elektron. Rechenanl., 10 (5), 223–226.Google Scholar
Hinze, R. (1999) Constructing red-black trees. In Proceedings of Workshop on Algorithmic Aspects of Advanced Programming Languages, pp. 89–99.Google Scholar
Leroy, X. (2010) Ocaml Set. Available at: http://caml.inria.fr/pub/docs/manual-ocaml/libref.Google Scholar
Morrison, D. R. (1968) PATRICIA: Practical algorithm to retrieve information coded in alphanumeric, J. acm, 15 (4), 514–534.CrossRefGoogle Scholar
Ohnishi, S., Tasaka, H. & Tamura, N. (2003) Efficient representation of discrete sets for constraint programming. In Proc. 9th Int. Conf. on Principles and Practice of Constraint Programming, CP'03. LNCS, vol. 2833. Springer, pp. 920–924.Google Scholar
Yoriyuki, Y. (2003) Camomile set. Available at: http://camomile.sourceforge.net.Google Scholar
Submit a response

Discussions

No Discussions have been published for this article.