Computer scientists and engineers work with increasing amounts of information. These data are used for knowledge retrieval, data management decision support and so on. Sorting algorithms are important procedures that if efficiently composed and implemented can increase speed of data processing and decision correctness. Many various sorting algorithms and their modifications are applicable in large computer systems. However, as the computer architectures are more efficient with each release and the software is more complex with each version there is need to improve sorting methods applied for big data computation.

Benchmark Tests on Improved Merge for Big Data Processing

NAPOLI, CHRISTIAN;PAPPALARDO, Giuseppe;TRAMONTANA, EMILIANO ALESSIO
2015-01-01

Abstract

Computer scientists and engineers work with increasing amounts of information. These data are used for knowledge retrieval, data management decision support and so on. Sorting algorithms are important procedures that if efficiently composed and implemented can increase speed of data processing and decision correctness. Many various sorting algorithms and their modifications are applicable in large computer systems. However, as the computer architectures are more efficient with each release and the software is more complex with each version there is need to improve sorting methods applied for big data computation.
2015
978-147997588-4
Big Data; Sorting Algorithms; Knowledge retrieval
File in questo prodotto:
File Dimensione Formato  
07287001.pdf

solo gestori archivio

Licenza: Non specificato
Dimensione 379.92 kB
Formato Adobe PDF
379.92 kB Adobe PDF   Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.11769/246942
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 16
  • ???jsp.display-item.citation.isi??? 13
social impact