Directional Queries: Making Top-k Queries More Effective in Discovering Relevant Results

Summary: Directional queries add a distance term to linear top-k, biasing toward balanced, skyline-like results aligned with attribute weights. Introduces four skyline-robustness and difficulty indicators and shows that the approach retrieves more relevant results with modest overhead on real and synthetic data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 7042
Venue: SIGMOD
Year: 2024
Pagerank: 5.093636e-05
Overall Rank: 11,199 | 23.17%
DOI: 10.1145/3698807

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

1. Paolo Ciaccia (University of Bologna)
2. Davide Martinenghi (Politecnico di Milano)

BibTeX Citation

@inproceedings{ciaccia_sigmod24,
        title = {{Directional Queries: Making Top-k Queries More Effective in Discovering Relevant Results}},
        author = {Ciaccia, Paolo and Martinenghi, Davide},
        series = {{SIGMOD} '24},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3698807},
        url = {https://dl.acm.org/doi/10.1145/3698807},
        year = {2024}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank

Outgoing Citations (Sorted by Pagerank)

Showing 14 of 14 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
2	R-Trees: A Dynamic Index Structure For Spatial Searching	1984	SIGMOD	0.0020210012
5	Optimal Aggregation Algorithms for Middleware [Extended Abstract]	2001	PODS	0.0010828372
333	The Onion Technique: Indexing for Linear Optimization Queries	2000	SIGMOD	0.0002089582
623	An Optimal and Progressive Algorithm for Skyline Queries	2003	SIGMOD	0.00015684963
1,072	Regret-Minimizing Representative Databases	2010	VLDB	0.0001230281
1,137	A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space	1997	PODS	0.00012027131
2,063	Computing k-Regret Minimizing Sets	2014	VLDB	9.2399169e-05
2,259	Top-k Bounded Diversification	2012	SIGMOD	8.8529269e-05
2,827	Efficient Processing of Top-k Dominating Queries on Multi-Dimensional Data	2007	VLDB	8.0831263e-05
5,496	Reconciling Skyline and Ranking Queries	2017	VLDB	6.1983381e-05
5,654	k-Regret Queries with Nonlinear Utilities	2015	VLDB	6.1330869e-05
6,052	Exact Processing of Uncertain Top-k Queries in Multi-criteria Settings	2018	VLDB	5.9941393e-05
6,249	Maximum Rank Query	2015	VLDB	5.9418925e-05
6,636	Marrying Top-k with Skyline Queries: Relaxing the Preference Input while Producing Output of Controllable Size	2021	SIGMOD	5.8172769e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	635	Evaluating Top-k Selection Queries	1999	VLDB
2	3,049	Top-k Queries on Uncertain Data: On Score Distribution and Typical Answers	2009	SIGMOD
3	9,901	Interactive Search for One of the Top-k	2021	SIGMOD
4	7,299	Efficient and Generic Evaluation of Ranked Queries	2011	SIGMOD
5	7,806	Computing Immutable Regions for Subspace Top-k Queries	2013	VLDB
6	5,496	Reconciling Skyline and Ranking Queries	2017	VLDB
7	8,378	Discovering the Skyline of Web Databases	2016	VLDB
8	2,427	Processing a Large Number of Continuous Preference Top-k Queries	2012	SIGMOD
9	12,331	Answering Top-k Queries Over a Mixture of Attractive and Repulsive Dimensions	2012	VLDB
10	2,827	Efficient Processing of Top-k Dominating Queries on Multi-Dimensional Data	2007	VLDB