Skip to main content

2017 | OriginalPaper | Buchkapitel

Surrounding Join Query Processing in Spatial Databases

verfasst von : Lingxiao Li, David Taniar, Maria Indrawan-Santiago, Zhou Shao

Erschienen in: Databases Theory and Applications

Verlag: Springer International Publishing

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

search-config
loading …

Abstract

Spatial join queries play an important role in spatial database, and mostly all the distance-based join queries are based on the range search and nearest neighbour (NN), namely range join query and kNN join query. In this paper, we propose a new join query which is called surrounding join query. Given two point datasets Q and P of multidimensional objects, the surrounding query retrieves for each point in Q its all surrounding points in P. As a new spatial join query, we propose algorithms that are able to process such query efficiently. Evaluation on multiple real world datasets illustrate that our approach achieves high performance.

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 Berchtold, S., Ertl, B., Keim, D.A., Kriegel, H.-P., Seidl, T.: Fast nearest neighbor search in high-dimensional space. In: Proceedings of the 14th International Conference on Data Engineering, pp. 209–218. IEEE (1998) Berchtold, S., Ertl, B., Keim, D.A., Kriegel, H.-P., Seidl, T.: Fast nearest neighbor search in high-dimensional space. In: Proceedings of the 14th International Conference on Data Engineering, pp. 209–218. IEEE (1998)
2.
Zurück zum Zitat Borzsony, S., Kossmann, D., Stocker, K.: The skyline operator. In: Proceedings of the 17th International Conference on Data Engineering, pp. 421–430. IEEE (2001) Borzsony, S., Kossmann, D., Stocker, K.: The skyline operator. In: Proceedings of the 17th International Conference on Data Engineering, pp. 421–430. IEEE (2001)
3.
Zurück zum Zitat Dellis, E., Seeger, B.: Efficient computation of reverse skyline queries. In: Proceedings of the 33rd International Conference on Very Large Data Bases, pp. 291–302. VLDB Endowment (2007) Dellis, E., Seeger, B.: Efficient computation of reverse skyline queries. In: Proceedings of the 33rd International Conference on Very Large Data Bases, pp. 291–302. VLDB Endowment (2007)
4.
Zurück zum Zitat Fortune, S.: A sweepline algorithm for Voronoi diagrams. In: Proceedings of the Second Annual Symposium on Computational Geometry, pp. 313–322. ACM (1986) Fortune, S.: A sweepline algorithm for Voronoi diagrams. In: Proceedings of the Second Annual Symposium on Computational Geometry, pp. 313–322. ACM (1986)
6.
Zurück zum Zitat Hjaltason, G.R., Samet, H.: Distance browsing in spatial databases. ACM Trans. Database Syst. (TODS) 24(2), 265–318 (1999)CrossRef Hjaltason, G.R., Samet, H.: Distance browsing in spatial databases. ACM Trans. Database Syst. (TODS) 24(2), 265–318 (1999)CrossRef
7.
Zurück zum Zitat Korn, F., Muthukrishnan, S.: Influence sets based on reverse nearest neighbor queries. ACM SIGMOD Rec. 29, 201–212 (2000). ACMCrossRef Korn, F., Muthukrishnan, S.: Influence sets based on reverse nearest neighbor queries. ACM SIGMOD Rec. 29, 201–212 (2000). ACMCrossRef
8.
Zurück zum Zitat Papadias, D., Tao, Y., Fu, G., Seeger, B.: An optimal and progressive algorithm for skyline queries. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, pp. 467–478. ACM (2003) Papadias, D., Tao, Y., Fu, G., Seeger, B.: An optimal and progressive algorithm for skyline queries. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, pp. 467–478. ACM (2003)
9.
Zurück zum Zitat Papadias, D., Tao, Y., Greg, F., Seeger, B.: Progressive skyline computation in database systems. ACM Trans. Database Syst. (TODS) 30(1), 41–82 (2005)CrossRef Papadias, D., Tao, Y., Greg, F., Seeger, B.: Progressive skyline computation in database systems. ACM Trans. Database Syst. (TODS) 30(1), 41–82 (2005)CrossRef
10.
Zurück zum Zitat Papadopoulos, A., Manolopoulos, Y.: Performance of nearest neighbor queries in R-trees. In: Afrati, F., Kolaitis, P. (eds.) ICDT 1997. LNCS, vol. 1186, pp. 394–408. Springer, Heidelberg (1997). doi:10.1007/3-540-62222-5_59 Papadopoulos, A., Manolopoulos, Y.: Performance of nearest neighbor queries in R-trees. In: Afrati, F., Kolaitis, P. (eds.) ICDT 1997. LNCS, vol. 1186, pp. 394–408. Springer, Heidelberg (1997). doi:10.​1007/​3-540-62222-5_​59
11.
Zurück zum Zitat Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. ACM SIGMOD Rec. 24, 71–79 (1995). ACMCrossRef Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. ACM SIGMOD Rec. 24, 71–79 (1995). ACMCrossRef
12.
Zurück zum Zitat Shao, Z., Cheema, M.A., Taniar, D., Lu, H.: Vip-tree: an effective index for indoor spatial queries. PVLDB 10(4), 325–336 (2016) Shao, Z., Cheema, M.A., Taniar, D., Lu, H.: Vip-tree: an effective index for indoor spatial queries. PVLDB 10(4), 325–336 (2016)
13.
Zurück zum Zitat Sharifzadeh, M., Shahabi, C.: The spatial skyline queries. In: Proceedings of the 32nd International Conference on Very Large Data Bases, pp. 751–762. VLDB Endowment (2006) Sharifzadeh, M., Shahabi, C.: The spatial skyline queries. In: Proceedings of the 32nd International Conference on Very Large Data Bases, pp. 751–762. VLDB Endowment (2006)
14.
Zurück zum Zitat Stanoi, I., Agrawal, D., El Abbadi, A.: Reverse nearest neighbor queries for dynamic databases. In: ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 44–53 (2000) Stanoi, I., Agrawal, D., El Abbadi, A.: Reverse nearest neighbor queries for dynamic databases. In: ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 44–53 (2000)
15.
Zurück zum Zitat Taniar, D., Rahayu, W.: A taxonomy for nearest neighbour queries in spatial databases. J. Comput. Syst. Sci. 79(7), 1017–1039 (2013)MathSciNetCrossRefMATH Taniar, D., Rahayu, W.: A taxonomy for nearest neighbour queries in spatial databases. J. Comput. Syst. Sci. 79(7), 1017–1039 (2013)MathSciNetCrossRefMATH
16.
Zurück zum Zitat Taniar, D., Safar, M., Tran, Q.T., Rahayu, W., Park, J.H.: Spatial network RNN queries in GIS. Comput. J. 54(4), 617–627 (2011)CrossRef Taniar, D., Safar, M., Tran, Q.T., Rahayu, W., Park, J.H.: Spatial network RNN queries in GIS. Comput. J. 54(4), 617–627 (2011)CrossRef
17.
Zurück zum Zitat Tao, Y., Papadias, D., Lian, X.: Reverse \(K\)NN search in arbitrary dimensionality. In: Proceedings of the Thirtieth International Conference on Very Large Data Bases, vol. 30, pp. 744–755. VLDB Endowment (2004) Tao, Y., Papadias, D., Lian, X.: Reverse \(K\)NN search in arbitrary dimensionality. In: Proceedings of the Thirtieth International Conference on Very Large Data Bases, vol. 30, pp. 744–755. VLDB Endowment (2004)
18.
Zurück zum Zitat Xuan, K., Zhao, G., Taniar, D., Safar, M., Srinivasan, B.: Voronoi-based multi-level range search in mobile navigation. Multimedia Tools Appl. 53(2), 459–479 (2011)CrossRef Xuan, K., Zhao, G., Taniar, D., Safar, M., Srinivasan, B.: Voronoi-based multi-level range search in mobile navigation. Multimedia Tools Appl. 53(2), 459–479 (2011)CrossRef
19.
Zurück zum Zitat Yap, C.K.: Ano (n logn) algorithm for the Voronoi diagram of a set of simple curve segments. Discrete Comput. Geom. 2(1), 365–393 (1987)MathSciNetCrossRefMATH Yap, C.K.: Ano (n logn) algorithm for the Voronoi diagram of a set of simple curve segments. Discrete Comput. Geom. 2(1), 365–393 (1987)MathSciNetCrossRefMATH
Metadaten
Titel
Surrounding Join Query Processing in Spatial Databases
verfasst von
Lingxiao Li
David Taniar
Maria Indrawan-Santiago
Zhou Shao
Copyright-Jahr
2017
DOI
https://doi.org/10.1007/978-3-319-68155-9_2