A short Survey of Advantages and Applications of Skip Graphs
Shalini Batra1, Amritpal Singh2
1Dr. Shalini Batra, M.E. Degree from BITS, Pilani, Rajasthan India and PHD. Degree from Thapar University. Computer Science Department at Thapar University, Punjab, India.
2Amritpal Singh, Chandigarh University Gharuan . Machine Learning and Big Data. Received M.E. Degree from Thapar University, Punjab, India.
Manuscript received on October 20, 2013. | Revised Manuscript received on November 01, 2013. | Manuscript published on November 05, 2013. | PP: 75-78 | Volume-3 Issue-5, November 2013. | Retrieval Number: E1898113513/2013©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Although the enormous growth of Internet, Social Network, Cloud Computing, etc. has brought the world closer and faster, major concern for computer experts is how to store such enormous amount of data especially in form of graphs. Further, data structure used for storage of such type of data should provide efficient format for fast retrieval of data as and when required. Although adjacency matrix is an effective technique to represent a graph having few or large number of nodes and vertices but when it comes to analysis of huge amount of data from site likes like face book or twitter, adjacency matrix cannot do this. This paper provides a special kind of data structure, skip graph which can be efficiently used for storing such type of data resulting in optimal storage, space utilization and retrieval.
Keywords: Advanced Data Structure, Skip List, Skip Graph, Efficient and fast search.