@inproceedings{9ea3dad71ecf46ef9390f8ae39fa1d0e,
title = "Approximate sorting of data streams with limited storage",
abstract = "We consider the problem of approximate sorting of a data stream (in one pass) with limited internal storage where the goal is not to rearrange data but to output a permutation that reflects the ordering of the elements of the data stream as closely as possible. Our main objective is to study the relationship between the quality of the sorting and the amount of available storage. To measure quality, we use permutation distortion metrics, namely the Kendall tau and Chebyshev metrics, as well as mutual information, between the output permutation and the true ordering of data elements. We provide bounds on the performance of algorithms with limited storage and present a simple algorithm that asymptotically requires a constant factor as much storage as an optimal algorithm in terms of mutual information and average Kendall tau distortion.",
author = "Farzad Farnoud and Eitan Yaakobi and Jehoshua Bruck",
year = "2014",
doi = "10.1007/978-3-319-08783-2\_40",
language = "الإنجليزيّة",
isbn = "9783319087825",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "465--476",
booktitle = "Computing and Combinatorics - 20th International Conference, COCOON 2014, Proceedings",
note = "20th International Computing and Combinatorics Conference, COCOON 2014 ; Conference date: 04-08-2014 Through 06-08-2014",
}