Modern architectures make possible development in new algorithms for large data sets and
distributed computing. The newly proposed versions can benefit both from faster computing …

Designing an efficient data sorting algorithm that requires less time and space complexity is
essential for computer science, different engineering disciplines, data mining systems …

The development in multicore architectures gives a new line of processors that can flexibly
distribute tasks between their logical cores. These need flexible models of efficient …

Emerging persistent memory (PM, also termed as non-volatile memory) technologies can
promise large capacity, non-volatility, byte-addressability and DRAM-comparable access …

In this paper, we consider the searching problem over ordered sequences. It is well known
that Binary Search (BS) algorithm solves this problem with very efficient complexity, namely …

Sorting algorithms are important procedures to facilitate the order of data. In this paper,
author describes new recursive version of fast sort algorithm for large data sets. Examination …

Merge sort algorithm is widely used in databases to organize and search for information. In
the work the author describes some newly proposed not recursive version of the merge sort …

In this paper, an application of Computational Intelligence methods in positioning and
optimization of traffic in NoSQL database system modeled with exponentially distributed …

In this paper we present a Bag-of-Words (also known as a Bag-of-Features) method
developed for the use of its implementation in NoSQL databases. When working with this …

The article presented problems of fragmentation of hydrographic big data into smaller
subsets during reduction process. Data reduction is a processing of reduce the value of the …