DBScholar

Back to papers

Avoiding Sorting and Grouping In Processing Queries

Summary: Introduces ordering and grouping constraints that capture primary and secondary physical properties of relations. A low-overhead plan-refinement algorithm propagates these properties through query plans to eliminate redundant sorting and grouping, with empirical performance gains. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
9218
Venue
VLDB
Year
2003
Pagerank
6.7509984e-05
Overall Rank
4,347 | 70.18%
DOI
10.1016/B978-012722442-8/50078-1

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{wang_vldb03,
        title = {{Avoiding Sorting and Grouping In Processing Queries}},
        author = {Wang, Xiaoyu and Cherniack, Mitch},
        journal = {PVLDB},
        series = {{VLDB} '03},
        doi = {10.1016/B978-012722442-8/50078-1},
        url = {https://doi.org/10.1016/B978-012722442-8/50078-1},
        year = {2003}
}

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

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

Rank Cited Paper Year Venue Pagerank
1 Access Path Selection in a Relational Database Management System 1979 SIGMOD 0.0024089429
71 Including Group-By in Query Optimization 1994 VLDB 0.00038021159
80 Hashing Methods and Relational Algebra Operations 1984 VLDB 0.00036536643
744 Fundamental Techniques for Order Optimization 1996 SIGMOD 0.00014411295
Previous Page 1 / 1 Next

Semantically Similar Papers