Efficient processing of \textit{continuous min-max distance bounded query} with updates in road networks

DOI10.1016/J.INS.2014.03.040zbMATH Open1404.68036OpenAlexW1973576895MaRDI QIDQ506709FDOQ506709

Authors: Yuan-Ko Huang, Lien-Fa Lin 

Publication date: 2 February 2017

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

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

Recommendations

• Efficient computation of continuous range skyline queries in road networks
• scientific article; zbMATH DE number 1945886
• Nearest neighbor query in road networks
• Point location in the continuous-time moving network
• scientific article; zbMATH DE number 2086278

zbMATH Keywords

road networkbounded objectbounded objects updating mechanismcontinuous min-max distance bounded queryspatio-temporal query

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• A note on two problems in connexion with graphs
• The number of shortest paths in the arrangement graph
• Processing time-dependent shortest path queries without pre-computed speed information on road networks
• Probabilistic top-\(k\) dominating queries in uncertain databases
• Title not available (Why is that?)
• Efficient processing of \textit{continuous min-max distance bounded query} with updates in road networks

Cited In (4)

• Efficient processing of all neighboring object group queries with budget range constraint in road networks
• Efficient computation of continuous range skyline queries in road networks
• Efficient processing of \textit{continuous min-max distance bounded query} with updates in road networks
• Safe-region generation methods for continuous trip route planning queries

This page was built for publication: Efficient processing of \textit{continuous min-max distance bounded query} with updates in road networks

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