… We categorize relevant studies on sequenced route querying … top-k optimal sequenced
routes. Most existing studies only work for the case when only the top-1 optimal sequenced route …

… path is equal to its shortest length. Finally, we extend our ROSE to tackle the top k RCOSR
query. … to answer the RCOSR query; (2) formalizing and tackling top k RCOSR search and …

… query and k nearest neighbor query. This paper describes a Top-k query method applied to
a sequenced route query … A Top-k query is a recommendation query to obtain number of k …

… Abstract—Motivated by many practical applications in logistics and mobility-as-a-service,
we study the top-k optimal sequenced routes (KOSR) querying on large, general graphs where …

… Consequently, when many path queries come with localized origins and … path algorithm
chooses 𝑝1 as the result, then all the queries from 𝑣0 to 𝑣8 would head to the same route …

… routes to diversify top-k routes, devise mapping structures to organize indoor keywords and
compute route … We use KP(·) to denote the sequence of key partitions on a route. In Table II, …

… top-k query Diversified top-k query, which aims at computing the top-k results that are most
relevant to a user query … A path from vertex s to vertex t in graph G is a sequence of vertices, …

… data objects in a road sequence are grouped to form a data segment in their approach. The
motivation behind grouping data objects is that data objects in a sequence are close to each …

… needs to have prior knowledge about the mining query and the task-specific data and be …
top-k closed sequential patterns of minimal length min_l efficiently in a sequence database. …

… To support the top-k results of the ORCSK query, we resort to the top-k shortest … Xu, “Top k
optimal sequenced route query with poi preferences,” Data Science and Engineering, vol. 7, no…