On classic bubble sort performance for large data sets

• Autorzy: Marszałek Z. , Połap D. , Woźniak M.

Warianty tytułu

PL

O wydajności klasycznej wersji sortowania bąbelkowego dla dużych zbiorów danych

• Języki publikacji: EN

Abstrakty

EN

In the paper we discuss performance of classic bubble sort algorithm for large data sets. Research results discussed and described in this article help to evaluate computer methods used in NoSQL database systems for large amounts of the input data. Therefore we try to analyze one of the most common sorting algorithms and its properties for large data sets.

PL

Artykuł ma na celu przedstawienie analizy wydajności algorytmu sortowania bąbelkowego w postaci klasycznej dla dużych zbiorów danych. Podjęty temat ma duże znaczenie dla rozwoju współczesnej informatyki ze względu na to, że komputery muszą pracować na coraz większych ilościach danych.

Słowa kluczowe

EN

NoSQL; computer algorithm; large data set

PL

NoSQL; algorytm komputerowy; zbiór danych

• Wydawca: Wydawnictwo Politechniki Śląskiej
• Czasopismo: Zeszyty Naukowe. Matematyka Stosowana / Politechnika Śląska
• Rocznik: 2014
• Tom: z. 4
• Strony: 103--112
• Opis fizyczny: Bibliogr. 27 poz.

Twórcy

autor

Marszałek Z.

• Institute of Mathematics. Silesian University of Technology

autor

Połap D.

• Institute of Mathematics. Silesian University of Technology

autor

Woźniak M.

• Institute of Mathematics. Silesian University of Technology

Bibliografia

• 1. Aho I.A., Hopcroft J., Ullman J.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Indianapolis 1974.
• 2. Banachowski L., Diks K., Rytter W.: Algorithms and Data Structures. WNT, Warszawa 1996 (in Polish).
• 3. Bentley J.L., Stanat D.F., Steele J.M.: Analysis of a randomized data structure for representing ordered sets. In: Proceedings of the 19th Annual Allerton Conference on Communication, Control and Computing, University of Illinois, 364–372.
• 4. Brown M.R., Tarjan R.E.: Design and analysis of data structures for representing sorted lists. SIAM J. Comput. 9 (1980), 594–614.
• 5. Carlsson S., Chen J.: An optimal parallel adaptive sorting algorithm. Inform. Process. Lett. 39 (1991), 195–200.
• 6. Cook C.R., Kim. D.J.: Best sorting algorithms for nearly sorted lists. Comm. ACM 23 (1980), 620–624.
• 7. Dinsmore R.J.: Longer strings for sorting. Comm. ACM 8 (1965), 48–65.
• 8. Dlekmann R., Gehring J., Luling R., Monien B., Nubel M., Wanka R.: Sorting large data sets on a massively parallel system. In: Proceedings of the 6th IEEE Symposium on Parallel and Distributed Processing, Dallas 1994, 29–38.
• 9. Estivill-Castro E., Wood D.: A genetic adaptive sorting algorithms. Comput. J 35 (1992), 505–512.
• 10. Islam T., Lakshman K.B.: On the error sensitivity of sort algorithms. In: Proceedings of International Conference on Computing and Information, Toronto 1990, 81–85.
• 11. Knuth D.: The Art of Computer Programming, vol. 1–3. Addison-Wesley Professional, Indianapolis 2006.
• 12. Knuth D.E., Greene D.H.: Mathematics for the Analysis of Algorithms, Birkhauser, Boston 2007.
• 13. Levcopolos C., Petersson O.: A note on adaptive parallel sorting. Inform. Process. Lett. 33 (1985), 187–191.
• 14. Levcopolos C., Petersson O.: An optimal parallel algorithm for sorting presorted files. Lecture Notes in Comput. Sci. 338 (1988), 154–160.
• 15. Levcopolos C., Petersson O.: Splitsort an adaptive sorting algorithm. Inform. Process. Lett. 39 (1991), 205–211.
• 16. Marszałek Z., Połap D., Woźniak M.: On preprocessing large data sets by the use of triple merge sort algorithm. Proceedings of the International Conference on Advances in Information Processing and Communication Technologies (IPCT 2014), The IRED – Digital Seek Library, Santa Barbara 2014, 65–72.
• 17. Marszałek Z., Woźniak M.: On possible organizing Nosql database systems. Int. J. Information Science and Intelligent System 2, no. 2 (2013), 51–59.
• 18. Sinha R., Zobe J.: Cache-conscious sorting of large sets of strings with dynamic tries. J. Exp. Algorithmics 9 (2004), article no. 1.5.
• 19. Weiss M.A.: Data Structures and Algorithm Analysis in C++. Prentice Hall, Indianapolis 2013.
• 20. Woźniak M., Marszałek Z.: On some properties of bubble sort with logic control of order for large scale data sets. Zesz. Nauk. PŚl., Mat. Stosow. 3 (2013), 47–58.
• 21. Woźniak M., Marszałek Z.: Selected Algorithms for Sorting Large Data Sets. Wyd. Pol. Śl. (Silesian University of Technology Press), Gliwice 2013.
• 22. Woźniak M., Marszałek Z.: Extended Algorithms for Sorting Large Data Sets. Wyd. Pol. Śl. (Silesian University of Technology Press), Gliwice 2014.
• 23. Woźniak M., Marszałek Z., Gabryel M.: The analysis of properties of insertion sort algorithm for large data sets. Zesz. Nauk. PŚl., Mat. Stosow. 2 (2012), 45–55.
• 24. Woźniak M., Marszałek Z., Gabryel M., Nowicki R.K.: Modified merge sort algorithm for large scale data sets. Lecture Notes in Artificial Intelligence 7895 (2013), 612–622.
• 25. Woźniak M., Marszałek Z., Gabryel M., Nowicki R.K.: On quick sort algorithm performance for large data sets. In: Looking into the Future of Creativity and Decision Support Systems, Skulimowski A.M.J. (ed.), Progress & Business Publishers, Cracow 2013, 647–656.
• 26. Woźniak M., Marszałek Z., Gabryel M., Nowicki R.K.: Triple heap sort algorithm for large data sets. In: Looking into the Future of Creativity and Decision Support Systems, Skulimowski A.M.J. (ed.), Progress & Business Publishers, Cracow 2013, 657–665.
• 27. Zheng S.Q., Calidas B., Zhang Y.: An efficient general in-place parallel sorting scheme. J. Supercomput. 14 (1999), 5–17.