Approximate sorting and its applications in I/O model

DOI10.1016/j.tcs.2023.114348arXiv2208.10298MaRDI QIDQ6122589

Jian-Zhong Li, Tianpeng Gao

Publication date: 1 March 2024

Published in: Theoretical Computer Science, Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.10298

zbMATH Keywords

indexqueryapproximate sortingI/O modelSpearman's footrule metricexternal metricsort-merge joinexternal metric on permutation spaceexternal Spearman's footrule metric

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Approximate sorting of data streams with limited storage
• Right invariant metrics and measures of presortedness
• Bounds for Permutation Rate-Distortion
• Robust and Adaptive Search
• Permutation Arrays Under the Chebyshev Distance
• Space/time trade-offs in hash coding with allowable errors
• Approximate Sorting
• Recognizing the tractability in big data computing

This page was built for publication: Approximate sorting and its applications in I/O model