An-Najah University Journal for Research - A (Natural Sciences)

Global Center Point Splitting: New Linear Node Splitting Algorithm for R-Trees
Authors:

Article info

2015-04-04
2015-12-21
2016-03-03
111 - 126

Keywords

  • R-Tree index
  • query performance.
  • spatial databases

Abstract

We introduce a new linear algorithm to split overflowed nodes of an R-tree index called the Global Center Point Splitting (GCPS) algorithm. The proposed method is an enhancement of the Quadratic splitting algorithm proposed by Guttmann (Guttman A, 1984; 47–57). Most known algorithms do not take advantage of the fact that most spatial objects data is known beforehand, and these objects are relatively easy to identify. In this paper we have adopted an informative approach by making use of spatial information provided by the problem space. Objects in the problem space are scanned and the Global Center Point (GCP) that the objects are concentrated around is determined. The GCPS algorithm uses the proximity between the Global Center Point (GCP) and the remaining objects in selecting a splitting axis that produces the most even split. We conducted several experiments using both real and synthetic data sets. Results show that the proposed splitting method outperforms the quadratic version in terms of construction time especially for nodes with high capacity. The query performance approximately remains the same.

Recommended Citation

Arafat, M. (2016). Global Center Point Splitting: New Linear Node Splitting Algorithm for R-Trees. An-Najah University Journal for Research - A (Natural Sciences), 30(1), 111–126. https://doi.org/10.35552/anujr.a.30.1.1176
[1]M. Arafat, “Global Center Point Splitting: New Linear Node Splitting Algorithm for R-Trees,” An-Najah University Journal for Research - A (Natural Sciences), vol. 30, no. 1, pp. 111–126, Feb. 2016, doi: 10.35552/anujr.a.30.1.1176.
Arafat, Manar. “Global Center Point Splitting: New Linear Node Splitting Algorithm for R-Trees.” An-Najah University Journal for Research - A (Natural Sciences), vol. 30, no. 1, Feb. 2016, pp. 111–26. Crossref, https://doi.org/10.35552/anujr.a.30.1.1176.
1.Arafat M. Global Center Point Splitting: New Linear Node Splitting Algorithm for R-Trees. An-Najah University Journal for Research - A (Natural Sciences) [Internet]. 2016 Feb;30(1):111–26. Available from: http://dx.doi.org/10.35552/anujr.a.30.1.1176
Arafat, Manar. “Global Center Point Splitting: New Linear Node Splitting Algorithm for R-Trees.” An-Najah University Journal for Research - A (Natural Sciences) 30, no. 1 (February 2016): 111–26. https://doi.org/10.35552/anujr.a.30.1.1176.

التقسيم حول نقطة المركز العام: خوارزمية خطية جديده لتقسيم عقدة في دليل R-tree لقواعد البيانات
المؤلفون:

معلومات المقال

2015-04-04
2015-12-21
2016-03-03
111 - 126

الكلمات الإفتتاحية

  • R-Tree index
  • query performance.
  • spatial databases

الملخص

في هذا البحث سنقوم بتقديم خوارزمية خطية جديده لتقسيم عقدة ممتلئة في دليل R-tree لقواعد البيانات تسمى خوارزمية التقسيم حول المركز العام (GCPS). هذه الخوارزمية هي تحسين للخوارزمية ذات الدرجة الثانية التي تم طرحها من قبل (Guttman, A. 1984; 47–57) Guttmann. معظم الخوارزميات لا تستفيد من حقيقة ان معظم البيانات ثنائية الفضاء معروفة مسبقا. في هذا البحث سنستفيد من هذه البيانات في ايجاد نقطة المركز العام (GCP) التي تتجمع حولها هذه البيانات، وبناء على تقارب البيانات مع هذه النقطة, تقوم خوارزمية (GCPS) بتحديد المحور الامثل لتقسيم البيانات. لقد قمنا باجراء اختبارات للخوارزمية الجديدة باستخدام بيانات حقيقية وبيانات مصطنعة. النتائج تشير الى ان الخوارزمية الجديدة مقارنة -بالخوارزمية ذات الدرجة الثانية- تعطي نتائج افضل. حيث ان وقت بناء دليل قاعدة البيانات يصبح اقل مع المحافظة على نفس الاداء.

Recommended Citation

Arafat, M. (2016). Global Center Point Splitting: New Linear Node Splitting Algorithm for R-Trees. An-Najah University Journal for Research - A (Natural Sciences), 30(1), 111–126. https://doi.org/10.35552/anujr.a.30.1.1176
[1]M. Arafat, “Global Center Point Splitting: New Linear Node Splitting Algorithm for R-Trees,” An-Najah University Journal for Research - A (Natural Sciences), vol. 30, no. 1, pp. 111–126, Feb. 2016, doi: 10.35552/anujr.a.30.1.1176.
Arafat, Manar. “Global Center Point Splitting: New Linear Node Splitting Algorithm for R-Trees.” An-Najah University Journal for Research - A (Natural Sciences), vol. 30, no. 1, Feb. 2016, pp. 111–26. Crossref, https://doi.org/10.35552/anujr.a.30.1.1176.
1.Arafat M. Global Center Point Splitting: New Linear Node Splitting Algorithm for R-Trees. An-Najah University Journal for Research - A (Natural Sciences) [Internet]. 2016 Feb;30(1):111–26. Available from: http://dx.doi.org/10.35552/anujr.a.30.1.1176
Arafat, Manar. “Global Center Point Splitting: New Linear Node Splitting Algorithm for R-Trees.” An-Najah University Journal for Research - A (Natural Sciences) 30, no. 1 (February 2016): 111–26. https://doi.org/10.35552/anujr.a.30.1.1176.

An-Najah National University
Nablus, Palestine
P.O. Box
7, 707
Fax
(970)(9)2345982
Tel.
(970)(9)2345560
(970)(9)2345113/5/6/7-Ext. 2628
E-mail
[email protected]
EIC
Prof. Ismail Warad

An-Najah University Journal for Research - A (Natural Sciences) by An-Najah University, Nablus, Palestine is licensed under CC BY-NC 4.0