Database Paper Browser

Back to papers

Efficient Skyline Querying with Variable User Preferences on Nominal Attributes

Summary: Addresses skyline queries with dynamic nominal preferences (no fixed attribute order). Introduces IPO-tree Search, a semi-materialization storing results to enable evaluation for any preference without full materialization; experiments confirm efficiency. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
9734
Venue
VLDB
Year
2008
Pagerank
5.4237646e-05
Overall Rank
5,583 | 61.17%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank Citing Paper Year Venue Pagerank
4,559 Creating Competitive Products 2009 VLDB 6.0857166e-05
5,062 Randomized Multi-pass Streaming Skyline Algorithms 2009 VLDB 5.7268277e-05
5,695 Scalable Skyline Computation Using Object-based Space Partitioning 2009 SIGMOD 5.3681018e-05
12,205 ZINC: Efficient Indexing for Skyline Computation 2011 VLDB 4.1945683e-05
12,351 A Fair Assignment Algorithm for Multiple Preference Queries 2009 VLDB 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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