Group-based collective keyword querying in road networks

DOI10.1016/J.IPL.2016.10.008MaRDI QIDQ344558zbMATH OpenOpenAlexFDO

Authors Sen Su, Sen Zhao, Xiang Cheng, Rong Bi, Jie Wang, Xin Cao

Publication date 23 November 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2016.10.008

zbMATH Keywords

approximate algorithmsdesign of algorithmsroad networkscollective keyword query

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Recommendations

• An efficient approach for searching optimal multi-keywords coverage routes
• Level-aware collective spatial keyword queries
• An efficient air index for keyword search on spatial network databases
• Nearest neighbor query in road networks
• Group trip planning queries in spatial databases

Cites work

• Minimum-diameter covering problems

Cited in

(6)

• Efficient processing of all neighboring object group queries with budget range constraint in road networks
• An efficient air index for keyword search on spatial network databases
• Level-aware collective spatial keyword queries
• Group trip planning queries in spatial databases
• Efficient time-interval augmented spatial keyword queries on road networks
• An efficient approach for searching optimal multi-keywords coverage routes

Describes a project that uses

Uses Software

• Algorithm 97

This page was built for publication: Group-based collective keyword querying in road networks

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