Name
Abstract | ||
|---|---|---|
Recently, researches have been performed on a general method that can improve the cache performance of the R-Tree in the main memory to reduce the size of an entry so that a node can store more entries. However, this method generally requires additional processes to reduce information of entries. In addition, the cache miss always occurs on moving between a parent node and a child node. To solve these problems, this paper proposes the SPR-Tree (Selective Prefetching R-Tree), which is an extended R-Tree indexing method using selective prefetching according to node size in the main memory. The SPR-Tree can produce wider nodes to optimize prefetching without additional modifications on the R-Tree. Moreover, the SPR-Tree can reduce the cache miss that can occur in the R-Tree. In our simulation, the search, insert, and delete performance of the SPR-Tree improved up to 40%, 10%, 30% respectively, compared with the R-Tree. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-72584-8_92 | International Conference on Computational Science (1) |
Keywords | Field | DocType |
extended r-tree indexing method,additional modification,main memory,additional process,wider node,selective prefetching r-tree,parent node,general method,cache performance,child node | R-tree,Cache invalidation,Cache pollution,Computer science,Cache,Parallel computing,Page cache,Cache algorithms,Cache coloring,Smart Cache | Conference |
Volume | ISSN | Citations |
4487 | 0302-9743 | 1 |
PageRank | References | Authors |
0.35 | 9 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hong-Koo Kang | 1 | 8 | 3.91 |
| Joung-Joon Kim | 2 | 4 | 1.78 |
| Dong-Oh Kim | 3 | 15 | 6.72 |
| Ki-Joon Han | 4 | 26 | 6.76 |