Efficient Processing of Which-Edge Questions on Shortest Path Queries

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-05810-8_17
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

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

GeoInformatica
DevelopmentPlanningInformation SystemsGeography
2017English

Shortest Path Queries in Rectilinear Worlds

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

Efficient Algorithms for Processing XPath Queries

ACM Transactions on Database Systems
Information Systems
2005English

Efficient Processing of Spatial Range Queries on Wireless Broadcast Streams

International Journal of Database Management Systems
2014English

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

Efficient Processing of Spatial Queries in Line Segment Databases

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1991English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy