CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

Efficient Dynamic Index Structure for Natural Number Intensive Application

by Mayank Patel, Bhavesh Parmar, Yatrik Patel, Hiren Joshi
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 109 - Number 4
Year of Publication: 2015
Authors: Mayank Patel, Bhavesh Parmar, Yatrik Patel, Hiren Joshi
10.5120/19176-0650

Mayank Patel, Bhavesh Parmar, Yatrik Patel, Hiren Joshi . Efficient Dynamic Index Structure for Natural Number Intensive Application. International Journal of Computer Applications. 109, 4 ( January 2015), 13-20. DOI=10.5120/19176-0650

@article{ 10.5120/19176-0650,
author = { Mayank Patel, Bhavesh Parmar, Yatrik Patel, Hiren Joshi },
title = { Efficient Dynamic Index Structure for Natural Number Intensive Application },
journal = { International Journal of Computer Applications },
issue_date = { January 2015 },
volume = { 109 },
number = { 4 },
month = { January },
year = { 2015 },
issn = { 0975-8887 },
pages = { 13-20 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume109/number4/19176-0650/ },
doi = { 10.5120/19176-0650 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:45:12.008804+05:30
%A Mayank Patel
%A Bhavesh Parmar
%A Yatrik Patel
%A Hiren Joshi
%T Efficient Dynamic Index Structure for Natural Number Intensive Application
%J International Journal of Computer Applications
%@ 0975-8887
%V 109
%N 4
%P 13-20
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Wide range of indexing techniques exists in the world of relational database. Speed of data insertion & retrieval depends on the type of query and available Indexing mechanism. Prevalent mechanisms lack in terms of space-time efficiency and simple structure, for real time applications where the database system needs to handle queries like equality search & range search. Even for simple tasks like getting data by ID, a system imposes heavy resource utilization. For example, Applications such as, telephone directory, transaction information details in banking, status about railway reservation etc. , backed with relational database system that employs complex structure like B-Tree or B+-Tree. Hence in such cases, instead of those complex structures, if some lighter technique can be used, which can greatly enhance the overall performance in terms of memory usage and simpler in terms of working & implementation. The paper presents how the Proposed Technique can significantly impact the overall performance, if applied as Primary Indexing method for range search & equality search queries.

References
  1. Ramakrishnan, R. , and J. Gehrke. "Database Management Systems. " (2003). .
  2. Silberschatz, Abraham, H. Korth, and S. Sudarshan. "Database System Concepts", 2010.
  3. Pachev, Alexander, and Sasha Pachev. Understanding MySQL Internals. " O'Reilly Media, Inc. ", 2007.
  4. Graefe, Goetz, and Harumi Kuno. "Modern B-tree techniques. " In Data Engineering (ICDE), 2011 IEEE 27th International Conference on, pp. 1370-1373. IEEE, 2011.
  5. Knuth, D. E. "The art of computer programming: Sorting and Searching, 2nd edn. , vol. 3. " (1998).
  6. Ashok Rathi, Huizhu Lu, G. E. Hedrick, "Performance Comparison Of Extendible Hashing And Linear Hashing Techniques", 1990
  7. Zobel, Justin, Steffen Heinz, and Hugh E. Williams. "In-memory hash tables for accumulating text vocabularies. " Information Processing Letters 80, no. 6 (2001): 271-277.
  8. Askitis, Nikolas, and Justin Zobel. "Cache-conscious collision resolution in string hash tables. " In String Processing and Information Retrieval, pp. 91-102. Springer Berlin Heidelberg, 2005.
  9. Heileman, Gregory L. , and Wenbin Luo. "How Caching Affects Hashing. " In ALENEX/ANALCO, pp. 141-154. 2005.
  10. Peterson, W. W. (1957), 'Open addressing', IBM Journalof Research and Development 1(2), 130–146.
  11. Askitis, Nikolas. "Efficient data structures for cache architectures. " PhD diss. , PhD thesis, RMIT University. RMIT Technical Report TR-08-5. http://www. cs. rmit. edu. au/naskitis, 2007.
  12. Stein, Clifford, T. Cormen, R. Rivest, and C. Leiserson. "Introduction to algorithms. " The MIT Press 31 (2001): 77.
  13. Pagh, Rasmus, and Flemming Friche Rodler. "Cuckoo hashing. " Journal of Algorithms 51, no. 2 (2004): 122-144.
  14. Dietzfelbinger, Martin, Michael Mitzenmacher, and Michael Rink. "Cuckoo hashing with pages. " In Algorithms–ESA 2011, pp. 615-627. Springer Berlin Heidelberg, 2011.
  15. Fountoulakis, Nikolaos, Konstantinos Panagiotou, and Angelika Steger. "On the insertion time of cuckoo hashing. " SIAM Journal on Computing 42, no. 6 (2013): 2156-2181.
  16. Jang, Joonhyouk, Yookun Cho, Jinman Jung, and Gwangil Jeon. "Enhancing lookup performance of key-value stores using cuckoo hashing. " In Proceedings of the 2013 Research in Adaptive and Convergent Systems, pp. 487-489. ACM, 2013.
  17. Drmota, Michael, and Reinhard Kutzelnigg. "A precise analysis of cuckoo hashing. " ACM Transactions on Algorithms (TALG) 8, no. 2 (2012): 11.
  18. Askitis, Nikolas. "Fast and compact hash tables for integer keys. " In Proceedings of the Thirty-Second Australasian Conference on Computer Science-Volume 91, pp. 113-122. Australian Computer Society, Inc. , 2009.
  19. Bayer, Rudolf. "The universal B-tree for multidimensional indexing: General concepts. " In Worldwide Computing and Its Applications, pp. 198-209. Springer Berlin Heidelberg, 1997.
  20. Bumbulis, Peter. "System and methodology for providing compact B-Tree. " U. S. Patent 6,694,323, issued February 17, 2004.
  21. Grant Fritchey and Sajal Dam, "SQL Server 2008 Query Performance Tuning Distilled", Apress 2009.
  22. Sartaj Sahani,Dinesh P Mehta,"Tries" in Handbook of datastructures & Applications, Chapman & Hall/CRC, US 2005.
  23. Stefan Björnson, "Management in data structures", EP1040430 B1, July 3 2009.
  24. "Oracle® Database, Performance Tuning Guide," 12c Release 1 (12. 1), accessed February 20, 2014. http://docs. oracle. com/cd/E16655_01/server. 121/e15857/title. htm
  25. "MySQL 5. 6 Reference Manual", Accessed February 22, 2014. https://dev. mysql. com/doc/refman/5. 5/en/optimization-indexes. html
  26. B+-Tree code, version 1. 12, http://www. amittai. com/
  27. B-Tree code, http://www. geeksforgeeks. org/b-tree-set-1-insert-2/
  28. Introduction to Algorithms 3rd Edition by Clifford Stein, Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest.
  29. S. Sen and R. E. Tarjan, "Deletion without rebalancing in multiway search trees," ISAAC, pp. 832–841, 2009
Index Terms

Computer Science
Information Sciences

Keywords

Natural numbers Dynamic index structure Indexing Database management system.

Powered by PhDFocusTM