id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_gocqmq4fknd2fjg2ixbgjj53nu	Suluk Chaikhan	Correct and stable sorting for overflow streaming data with a limited storage size and a uniprocessor	2021	27	.pdf	application/pdf	12044	1795	75	data always overflow the working storage and sorting process is needed. Yaakobi & Bruck (2016) proposed an algorithm that sorts big data based on limited Let n be the total streaming numbers to be sorted and M ≪ n be the limited size of working constraint of the working storage in streaming data sort. Table 3 Sorting execution time of the proposed algorithm with respect to size of working storage. Since streaming data sort algorithm uses only one working storage of fixed Figure 7 Comparison of storage size change as the results of sorting a set of streaming data by the representing them in compact groups as implemented in streaming data sort algorithm. Correct and stable sorting for overflow streaming data with a limited storage size and a uniprocessor Correct and stable sorting for overflow streaming data with a limited storage size and a uniprocessor	./cache/work_gocqmq4fknd2fjg2ixbgjj53nu.pdf	./txt/work_gocqmq4fknd2fjg2ixbgjj53nu.txt