Skip to main content
SpringerLink
Log in

Discs and other related data structures

  • Conference paper
  • First Online:
Algorithms and Data Structures (WADS 1989)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 382))

Included in the following conference series:

  • 683 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. ”A Diffusion Limit for a Class of Randomly-Growing Binary Trees” in Probability Theory and Related Fields 79, 4 (1988) 509–542.

    Google Scholar 

  2. ”Algebraic Methods for Trie Statistics” in Annals of Discrete Mathematics 25 (1985) 145–188.

    Google Scholar 

  3. ”Some Uses of the Mellin Transform Techniques in the Analysis of Algorithms” in Combinatorial Algorithms on Words, Springer NATO ASI SEr. F12, (1985) 241–254.

    Google Scholar 

  4. ”Trie Partitioning Process:Limiting Distributions” in Proc. CAAP'86, Lecture Notes in Computer Science 214 (1986) 194–210.

    Google Scholar 

  5. ”Normal Limiting Distribution of the Size of Tries” in Proc.Performance '87, North-Holland, P.-J. Courtois and G. Latouche Ed., (1987) 209–223.

    Google Scholar 

  6. The Art of Computer Programming. Vol 3:Sorting and Searching, Addison-Wesley,Reading,Mass.,(1973)

    Google Scholar 

  7. ”On the Balance Property of Patricia Tries: External Path Length Viewpoint” to appear in TCS, (1989).

    Google Scholar 

  8. ”DISCS trees: a new data structure for DIgital Search by ComparisonS” in Dept. Inf. Syst. Comp. Sci., Nat. Univ. of Singapore, Res. Report TR11/86, (1986).

    Google Scholar 

  9. ”Algorithms” Addison-Wesley, Reading, Mass.,(1983).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universita di Pisa, 56100, Pisa, Italy

    Fabrizio Luccio

  2. INRIA-78, 153, Le Chesnay, France

    Mireille Régnier

  3. CRIN-54, 506, Vandoeuvre-les-Nancy, France

    René Schott

Authors
  1. Fabrizio Luccio
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mireille Régnier
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. René Schott
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

F. Dehne J. -R. Sack N. Santoro

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Luccio, F., Régnier, M., Schott, R. (1989). Discs and other related data structures. In: Dehne, F., Sack, J.R., Santoro, N. (eds) Algorithms and Data Structures. WADS 1989. Lecture Notes in Computer Science, vol 382. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51542-9_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-51542-9_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51542-5

  • Online ISBN: 978-3-540-48237-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation