DBScholar

Back to papers

Efficient Processing of Top-k Spatial Preference Queries

Summary: Maps data–feature pairs into a distance-score space to identify the minimal pair set sufficient for any top-k spatial preference query. A neighborhood-free query algorithm with efficient materialization and maintenance then reduces I/Os and speeds up execution versus state-of-the-art methods. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10512
Venue
VLDB
Year
2011
Pagerank
0.00010778831
Overall Rank
1,441 | 90.12%
DOI
10.14778/1921071.1921076

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{rochajunior_vldb11,
        title = {{Efficient Processing of Top-k Spatial Preference Queries}},
        author = {Rocha-Junior, Joao B. and Vlachou, Akrivi and Doulkeridis, Christos and Norvag, Kjetil},
        journal = {PVLDB},
        series = {{VLDB} '11},
        doi = {10.14778/1921071.1921076},
        url = {https://doi.org/10.14778/1921071.1921076},
        year = {2011}
}

Incoming Citations (Sorted by Pagerank)

Showing 15 of 15 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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