Results 1 to 10 of about 196,748 (236)
Enhanced Merge Sort- A New Approach to the Merging Process [PDF]
Procedia Computer Science, 2016 One of the major fundamental issues of Computer Science is arrangement of elements in the database. The efficiency of the sorting algorithms is to optimize the importance of other sorting algorithms11. The optimality of these sorting algorithms is judged
Haradome, Hiroki +10 more
core +3 more sources
On the average running time of odd-even merge sort [PDF]
, 1995 This paper is concerned with the average running time of Batcher's odd-even merge sort when implemented on a collection of processors. We consider the case where $n$, the size of the input, is an arbitrary multiple of the number $p$ of processors used ...
Rüb, C.
core +1 more source
Massively Parallel Sort-Merge Joins in Main Memory Multi-Core Database Systems [PDF]
, 2012 Two emerging hardware trends will dominate the database system technology in the near future: increasing main memory capacities of several TB per server and massively parallel multi-core processing.
Albutiu, Martina-Cezara +2 more
core +1 more source
Engineering Parallel String Sorting [PDF]
, 2014 We discuss how string sorting algorithms can be parallelized on modern multi-core shared memory machines. As a synthesis of the best sequential string sorting algorithms and successful parallel sorting algorithms for atomic objects, we first propose ...
Bingmann, Timo +2 more
core +3 more sources
Aplikasi Simulasi Pengurutan Data Menggunakan Algoritma Heap Sort [PDF]
, 2015 Untuk memecahkan masalah pengurutan dalam membangun suatu program aplikasi, dibutuhkan algoritma pengurutan. Metode-metode pengurutan data pun ada berbagai jenis. Mulai dari binary sort, insertion sort, merge sort, Heap Sort dll.
Feter, N. (Noris), Wijaya, A. (Ardi)
core +2 more sources
Set-oriented data mining in relational databases [PDF]
, 1995 Data mining is an important real-life application for businesses. It is critical to find efficient ways of mining large data sets. In order to benefit from the experience with relational databases, a set-oriented approach to mining data is needed.
Houtsma, Maurice, Swami, Arun
core +4 more sources
Data-Adapted Parallel Merge Sort [PDF]
, 2020 In the aerospace sciences we produce huge amounts of data. This data must be arranged in a meaningful order, so that we can analyze or visualize it. In this paper we focus on data that is distributed among computer processes and then needs to be sorted by a single root process for further analysis.
Holke, Johannes +3 more
openaire +4 more sources
Interactive context-aware user-driven metadata correction in digital libraries [PDF]
, 2012 Personal name variants are a common problem in digital libraries, reducing the precision of searches and complicating browsing-based interaction. The book-centric approach of name authority control has not scaled to match the growth and diversity of ...
Bainbridge, David +2 more
core +1 more source
Set-Oriented Mining for Association Rules in Relational Databases [PDF]
, 1995 Describe set-oriented algorithms for mining association rules. Such algorithms imply performing multiple joins and may appear to be inherently less efficient than special-purpose algorithms. We develop new algorithms that can be expressed as SQL queries,
Houtsma, M.A.W., Swami, A.
core +3 more sources
Exploiting non-constant safe memory in resilient algorithms and data structures [PDF]
, 2015 We extend the Faulty RAM model by Finocchi and Italiano (2008) by adding a safe memory of arbitrary size $S$, and we then derive tradeoffs between the performance of resilient algorithmic techniques and the size of the safe memory.
DE STEFANI, LORENZO +1 more
core +2 more sources