Database Paper Browser

Back to papers

Scalable Skyline Computation Using Object-based Space Partitioning

Summary: Dynamic object-based space-partitioning index accelerates skyline computation, integrated with sort-based skyline algorithms. Reduces CPU-bound dominance checks via bitwise operations; theory and experiments show scalable performance as size and dimensionality grow. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
4141
Venue
SIGMOD
Year
2009
Pagerank
5.3681018e-05
Overall Rank
5,695 | 60.39%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 15 of 15 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

Overall Rank Paper Year Venue Pagerank
4,142 Approaching the Skyline in Z Order 2007 VLDB 6.4138475e-05
6,677 Categorical Skylines for Streaming Data 2008 SIGMOD 4.9657435e-05
12,479 On Dominating Your Neighborhood Profitably 2007 VLDB 4.1945683e-05
5,240 On Finding Skylines in External Memory 2011 PODS 5.6104868e-05
12,269 Efficient Skyline Evaluation over Partially Ordered Domains 2010 VLDB 4.1945683e-05
1,575 Efficient Computation of the Skyline Cube 2005 VLDB 0.00011286884
2,366 Efficient Processing of Top-k Dominating Queries on Multi-Dimensional Data 2007 VLDB 8.9523637e-05
262 Efficient Progressive Skyline Computation 2001 VLDB 0.00029987552
6,568 Efficient Parallel Skyline Processing using Hyperplane Projections 2011 SIGMOD 5.0068521e-05
914 Finding k-Dominant Skylines in High Dimensional Space 2006 SIGMOD 0.00015387584