Skip to main content

2012 | OriginalPaper | Buchkapitel

A New k-NN Query Processing Algorithm Using a Grid Structure for Mobile Objects in Location-Based Services

verfasst von : Seungtae Hong, Jaewoo Chang

Erschienen in: Computer Science and its Applications

Verlag: Springer Netherlands

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In telematics and location-based service (LBS) applications, because moving objects usually move on spatial networks, their locations are updated frequently, leading to the degradation of retrieval performance. To manage the frequent updates of moving objects’ locations in an efficient way, we propose a new distributed grid scheme which utilizes node-based pre-computation technique to minimize the update cost of the moving objects’ locations. Because our grid scheme manages spatial network data separately from the Point of Interests (POIs) and moving objects, it can minimize the update cost of the POIs and moving objects. Using our grid scheme, we propose a new k-nearest neighbor (k-NN) query processing algorithm which minimizes the number of accesses to adjacent cells during POIs retrieval in a parallel way. Finally, we show from our performance analysis that our k-NN query processing algorithm is better on retrieval performance than that of the existing S-GRID.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query processing in spatial network databases. In: Proc. VLDB, 802–813 (2003) Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query processing in spatial network databases. In: Proc. VLDB, 802–813 (2003)
2.
Zurück zum Zitat Shahabi, C., Kolahdouzan, M.R., Sharifzadeh, M.: A road network embedding technique for K-nearest neighbor search in moving object databases. In Proc GeoInformatica 7(3), 255–273 (2003)CrossRef Shahabi, C., Kolahdouzan, M.R., Sharifzadeh, M.: A road network embedding technique for K-nearest neighbor search in moving object databases. In Proc GeoInformatica 7(3), 255–273 (2003)CrossRef
3.
Zurück zum Zitat Jensen, C.S., Pedersen, T.B., Speicys, L., Timko, I.: Data modeling for mobile services in the real world. In Proc. SSTD, 1–9 (2003) Jensen, C.S., Pedersen, T.B., Speicys, L., Timko, I.: Data modeling for mobile services in the real world. In Proc. SSTD, 1–9 (2003)
4.
Zurück zum Zitat Rimantas, B., Christian, S., Jensen, Gytis. K., Simonas, Š.: Nearest and reverse nearest neighbor queries for moving objects. In Proc. VLDB, 229–250 (2006) Rimantas, B., Christian, S., Jensen, Gytis. K., Simonas, Š.: Nearest and reverse nearest neighbor queries for moving objects. In Proc. VLDB, 229–250 (2006)
5.
Zurück zum Zitat Huang, YK., Chen, C-C., Lee, C.: Continuous K-nearest neighbor query for moving objects with uncertain velocity. In Proc. GeoInformatica 13(1) 1–25 (2009) Huang, YK., Chen, C-C., Lee, C.: Continuous K-nearest neighbor query for moving objects with uncertain velocity. In Proc. GeoInformatica 13(1) 1–25 (2009)
6.
Zurück zum Zitat Kolahdouzan, M.R., Shahabi, C.: Voronoi-based nearest neighbor search for spatial network databases. In Proc. VLDB, 840–851 (2004) Kolahdouzan, M.R., Shahabi, C.: Voronoi-based nearest neighbor search for spatial network databases. In Proc. VLDB, 840–851 (2004)
7.
Zurück zum Zitat Safar, M.: K nearest neighbor search in navigation systems mobile information systems. Mob. Inf. Syst. 1(3), 207–224 (2005) Safar, M.: K nearest neighbor search in navigation systems mobile information systems. Mob. Inf. Syst. 1(3), 207–224 (2005)
8.
Zurück zum Zitat Huang, X., Jensen, C.S., Saltenis, S.: The Islands approach to nearest neighbor querying in spatial networks. In Proc. SSTD LNCS 3633, 73–90 (2005) Huang, X., Jensen, C.S., Saltenis, S.: The Islands approach to nearest neighbor querying in spatial networks. In Proc. SSTD LNCS 3633, 73–90 (2005)
9.
Zurück zum Zitat Huang, X., Jensen, C.S., Lu, H., Saltenis, S.: S-GRID: a versatile approach to efficient query processing in spatial networks. In Proc. SSTD LNCS 4605, 93–111 (2007) Huang, X., Jensen, C.S., Lu, H., Saltenis, S.: S-GRID: a versatile approach to efficient query processing in spatial networks. In Proc. SSTD LNCS 4605, 93–111 (2007)
10.
Zurück zum Zitat Brinkhoff, T.: A framework for generating network-based moving objects. In Proc. GeoInformatica, 153–180 (2002) Brinkhoff, T.: A framework for generating network-based moving objects. In Proc. GeoInformatica, 153–180 (2002)
Metadaten
Titel
A New k-NN Query Processing Algorithm Using a Grid Structure for Mobile Objects in Location-Based Services
verfasst von
Seungtae Hong
Jaewoo Chang
Copyright-Jahr
2012
Verlag
Springer Netherlands
DOI
https://doi.org/10.1007/978-94-007-5699-1_33

Premium Partner