DBScholar

Back to papers

Percentile Finding Algorithm for Multiple Sorted Runs

Summary: An efficient, provably analyzed algorithm finds arbitrary percentiles across many sorted runs exactly. It enables load-balanced parallel merging—even under skewed key distributions—avoiding the speedup loss of approximate partitioning in parallel external sort. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
8083
Venue
VLDB
Year
1989
Pagerank
5.7982932e-05
Overall Rank
6,699 | 54.04%
DOI
-

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{iyer_vldb89,
        title = {{Percentile Finding Algorithm for Multiple Sorted Runs}},
        author = {Iyer, Balakrishna R. and Ricard, Gary R. and Varman, Peter J.},
        journal = {PVLDB},
        series = {{VLDB} '89},
        pages = {135},
        year = {1989}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
1,717 Improving the Performance of List Intersection 2009 VLDB 9.9327227e-05
3,368 CloudRAMSort: Fast and Efficient Large-Scale Distributed RAM Sort on Shared-Nothing Cluster 2012 SIGMOD 7.4713287e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
173 Simple Random Sampling from Relational Databases 1986 VLDB 0.00027273858
1,299 A Low Communication Sort Algorithm for a Parallel Database Machine 1989 VLDB 0.00011258763
Previous Page 1 / 1 Next

Semantically Similar Papers