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

DOI10.1016/j.ins.2014.03.040zbMath1404.68036OpenAlexW1973576895MaRDI QIDQ506709

Lien-Fa Lin, Yuan-Ko Huang

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (1)

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

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
• Efficient processing of \textit{continuous min-max distance bounded query} with updates in road networks
• Probabilistic top-\(k\) dominating queries in uncertain databases
• Unnamed Item

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