A Study on Performance Analysis of Data Structures

Authors(1) :-Anne Srijanya. K

The Need for Data Structures is to organize data more efficaciously for complex applications. Many data structures exist but we need to select the confiscated data structure to meet the solution. A survey has been carried out on different types of data structures to identify their qualities and demarcations. This paper describes prominent data structures in a consistent manner to provide a concise comparison on performance of data structures. This paper presents a brief study on performance, time complexity and applications of data structures. This paper classifies data structures into seven categories that group them according to their time complexity.

Authors and Affiliations

Anne Srijanya. K
Assistant Professor, CMR Engineering College, Hyderabad, Telangana, India

Data Structure, Time Complexity, Performance

  1. Dr. N. Kashivishwanath "Data Structure Using C++", Laxmi publications
  2. Data structure tutorial online], Available"http://searchsqlserver.techtarget.com/definition/data-structure".
  3. Stack tutorial online] available "http://www.cprogramming.com/tutorial/computersciencetheory/stack.html"
  4. Sartaj Sahni, "Data structures, Algorithms and Applications in C++".
  5. Gopal, Arpita. "Magnifying Data Structures" PHI.
  6. Donald Knuth. "The Art of Computer Programming",Volume1: Fundamental Algorithms, Third Edition. Addison-Wesley, 1997. Stacks, Queues, and Deques, Binary Trees.
  7. "Definition of a linked list". National Institute of Standards and Technology. 2004-08-16. Retrieved 2004-12-14.
  8. Parlante, Nick (2001). "Linked list basics". Stanford University. Retrieved 2009-09-21.
  9. Goodrich, Michael T.; Tamassia, Roberto (2004). "7.3.6. Bottom-Up Heap Construction". Data Structures and Algorithms in Java (3rd ed.). pp. 338–341
  10. Atkinson, M.D., J.-R. Sack, N. Santoro, and T. Strothotte. "Min-max heaps and generalized priority queues." Programming techniques and Data structures.
  11. Comer, Douglas (June 1979), "The Ubiquitous B-Tree", Computing Surveys 11 (2): 12137.
  12. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. "Introduction to Algorithms", MIT Press and McGraw-Hill, Chapter 18: B-Trees, Chapter 13: Red–Black Trees Chapter 20: Fibonacci Heaps
  13. Grama, Ananth (2004). "(2,4) Trees". CS251: Data Structures Lecture Notes. Department of Computer Science, Purdue University.
  14. Ramakrishnan, R. and Gehrke, J. "Database Management Systems", McGraw-Hill Higher Education (2002), 3rd edition.
  15. San Diego State University: CS 660: Red–Black tree notes, by Roger Whitne
  16. Sleator, Daniel D.; Tarjan, Robert E. (1985), "Self-Adjusting Binary Search Trees", Journal of the ACM.

Publication Details

Published in : Volume 3 | Issue 6 | July-August 2018
Date of Publication : 2018-07-30
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 409-414
Manuscript Number : CSEIT183676
Publisher : Technoscience Academy

ISSN : 2456-3307

Cite This Article :

Anne Srijanya. K, "A Study on Performance Analysis of Data Structures", International Journal of Scientific Research in Computer Science, Engineering and Information Technology (IJSRCSEIT), ISSN : 2456-3307, Volume 3, Issue 6, pp.409-414, July-August-2018.
Journal URL : http://ijsrcseit.com/CSEIT183676

Article Preview

Follow Us

Contact Us