Stable duplicate-key extraction with optimal time and space bounds

DOI10.1007/BF00289147zbMath0645.68026OpenAlexW2013045276MaRDI QIDQ1103387

Bing-Chao Huang, Michael A. Langston

Publication date: 1989

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00289147

zbMATH Keywords

file processingblock rearrangementduplicate-key extractionstable mergetransforming of list of records

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (3)

Sorting multisets stably in minimum space ⋮ Stable set and multiset operations in optimal time and space ⋮ Sorting multisets stably in minimum space

Cites Work

• Stable unmerging in linear time and constant space
• Simplified stable merging tasks
• Stable Sorting and Merging with Optimal Space and Time Bounds
• Stable Sorting in Asymptotically Optimal Time and Extra Space
• Unnamed Item
• Unnamed Item

This page was built for publication: Stable duplicate-key extraction with optimal time and space bounds