2013
DOI: 10.1109/tkde.2011.182
|View full text |Cite
|
Sign up to set email alerts
|

On the Recovery of R-Trees

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
9
0

Year Published

2013
2013
2018
2018

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 25 publications
(9 citation statements)
references
References 23 publications
0
9
0
Order By: Relevance
“…There are two main approaches in dealing with R-tree structure modifications [14]. In the first approach, a strict R-tree consistency (i.e., minimum-bounding-rectangles are kept as tight as possible to improve R-tree search-time) is applied, while in the second approach, a relaxed R-tree consistency (minimum-bounding-rectangles are not kept as tight as possible) is applied.…”
Section: Introductionmentioning
confidence: 99%
See 4 more Smart Citations
“…There are two main approaches in dealing with R-tree structure modifications [14]. In the first approach, a strict R-tree consistency (i.e., minimum-bounding-rectangles are kept as tight as possible to improve R-tree search-time) is applied, while in the second approach, a relaxed R-tree consistency (minimum-bounding-rectangles are not kept as tight as possible) is applied.…”
Section: Introductionmentioning
confidence: 99%
“…In the strict R-tree consistency approach [14], when an updating transaction T (inserting or deleting an object) reaches a leaf node and finds out that a tree structure modification is needed, then T releases its S lock on that node and retraverses the R-tree from the root using lock-coupling with U locks, and U-locks all the pages on the tree structure modification path. Then T performs the structure modifications bottom-up on these pages, where the U locks on these pages are upgraded to X locks.…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations