Performance Evaluation of Lazy Deletion Methods in R-trees
Abstract Motivated by the way R-trees are implemented in commercial databases systems, in this paper we examine several deletion techniques for R-trees. In particular, in commercial systems R-tree entries are mapped onto relational tables, which implement their own concurrency protocols on top of ex...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Nanopoulos, Alexandros [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2003 |
|---|
| Anmerkung: |
© Kluwer Academic Publishers 2003 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Geoinformatica - Kluwer Academic Publishers, 1997, 7(2003), 4 vom: Dez., Seite 337-354 |
|---|---|
| Übergeordnetes Werk: |
volume:7 ; year:2003 ; number:4 ; month:12 ; pages:337-354 |
| Links: |
|---|
| DOI / URN: |
10.1023/A:1025521422319 |
|---|
| Katalog-ID: |
OLC2038961085 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2038961085 | ||
| 003 | DE-627 | ||
| 005 | 20230503062809.0 | ||
| 007 | tu | ||
| 008 | 200819s2003 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1023/A:1025521422319 |2 doi | |
| 035 | |a (DE-627)OLC2038961085 | ||
| 035 | |a (DE-He213)A:1025521422319-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 550 |q VZ |
| 100 | 1 | |a Nanopoulos, Alexandros |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Performance Evaluation of Lazy Deletion Methods in R-trees |
| 264 | 1 | |c 2003 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Kluwer Academic Publishers 2003 | ||
| 520 | |a Abstract Motivated by the way R-trees are implemented in commercial databases systems, in this paper we examine several deletion techniques for R-trees. In particular, in commercial systems R-tree entries are mapped onto relational tables, which implement their own concurrency protocols on top of existing table-level concurrency mechanisms. In analogy, the actual industrial implementations of B-trees do not apply the well-known merging procedure from textbooks in case of node underflows, but rather they apply the free-at-empty technique. This way, space is sacrificed for the benefit of faster deletions and less locking operations, whereas the search performance practically remains unaffected. In this context, we examine the efficiency of modifications to the original R-tree deletion algorithm, which relax certain constraints of this algorithm and perform a controlled reorganization procedure according to a specified criterion. We present the modified algorithms and experimental results about the impact of these modifications on the tree quality, the execution time for the deletion operation and the processing time of search queries, considering several parameters. The experimental results indicate that the modified algorithms improve the efficiency of the deletion operation, while they do not affect the quality of the R-tree and its performance with respect to search operations. | ||
| 700 | 1 | |a Vassilakopoulos, Michael |4 aut | |
| 700 | 1 | |a Manolopoulos, Yannis |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Geoinformatica |d Kluwer Academic Publishers, 1997 |g 7(2003), 4 vom: Dez., Seite 337-354 |w (DE-627)223334499 |w (DE-600)1357836-4 |w (DE-576)307633454 |x 1384-6175 |7 nnns |
| 773 | 1 | 8 | |g volume:7 |g year:2003 |g number:4 |g month:12 |g pages:337-354 |
| 856 | 4 | 1 | |u https://doi.org/10.1023/A:1025521422319 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-GEO | ||
| 912 | |a GBV_ILN_11 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_100 | ||
| 912 | |a GBV_ILN_131 | ||
| 912 | |a GBV_ILN_4318 | ||
| 912 | |a GBV_ILN_4700 | ||
| 951 | |a AR | ||
| 952 | |d 7 |j 2003 |e 4 |c 12 |h 337-354 | ||
| author_variant |
a n an m v mv y m ym |
|---|---|
| matchkey_str |
article:13846175:2003----::efraceautoolzdltom |
| hierarchy_sort_str |
2003 |
| publishDate |
2003 |
| allfields |
10.1023/A:1025521422319 doi (DE-627)OLC2038961085 (DE-He213)A:1025521422319-p DE-627 ger DE-627 rakwb eng 550 VZ Nanopoulos, Alexandros verfasserin aut Performance Evaluation of Lazy Deletion Methods in R-trees 2003 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Kluwer Academic Publishers 2003 Abstract Motivated by the way R-trees are implemented in commercial databases systems, in this paper we examine several deletion techniques for R-trees. In particular, in commercial systems R-tree entries are mapped onto relational tables, which implement their own concurrency protocols on top of existing table-level concurrency mechanisms. In analogy, the actual industrial implementations of B-trees do not apply the well-known merging procedure from textbooks in case of node underflows, but rather they apply the free-at-empty technique. This way, space is sacrificed for the benefit of faster deletions and less locking operations, whereas the search performance practically remains unaffected. In this context, we examine the efficiency of modifications to the original R-tree deletion algorithm, which relax certain constraints of this algorithm and perform a controlled reorganization procedure according to a specified criterion. We present the modified algorithms and experimental results about the impact of these modifications on the tree quality, the execution time for the deletion operation and the processing time of search queries, considering several parameters. The experimental results indicate that the modified algorithms improve the efficiency of the deletion operation, while they do not affect the quality of the R-tree and its performance with respect to search operations. Vassilakopoulos, Michael aut Manolopoulos, Yannis aut Enthalten in Geoinformatica Kluwer Academic Publishers, 1997 7(2003), 4 vom: Dez., Seite 337-354 (DE-627)223334499 (DE-600)1357836-4 (DE-576)307633454 1384-6175 nnns volume:7 year:2003 number:4 month:12 pages:337-354 https://doi.org/10.1023/A:1025521422319 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-GEO GBV_ILN_11 GBV_ILN_70 GBV_ILN_100 GBV_ILN_131 GBV_ILN_4318 GBV_ILN_4700 AR 7 2003 4 12 337-354 |
| spelling |
10.1023/A:1025521422319 doi (DE-627)OLC2038961085 (DE-He213)A:1025521422319-p DE-627 ger DE-627 rakwb eng 550 VZ Nanopoulos, Alexandros verfasserin aut Performance Evaluation of Lazy Deletion Methods in R-trees 2003 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Kluwer Academic Publishers 2003 Abstract Motivated by the way R-trees are implemented in commercial databases systems, in this paper we examine several deletion techniques for R-trees. In particular, in commercial systems R-tree entries are mapped onto relational tables, which implement their own concurrency protocols on top of existing table-level concurrency mechanisms. In analogy, the actual industrial implementations of B-trees do not apply the well-known merging procedure from textbooks in case of node underflows, but rather they apply the free-at-empty technique. This way, space is sacrificed for the benefit of faster deletions and less locking operations, whereas the search performance practically remains unaffected. In this context, we examine the efficiency of modifications to the original R-tree deletion algorithm, which relax certain constraints of this algorithm and perform a controlled reorganization procedure according to a specified criterion. We present the modified algorithms and experimental results about the impact of these modifications on the tree quality, the execution time for the deletion operation and the processing time of search queries, considering several parameters. The experimental results indicate that the modified algorithms improve the efficiency of the deletion operation, while they do not affect the quality of the R-tree and its performance with respect to search operations. Vassilakopoulos, Michael aut Manolopoulos, Yannis aut Enthalten in Geoinformatica Kluwer Academic Publishers, 1997 7(2003), 4 vom: Dez., Seite 337-354 (DE-627)223334499 (DE-600)1357836-4 (DE-576)307633454 1384-6175 nnns volume:7 year:2003 number:4 month:12 pages:337-354 https://doi.org/10.1023/A:1025521422319 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-GEO GBV_ILN_11 GBV_ILN_70 GBV_ILN_100 GBV_ILN_131 GBV_ILN_4318 GBV_ILN_4700 AR 7 2003 4 12 337-354 |
| allfields_unstemmed |
10.1023/A:1025521422319 doi (DE-627)OLC2038961085 (DE-He213)A:1025521422319-p DE-627 ger DE-627 rakwb eng 550 VZ Nanopoulos, Alexandros verfasserin aut Performance Evaluation of Lazy Deletion Methods in R-trees 2003 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Kluwer Academic Publishers 2003 Abstract Motivated by the way R-trees are implemented in commercial databases systems, in this paper we examine several deletion techniques for R-trees. In particular, in commercial systems R-tree entries are mapped onto relational tables, which implement their own concurrency protocols on top of existing table-level concurrency mechanisms. In analogy, the actual industrial implementations of B-trees do not apply the well-known merging procedure from textbooks in case of node underflows, but rather they apply the free-at-empty technique. This way, space is sacrificed for the benefit of faster deletions and less locking operations, whereas the search performance practically remains unaffected. In this context, we examine the efficiency of modifications to the original R-tree deletion algorithm, which relax certain constraints of this algorithm and perform a controlled reorganization procedure according to a specified criterion. We present the modified algorithms and experimental results about the impact of these modifications on the tree quality, the execution time for the deletion operation and the processing time of search queries, considering several parameters. The experimental results indicate that the modified algorithms improve the efficiency of the deletion operation, while they do not affect the quality of the R-tree and its performance with respect to search operations. Vassilakopoulos, Michael aut Manolopoulos, Yannis aut Enthalten in Geoinformatica Kluwer Academic Publishers, 1997 7(2003), 4 vom: Dez., Seite 337-354 (DE-627)223334499 (DE-600)1357836-4 (DE-576)307633454 1384-6175 nnns volume:7 year:2003 number:4 month:12 pages:337-354 https://doi.org/10.1023/A:1025521422319 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-GEO GBV_ILN_11 GBV_ILN_70 GBV_ILN_100 GBV_ILN_131 GBV_ILN_4318 GBV_ILN_4700 AR 7 2003 4 12 337-354 |
| allfieldsGer |
10.1023/A:1025521422319 doi (DE-627)OLC2038961085 (DE-He213)A:1025521422319-p DE-627 ger DE-627 rakwb eng 550 VZ Nanopoulos, Alexandros verfasserin aut Performance Evaluation of Lazy Deletion Methods in R-trees 2003 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Kluwer Academic Publishers 2003 Abstract Motivated by the way R-trees are implemented in commercial databases systems, in this paper we examine several deletion techniques for R-trees. In particular, in commercial systems R-tree entries are mapped onto relational tables, which implement their own concurrency protocols on top of existing table-level concurrency mechanisms. In analogy, the actual industrial implementations of B-trees do not apply the well-known merging procedure from textbooks in case of node underflows, but rather they apply the free-at-empty technique. This way, space is sacrificed for the benefit of faster deletions and less locking operations, whereas the search performance practically remains unaffected. In this context, we examine the efficiency of modifications to the original R-tree deletion algorithm, which relax certain constraints of this algorithm and perform a controlled reorganization procedure according to a specified criterion. We present the modified algorithms and experimental results about the impact of these modifications on the tree quality, the execution time for the deletion operation and the processing time of search queries, considering several parameters. The experimental results indicate that the modified algorithms improve the efficiency of the deletion operation, while they do not affect the quality of the R-tree and its performance with respect to search operations. Vassilakopoulos, Michael aut Manolopoulos, Yannis aut Enthalten in Geoinformatica Kluwer Academic Publishers, 1997 7(2003), 4 vom: Dez., Seite 337-354 (DE-627)223334499 (DE-600)1357836-4 (DE-576)307633454 1384-6175 nnns volume:7 year:2003 number:4 month:12 pages:337-354 https://doi.org/10.1023/A:1025521422319 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-GEO GBV_ILN_11 GBV_ILN_70 GBV_ILN_100 GBV_ILN_131 GBV_ILN_4318 GBV_ILN_4700 AR 7 2003 4 12 337-354 |
| allfieldsSound |
10.1023/A:1025521422319 doi (DE-627)OLC2038961085 (DE-He213)A:1025521422319-p DE-627 ger DE-627 rakwb eng 550 VZ Nanopoulos, Alexandros verfasserin aut Performance Evaluation of Lazy Deletion Methods in R-trees 2003 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Kluwer Academic Publishers 2003 Abstract Motivated by the way R-trees are implemented in commercial databases systems, in this paper we examine several deletion techniques for R-trees. In particular, in commercial systems R-tree entries are mapped onto relational tables, which implement their own concurrency protocols on top of existing table-level concurrency mechanisms. In analogy, the actual industrial implementations of B-trees do not apply the well-known merging procedure from textbooks in case of node underflows, but rather they apply the free-at-empty technique. This way, space is sacrificed for the benefit of faster deletions and less locking operations, whereas the search performance practically remains unaffected. In this context, we examine the efficiency of modifications to the original R-tree deletion algorithm, which relax certain constraints of this algorithm and perform a controlled reorganization procedure according to a specified criterion. We present the modified algorithms and experimental results about the impact of these modifications on the tree quality, the execution time for the deletion operation and the processing time of search queries, considering several parameters. The experimental results indicate that the modified algorithms improve the efficiency of the deletion operation, while they do not affect the quality of the R-tree and its performance with respect to search operations. Vassilakopoulos, Michael aut Manolopoulos, Yannis aut Enthalten in Geoinformatica Kluwer Academic Publishers, 1997 7(2003), 4 vom: Dez., Seite 337-354 (DE-627)223334499 (DE-600)1357836-4 (DE-576)307633454 1384-6175 nnns volume:7 year:2003 number:4 month:12 pages:337-354 https://doi.org/10.1023/A:1025521422319 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-GEO GBV_ILN_11 GBV_ILN_70 GBV_ILN_100 GBV_ILN_131 GBV_ILN_4318 GBV_ILN_4700 AR 7 2003 4 12 337-354 |
| language |
English |
| source |
Enthalten in Geoinformatica 7(2003), 4 vom: Dez., Seite 337-354 volume:7 year:2003 number:4 month:12 pages:337-354 |
| sourceStr |
Enthalten in Geoinformatica 7(2003), 4 vom: Dez., Seite 337-354 volume:7 year:2003 number:4 month:12 pages:337-354 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| dewey-raw |
550 |
| isfreeaccess_bool |
false |
| container_title |
Geoinformatica |
| authorswithroles_txt_mv |
Nanopoulos, Alexandros @@aut@@ Vassilakopoulos, Michael @@aut@@ Manolopoulos, Yannis @@aut@@ |
| publishDateDaySort_date |
2003-12-01T00:00:00Z |
| hierarchy_top_id |
223334499 |
| dewey-sort |
3550 |
| id |
OLC2038961085 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2038961085</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503062809.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2003 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1023/A:1025521422319</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2038961085</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)A:1025521422319-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">550</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Nanopoulos, Alexandros</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Performance Evaluation of Lazy Deletion Methods in R-trees</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2003</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Kluwer Academic Publishers 2003</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Motivated by the way R-trees are implemented in commercial databases systems, in this paper we examine several deletion techniques for R-trees. In particular, in commercial systems R-tree entries are mapped onto relational tables, which implement their own concurrency protocols on top of existing table-level concurrency mechanisms. In analogy, the actual industrial implementations of B-trees do not apply the well-known merging procedure from textbooks in case of node underflows, but rather they apply the free-at-empty technique. This way, space is sacrificed for the benefit of faster deletions and less locking operations, whereas the search performance practically remains unaffected. In this context, we examine the efficiency of modifications to the original R-tree deletion algorithm, which relax certain constraints of this algorithm and perform a controlled reorganization procedure according to a specified criterion. We present the modified algorithms and experimental results about the impact of these modifications on the tree quality, the execution time for the deletion operation and the processing time of search queries, considering several parameters. The experimental results indicate that the modified algorithms improve the efficiency of the deletion operation, while they do not affect the quality of the R-tree and its performance with respect to search operations.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Vassilakopoulos, Michael</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Manolopoulos, Yannis</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Geoinformatica</subfield><subfield code="d">Kluwer Academic Publishers, 1997</subfield><subfield code="g">7(2003), 4 vom: Dez., Seite 337-354</subfield><subfield code="w">(DE-627)223334499</subfield><subfield code="w">(DE-600)1357836-4</subfield><subfield code="w">(DE-576)307633454</subfield><subfield code="x">1384-6175</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:7</subfield><subfield code="g">year:2003</subfield><subfield code="g">number:4</subfield><subfield code="g">month:12</subfield><subfield code="g">pages:337-354</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1023/A:1025521422319</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-GEO</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_131</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">7</subfield><subfield code="j">2003</subfield><subfield code="e">4</subfield><subfield code="c">12</subfield><subfield code="h">337-354</subfield></datafield></record></collection>
|
| author |
Nanopoulos, Alexandros |
| spellingShingle |
Nanopoulos, Alexandros ddc 550 Performance Evaluation of Lazy Deletion Methods in R-trees |
| authorStr |
Nanopoulos, Alexandros |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)223334499 |
| format |
Article |
| dewey-ones |
550 - Earth sciences |
| delete_txt_mv |
keep |
| author_role |
aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1384-6175 |
| topic_title |
550 VZ Performance Evaluation of Lazy Deletion Methods in R-trees |
| topic |
ddc 550 |
| topic_unstemmed |
ddc 550 |
| topic_browse |
ddc 550 |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Geoinformatica |
| hierarchy_parent_id |
223334499 |
| dewey-tens |
550 - Earth sciences & geology |
| hierarchy_top_title |
Geoinformatica |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)223334499 (DE-600)1357836-4 (DE-576)307633454 |
| title |
Performance Evaluation of Lazy Deletion Methods in R-trees |
| ctrlnum |
(DE-627)OLC2038961085 (DE-He213)A:1025521422319-p |
| title_full |
Performance Evaluation of Lazy Deletion Methods in R-trees |
| author_sort |
Nanopoulos, Alexandros |
| journal |
Geoinformatica |
| journalStr |
Geoinformatica |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
500 - Science |
| recordtype |
marc |
| publishDateSort |
2003 |
| contenttype_str_mv |
txt |
| container_start_page |
337 |
| author_browse |
Nanopoulos, Alexandros Vassilakopoulos, Michael Manolopoulos, Yannis |
| container_volume |
7 |
| class |
550 VZ |
| format_se |
Aufsätze |
| author-letter |
Nanopoulos, Alexandros |
| doi_str_mv |
10.1023/A:1025521422319 |
| dewey-full |
550 |
| title_sort |
performance evaluation of lazy deletion methods in r-trees |
| title_auth |
Performance Evaluation of Lazy Deletion Methods in R-trees |
| abstract |
Abstract Motivated by the way R-trees are implemented in commercial databases systems, in this paper we examine several deletion techniques for R-trees. In particular, in commercial systems R-tree entries are mapped onto relational tables, which implement their own concurrency protocols on top of existing table-level concurrency mechanisms. In analogy, the actual industrial implementations of B-trees do not apply the well-known merging procedure from textbooks in case of node underflows, but rather they apply the free-at-empty technique. This way, space is sacrificed for the benefit of faster deletions and less locking operations, whereas the search performance practically remains unaffected. In this context, we examine the efficiency of modifications to the original R-tree deletion algorithm, which relax certain constraints of this algorithm and perform a controlled reorganization procedure according to a specified criterion. We present the modified algorithms and experimental results about the impact of these modifications on the tree quality, the execution time for the deletion operation and the processing time of search queries, considering several parameters. The experimental results indicate that the modified algorithms improve the efficiency of the deletion operation, while they do not affect the quality of the R-tree and its performance with respect to search operations. © Kluwer Academic Publishers 2003 |
| abstractGer |
Abstract Motivated by the way R-trees are implemented in commercial databases systems, in this paper we examine several deletion techniques for R-trees. In particular, in commercial systems R-tree entries are mapped onto relational tables, which implement their own concurrency protocols on top of existing table-level concurrency mechanisms. In analogy, the actual industrial implementations of B-trees do not apply the well-known merging procedure from textbooks in case of node underflows, but rather they apply the free-at-empty technique. This way, space is sacrificed for the benefit of faster deletions and less locking operations, whereas the search performance practically remains unaffected. In this context, we examine the efficiency of modifications to the original R-tree deletion algorithm, which relax certain constraints of this algorithm and perform a controlled reorganization procedure according to a specified criterion. We present the modified algorithms and experimental results about the impact of these modifications on the tree quality, the execution time for the deletion operation and the processing time of search queries, considering several parameters. The experimental results indicate that the modified algorithms improve the efficiency of the deletion operation, while they do not affect the quality of the R-tree and its performance with respect to search operations. © Kluwer Academic Publishers 2003 |
| abstract_unstemmed |
Abstract Motivated by the way R-trees are implemented in commercial databases systems, in this paper we examine several deletion techniques for R-trees. In particular, in commercial systems R-tree entries are mapped onto relational tables, which implement their own concurrency protocols on top of existing table-level concurrency mechanisms. In analogy, the actual industrial implementations of B-trees do not apply the well-known merging procedure from textbooks in case of node underflows, but rather they apply the free-at-empty technique. This way, space is sacrificed for the benefit of faster deletions and less locking operations, whereas the search performance practically remains unaffected. In this context, we examine the efficiency of modifications to the original R-tree deletion algorithm, which relax certain constraints of this algorithm and perform a controlled reorganization procedure according to a specified criterion. We present the modified algorithms and experimental results about the impact of these modifications on the tree quality, the execution time for the deletion operation and the processing time of search queries, considering several parameters. The experimental results indicate that the modified algorithms improve the efficiency of the deletion operation, while they do not affect the quality of the R-tree and its performance with respect to search operations. © Kluwer Academic Publishers 2003 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-GEO GBV_ILN_11 GBV_ILN_70 GBV_ILN_100 GBV_ILN_131 GBV_ILN_4318 GBV_ILN_4700 |
| container_issue |
4 |
| title_short |
Performance Evaluation of Lazy Deletion Methods in R-trees |
| url |
https://doi.org/10.1023/A:1025521422319 |
| remote_bool |
false |
| author2 |
Vassilakopoulos, Michael Manolopoulos, Yannis |
| author2Str |
Vassilakopoulos, Michael Manolopoulos, Yannis |
| ppnlink |
223334499 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1023/A:1025521422319 |
| up_date |
2024-07-03T21:01:02.104Z |
| _version_ |
1803593147594309633 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2038961085</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503062809.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2003 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1023/A:1025521422319</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2038961085</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)A:1025521422319-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">550</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Nanopoulos, Alexandros</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Performance Evaluation of Lazy Deletion Methods in R-trees</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2003</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Kluwer Academic Publishers 2003</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Motivated by the way R-trees are implemented in commercial databases systems, in this paper we examine several deletion techniques for R-trees. In particular, in commercial systems R-tree entries are mapped onto relational tables, which implement their own concurrency protocols on top of existing table-level concurrency mechanisms. In analogy, the actual industrial implementations of B-trees do not apply the well-known merging procedure from textbooks in case of node underflows, but rather they apply the free-at-empty technique. This way, space is sacrificed for the benefit of faster deletions and less locking operations, whereas the search performance practically remains unaffected. In this context, we examine the efficiency of modifications to the original R-tree deletion algorithm, which relax certain constraints of this algorithm and perform a controlled reorganization procedure according to a specified criterion. We present the modified algorithms and experimental results about the impact of these modifications on the tree quality, the execution time for the deletion operation and the processing time of search queries, considering several parameters. The experimental results indicate that the modified algorithms improve the efficiency of the deletion operation, while they do not affect the quality of the R-tree and its performance with respect to search operations.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Vassilakopoulos, Michael</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Manolopoulos, Yannis</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Geoinformatica</subfield><subfield code="d">Kluwer Academic Publishers, 1997</subfield><subfield code="g">7(2003), 4 vom: Dez., Seite 337-354</subfield><subfield code="w">(DE-627)223334499</subfield><subfield code="w">(DE-600)1357836-4</subfield><subfield code="w">(DE-576)307633454</subfield><subfield code="x">1384-6175</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:7</subfield><subfield code="g">year:2003</subfield><subfield code="g">number:4</subfield><subfield code="g">month:12</subfield><subfield code="g">pages:337-354</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1023/A:1025521422319</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-GEO</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_131</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">7</subfield><subfield code="j">2003</subfield><subfield code="e">4</subfield><subfield code="c">12</subfield><subfield code="h">337-354</subfield></datafield></record></collection>
|
| score |
7.399349 |