Efficient Evaluation of Shortest Travel-Time Path Queries Through Spatial Mashups

GeoInformatica - Netherlands
doi 10.1007/s10707-016-0288-4
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Efficient Processing of Which-Edge Questions on Shortest Path Queries

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Shortest Path Queries in Rectilinear Worlds

International Journal of Computational Geometry and Applications
GeometryApplied MathematicsComputational TheoryComputational MathematicsMathematicsTheoretical Computer ScienceTopology
1992English

Grid-Aware Evaluation of Regular Path Queries on Spatial Networks

Proceedings - International Conference on Advanced Information Networking and Applications, AINA
Engineering
2007English

Efficient Processing of Top-K Spatial Keyword Queries

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Efficient Processing of Top-K Spatial Preference Queries

Proceedings of the VLDB Endowment
Computer Science
2010English

I/O-Efficient Algorithms for Shortest Path Related Problems

English

Secluded Path via Shortest Path

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Shortest Alternate Path Discovery Through Recursive Bounding Box Pruning

Journal of Transportation Technologies
2017English

Efficient In-Network Evaluation of Multiple Queries

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy