Efficient processing of all neighboring object group queries with budget range constraint in road networks

DOI10.1007/S00607-024-01260-7MaRDI QIDQ6556324zbMATH OpenFDO

Authors Yuan-Ko Huang, Chien-Pang Lee

Publication date 17 June 2024

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00607-024-01260-7

zbMATH Keywords

BR-ANOGQ algorithmbudget range-based all-neighboring-object group querygrid indexlocation-based queriesroad networks

Mathematics Subject Classification ID

Data structures (68P05) Database theory (68P15) Analysis of algorithms (68W40)

Recommendations

• Efficient processing of neighboring skyline queries with consideration of distance, quality, and cost
• Efficient processing of \textit{continuous min-max distance bounded query} with updates in road networks
• Efficient computation of continuous range skyline queries in road networks
• Nearest neighbor query in road networks
• Graph indexing for spatial data traversal in road map databases

Cites work

• Group-based collective keyword querying in road networks
• Multiway spatial joins

This page was built for publication: Efficient processing of all neighboring object group queries with budget range constraint in road networks

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