Log in to save to my catalogue

A Novel Index Method for K Nearest Object Query over Time-Dependent Road Networks

A Novel Index Method for K Nearest Object Query over Time-Dependent Road Networks

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_doaj_primary_oai_doaj_org_article_05562db63fcf4027b9b05e747bb95bbc

A Novel Index Method for K Nearest Object Query over Time-Dependent Road Networks

About this item

Full title

A Novel Index Method for K Nearest Object Query over Time-Dependent Road Networks

Publisher

Cairo, Egypt: Hindawi Publishing Corporation

Journal title

Complexity (New York, N.Y.), 2019-01, Vol.2019 (2019), p.1-18

Language

English

Formats

Publication information

Publisher

Cairo, Egypt: Hindawi Publishing Corporation

More information

Scope and Contents

Contents

K nearest neighbor ( k NN) search is an important problem in location-based services (LBS) 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 k NN query build various indexes maintaining the...

Alternative Titles

Full title

A Novel Index Method for K Nearest Object Query over Time-Dependent Road Networks

Authors, Artists and Contributors

Identifiers

Primary Identifiers

Record Identifier

TN_cdi_doaj_primary_oai_doaj_org_article_05562db63fcf4027b9b05e747bb95bbc

Permalink

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_doaj_primary_oai_doaj_org_article_05562db63fcf4027b9b05e747bb95bbc

Other Identifiers

ISSN

1076-2787

E-ISSN

1099-0526

DOI

10.1155/2019/4829164

How to access this item