Titlebook: R-Trees: Theory and Applications; Yannis Manolopoulos,Alexandros Nanopoulos,Yannis T Book 2006 Springer-Verlag London 2006 Access Methods.

難免

書目名稱R-Trees: Theory and Applications影響因子(影響力)




書目名稱R-Trees: Theory and Applications影響因子(影響力)學(xué)科排名




書目名稱R-Trees: Theory and Applications網(wǎng)絡(luò)公開度




書目名稱R-Trees: Theory and Applications網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱R-Trees: Theory and Applications被引頻次




書目名稱R-Trees: Theory and Applications被引頻次學(xué)科排名




書目名稱R-Trees: Theory and Applications年度引用




書目名稱R-Trees: Theory and Applications年度引用學(xué)科排名




書目名稱R-Trees: Theory and Applications讀者反饋




書目名稱R-Trees: Theory and Applications讀者反饋學(xué)科排名

ALTER

1610-3947 variant is applied, the authors help the reader to understa.Space support in databases poses new challenges in every part of a database management system & the capability of spatial support in the physical layer is considered very important. This has led to the design of spatial access methods to e

cluster

Introduction not just a theoretical notion. On the contrary, for years they have been the de facto standard access method in all prototype and commercial relational systems for typical transaction processing applications, although one could observe that some quite more elegant and efficient structures have appeared in the literature.

冒煙

Fundamental Query Processing Techniquesefulness of the aforementioned query types is significant, several more complex extensions have been proposed. However, in this chapter we focus on the fundamental techniques and leave the examination of the more complex extensions for the next chapter.

Contend

Static Versions of R-treesinations of these. Therefore, it is anticipated that query processing performance will be improved. These methods are well known in the literature as . or .. Thus, we next examine such methods that require the data to be known in advance.

斷斷續(xù)續(xù)

Processing More Complex Queriesresent extensions to spatial join queries. These queries require significant I/O and CPU cost, and therefore sophisticated methods have be applied to reduce processing cost. Finally, approximate query processing techniques are presented that sacrifice accuracy for better performance.

cartilage

Exclaim

共棲

Dynamic Versions of R-treesntages and disadvantages of the variations in a more exhaustive manner. As the number of variants that have appeared in the literature is large, we group them according to the special characteristics of the assumed environment or application, and we examine the members of each group.

Range-Of-Motion

R-trees for Multimedia, Warehousing and Mining of a user query, researchers studied the application of indexing techniques to the aforementioned advanced applications as well. In this chapter, we focus on the application of the R-tree access method to the efficient handling end processing of multimedia queries, data warehousing operations, and data mining tasks.