DBScholar

Back to papers

Finding k-Dominant Skylines in High Dimensional Space

Summary: Introduces k-dominant skylines to curb high-dimensional skyline growth via k-dominance (p ≥ q in k dimensions and strictly better in at least one). Proves non-transitivity of k-dominant skylines and presents several new algorithms and variants with extensive experiments on real and synthetic data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
3839
Venue
SIGMOD
Year
2006
Pagerank
0.00013979615
Overall Rank
792 | 94.57%
DOI
10.1145/1142473.1142530

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{chan_sigmod06,
        title = {{Finding k-Dominant Skylines in High Dimensional Space}},
        author = {Chan, Chee-Yong and Jagadish, H.V. and Tan, Kian-Lee and Tung, Anthony K.H. and Zhang, Zhenjie},
        series = {{SIGMOD} '06},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/1142473.1142530},
        url = {https://dl.acm.org/doi/10.1145/1142473.1142530},
        year = {2006}
}

Incoming Citations (Sorted by Pagerank)

Showing 29 of 29 citing papers.

Rank Citing Paper Year Venue Pagerank
1,072 Regret-Minimizing Representative Databases 2010 VLDB 0.0001230281
1,097 Probabilistic Skylines on Uncertain Data 2007 VLDB 0.00012181027
2,063 Computing k-Regret Minimizing Sets 2014 VLDB 9.2399169e-05
2,434 Efficient Skyline Computation over Low-Cardinality Domains 2007 VLDB 8.5839844e-05
2,491 Interactive Regret Minimization 2012 SIGMOD 8.5086491e-05
2,730 DADA: A Data Cube for Dominant Relationship Analysis 2006 SIGMOD 8.1977425e-05
2,827 Efficient Processing of Top-k Dominating Queries on Multi-Dimensional Data 2007 VLDB 8.0831263e-05
3,224 Kernel-Based Skyline Cardinality Estimation 2009 SIGMOD 7.6249441e-05
3,409 Approaching the Skyline in Z Order 2007 VLDB 7.4368546e-05
4,727 Efficient Computation of Regret-ratio Minimizing Set: A Compact Maxima Representative 2017 SIGMOD 6.5362946e-05
4,939 Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality 2018 SIGMOD 6.4336325e-05
5,016 On Finding Skylines in External Memory 2011 PODS 6.3998091e-05
5,455 Scalable Skyline Computation Using Object-based Space Partitioning 2009 SIGMOD 6.2133548e-05
5,654 k-Regret Queries with Nonlinear Utilities 2015 VLDB 6.1330869e-05
5,887 Call to Order: A Hierarchical Browsing Approach to Eliciting Users' Preference 2010 SIGMOD 6.0500409e-05
5,944 k-Hit Query: Top-k Query with Probabilistic Utility Function 2015 SIGMOD 6.0328749e-05
6,592 RRR: Rank-Regret Representative 2019 SIGMOD 5.830041e-05
6,616 Categorical Skylines for Streaming Data 2008 SIGMOD 5.8214223e-05
6,636 Marrying Top-k with Skyline Queries: Relaxing the Preference Input while Producing Output of Controllable Size 2021 SIGMOD 5.8172769e-05
7,305 Strongly Truthful Interactive Regret Minimization 2019 SIGMOD 5.6501646e-05
7,870 Optimizing Iceberg Queries with Complex Joins 2017 SIGMOD 5.5272726e-05
8,645 Finding Pareto Optimal Groups: Group-based Skyline 2015 VLDB 5.3933023e-05
9,192 Efficient and Effective Cardinality Estimation for Skyline Family 2023 SIGMOD 5.3058708e-05
10,208 Causal Search for Skylines (CSS): Causally-Informed Selective Data De-Correlation 2026 SIGMOD 5.093636e-05
11,701 Preference Queries over Taxonomic Domains 2021 VLDB 5.093636e-05
12,427 Finding Maximum Degrees in Hidden Bipartite Graphs 2010 SIGMOD 5.093636e-05
12,443 A Demonstration of FlexPref: Extensible Preference Evaluation Inside the DBMS Engine 2010 SIGMOD 5.093636e-05
12,446 CareDB: A Context and Preference-Aware Location-Based Database System 2010 VLDB 5.093636e-05
12,498 Minimizing the Communication Cost for Continuous Skyline Maintenance 2009 SIGMOD 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 9 of 9 cited papers.

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

Previous Page 1 / 1 Next

Semantically Similar Papers