On efficient k-optimal-location-selection query processing in metric spaces

DOI10.1016/J.INS.2014.11.038zbMATH Open1360.68395OpenAlexW2030883263MaRDI QIDQ528666FDOQ528666

Authors: Yong-Cai Geng, Sumit K. Garg 

Publication date: 16 May 2017

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2014.11.038

Recommendations

• Pivot selection techniques for proximity searching in metric spaces
• scientific article; zbMATH DE number 1559576
• On the Least Cost for Proximity Searching in Metric Spaces
• Processing Top-k Dominating Queries in Metric Spaces
• Nearest neighbor queries in metric spaces

zbMATH Keywords

metric spacesquery processing\( k\)-optimal-location-selection queryoptimal location selectionspatial database

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• Nearest neighbor queries in metric spaces
• Solving the \(k\)-influence region problem with the GPU
• A hybrid firefly-genetic algorithm for the capacitated facility location problem
• Solving similarity joins and range queries in metric spaces with the list of twin clusters
• Using Voronoi diagrams to solve a hybrid facility location problem with attentive facilities
• A global optimization algorithm for target set selection problems

Cited In (2)

• Efficient evaluation of monitoring top-\(t\) most influential places
• Processing Top-k Dominating Queries in Metric Spaces

This page was built for publication: On efficient \( k\)-optimal-location-selection query processing in metric spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q528666)