Show simple item record

dc.contributor.authorLeng, Muxi
dc.contributor.authorYang, Yajun
dc.contributor.authorWang, Junhu
dc.contributor.authorHu, Qinghua
dc.contributor.authorWang, Xin
dc.contributor.editorCai, Y
dc.contributor.editorIshikawa, Y
dc.contributor.editorXu, J
dc.date.accessioned2019-06-27T12:30:48Z
dc.date.available2019-06-27T12:30:48Z
dc.date.issued2018
dc.identifier.isbn978-3-319-96892-6
dc.identifier.issn0302-9743
dc.identifier.doi10.1007/978-3-319-96893-3_25
dc.identifier.urihttp://hdl.handle.net/10072/383967
dc.description.abstractK nearest neighbor (kNN) search is an important problem and has been well studied on static road networks. However, in real world, road networks are often time-dependent, i.e., the time for traveling through a road always changes over time. Most existing methods for kNN query build various indexes maintaining the shortest distances for some pairs of vertices on static road networks. Unfortunately, these methods cannot be used for the time-dependent road networks because the shortest distances always change over time. To address the problem of kNN query on time-dependent road networks, we propose a novel voronoi-based index in this paper. Moreover, we propose an algorithm for pre-processing time-dependent road networks such that the waiting time is not necessary to be considered. We confirm the efficiency of our method through experiments on real-life datasets.
dc.languageEnglish
dc.publisherSpringer Nature
dc.publisher.placeSwitzerland
dc.relation.ispartofconferencenameAsia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data (APWeb-WAIM 2018)
dc.relation.ispartofconferencetitleLecture Notes in Computer Science
dc.relation.ispartofdatefrom2018-07-23
dc.relation.ispartofdateto2018-07-25
dc.relation.ispartoflocationManau, China
dc.relation.ispartofpagefrom334
dc.relation.ispartofpageto349
dc.relation.ispartofvolume10988
dc.subject.fieldofresearchInformation and Computing Sciences
dc.subject.fieldofresearchcode08
dc.titleFinding the K nearest objects over time dependent road networks
dc.typeConference output
dc.type.descriptionE1 - Conferences
dc.type.codeE - Conference Publications
gro.hasfulltextNo Full Text
gro.griffith.authorWang, John


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

  • Conference outputs
    Contains papers delivered by Griffith authors at national and international conferences.

Show simple item record