78 search results - page 7 / 16 » Finding Top-k Approximate Answers to Path Queries |
ALENEX
2010
13 years 9 months ago
2010
We present the first fast route planning algorithm that answers shortest paths queries for a customizable linear combination of two different metrics, e. g. travel time and energy...
CIKM
2007
Springer
14 years 1 months ago
2007
Springer
XML query languages typically allow the specification of structural patterns of elements. Finding the occurrences of such patterns in an XML tree is the key operation in XML quer...
ICFP
2008
ACM
14 years 7 months ago
2008
ACM
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
HIPC
2007
Springer
13 years 11 months ago
2007
Springer
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...