Skip to main content
SpringerLink
Log in

On set equality-testing

  • Conference paper
  • First Online:
Algorithms and Complexity (CIAC 1994)

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

Included in the following conference series:

Abstract

This paper is concerned with data structures for representing an arbitrary number of sets of keys such that we can update the sets dynamically, query the membership of a set, and test whether two sets are equal. Such data structures have been studied intensively by a number of researchers [2, 6, 4, 5, 7]. Prior to our work, the best scheme supports set equalitytesting in constant time and the operations Insert, Delete, and Member each in O(log2 n) worst-case time. The solution in this paper improves the O(log2 n) time bound to O(log n log* n),† while maintaining the constant time complexity of set equality-testing.

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.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms, Ex 2.12, 71–71.

    Google Scholar 

  2. W. Pugh and T. Teitelbaum, Incremental Computation via Function Caching, Proceedings of the Sixteenth ACM Symposium on Principles of Programming Languages, 1989, 315–328.

    Google Scholar 

  3. J.T. Schwartz, On Programming: An Interim Report on the SETL Project, Installments I and II, CIMS New York University, 1974.

    Google Scholar 

  4. M. Sassa and E. Goto, A Hashing Method for Set Operations, Information Processing Letters, 5, 1976, 265–279.

    Google Scholar 

  5. R. Sundar and R.E. Tarjan, Unique Binary Search Tree Representations and Equality-testing of Sets and Sequences, Proceedings of the Twentysecond Annual ACM Symposium on Theory of Computing, 1990, 18–25.

    Google Scholar 

  6. M.N. Wegman and J.L. Carter, New Hash Functions and Their Use in Authentication and Set Equality, Journal of Computer and System Sciences, 22, 1981, 265–279.

    Google Scholar 

  7. D.M. Yellin, Representing Sets with Constant Time Equality Testing, Journal of Algorithms, 13, 1992, 353–373; a preliminary version also appeared in the Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990, 64–73.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Hong Kong, Pokfulam Road, Hong Kong

    Tak Wah Lam & Ka Hing Lee

Authors
  1. Tak Wah Lam
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ka Hing Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. Bonuccelli P. Crescenzi R. Petreschi

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lam, T.W., Lee, K.H. (1994). On set equality-testing. In: Bonuccelli, M., Crescenzi, P., Petreschi, R. (eds) Algorithms and Complexity. CIAC 1994. Lecture Notes in Computer Science, vol 778. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57811-0_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-57811-0_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57811-6

  • Online ISBN: 978-3-540-48337-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation