Abstract
In chapter 5 we looked at general implementations of the ADT set. As we noticed, not all the set operations could be implemented efficiently using a single data structure. However, many applications using sets require only a limited number of set operations. Such a special knowledge as to how the set is to be used enables us to design specialised data structures to achieve greater efficiency. In this chapter we will study four such restricted set data types with specialised data structures.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliographic Notes and Further Reading
Aho, A. V., Hopcroft, J. E. and Ullman, J. D. (1983). Data Structures and Algorithms, Addison-Wesley, Reading, Massachusetts.
Azmoodeh, M. (1981). ‘A modelling schema for a hardware information processor’, MSc Thesis, University of Manchester.
Azmoodeh, M., Lavington, S. H. and Standring, M. (1984). ‘The semantic binary relationship model of information’, Proc. of the Third Symposium on Research and Development in Information Retrieval, edited by C. J. van Rijsbergen, pp. 133–152.
Baron, R. J. and Shapiro, L. G. (1980). Data Structures and their Implementation, PWS Publications, Boston, Massachusetts.
Bell, J. R. (1970). ‘The quadratic quotient method: a hash code eliminating secondary clustering’, CACM, Vol. 13, No. 2, February, pp. 107–109.
Bentley, J. L. (1975). ‘Multidimensional binary search trees for associative searching’, CACM, Vol. 18, No. 9, pp. 509–517.
Bentley, J. L. and Friedman, J. H. (1979). ‘Data structures for range searching’, ACM Computing Surveys, Vol. 11, No. 4, December, pp. 397–409.
Date, C. J. (1985). Introduction to Database Systems, Vol 1, 4th edition, Addison-Wesley, Reading, Massachusetts.
Fagin, R. et al. (1979), ‘Extendable hashing: a fast access method for dynamic files’, ACM Transaction on Databases, No. 4.
Gotlieb, C. C. and Gotlieb, L. R. (1978). Data Types and Data Structures, Prentice-Hall, Englewood Cliffs, New Jersey.
Jones, D. W. (1986). ‘An empirical comparison of priority queues and event-set implementations’, CACM, Vol. 29, No. 4, April, pp. 300–311.
Knuth, D. E. (1972). The Art of Computer Programming. Volume 3: Sorting and Searching, Addison-Wesley, Reading, Massachusetts.
Knuth, D. E. (1973). The Art of Computer Programming. Volume 1: Fundamental Algorithms, 2nd edition, Addison-Wesley, Reading, Massachusetts.
Larson, P. (1978). ‘Dynamic hashing’, BIT, Vol. 18, pp. 184–201.
Lister, A. M. (1984). Fundamentals of Operating Systems, 3rd edition, Macmillan, London.
Martin, J. J. (1986). Data Types and Data Structures, Prentice-Hall, Englewood Cliffs, New Jersey.
Peterson, J. L. and Silberschatz, A. (1985). Operating System Concepts, 2nd edition, Addison-Wesley, Reading, Massachusetts.
Shipman, D. W. (1981). ‘The functional data model and the language DAPLEX’, ACM TODS, Vol. 6, No. 1, March.
Stubbs, D. and Webre, N. (1985). Data Structures with Abstract Data Types and Pascal, Brooks/Cole Publishing, Monterey, California.
Author information
Authors and Affiliations
Copyright information
© 1990 Manoochehr Azmoodeh
About this chapter
Cite this chapter
Azmoodeh, M. (1990). Abstract Data Type Sets—II. In: Abstract Data Types and Algorithms. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-21151-7_6
Download citation
DOI: https://doi.org/10.1007/978-1-349-21151-7_6
Publisher Name: Palgrave, London
Print ISBN: 978-0-333-51210-4
Online ISBN: 978-1-349-21151-7
eBook Packages: Computer ScienceComputer Science (R0)