Nowadays, a significant number of applications require the organization of data elements that contain at least one spatial attribute. R-trees have a simplicity of structure and, together with their resemblance to the B-tree, allow developers to incorporate them easily into existing database management systems for the support of spatial query processing. This book provides an extensive survey of the R-tree evolution, studying the applicability of the structure and its variations to efficient query processing, accurate proposed cost models, and implementation issues like concurrency control and parallelism.

The first comprehensive study on R-trees Not limited to a single application By presenting the specific application domains that each R-tree variant is applied, the authors help the reader to understand each variation and to select a proper variation according to their needs Discussion of various cost models and the implementation details of the methods Experimental results included for comparison of the various methods used as well as qualitative comparisons Includes supplementary material: sn.pub/extras

Autorentext

Apostolos N. Papadopoulos is an Associate Professor of Computer Science at the School of Informatics of Aristotle University of Thessaloniki (AUTH). He received his five-year Diploma Degree in Computer Engineering and Informatics from the University of Patras, and his Ph.D. Degree in Informatics from the School of Informatics (AUTH). His research interests include Data Management, Data Mining, and Big Data Analytics. He has served as a track co-chair of ACM SAC DTTA (Database Technologies Techniques and Applications) Track from 2005 until now, as well as a PC member in several International Conferences related to Data Management and Data Mining. He has co-presented four tutorials in ASONAM 2015, EDBT/ICDT 2016, ICDM 2016, and ECML/PKDD 2017 on the "Core Decomposition of Networks." The paper "SkyGraph: an algorithm for important subgraph discovery in relational graphs," Proceedings of ECML/PKDD, Antwerp, Belgium, 2008, received the Best Knowledge Discovery Paper Award, whereas the paper"Metric-Based Top-k Dominating Queries," Proceedings of the 17th International Conference on Extending Database Technology (EDBT), Athens, 2014, was selected as the best paper for publication in ACM Transactions on Database Systems. Based on Google Scholar, he has around 3200 citations in his research work.Eleftherios Tiakas received a B.Sc. in Mathematics (1994), a B.Sc. and an M.Sc. in Informatics (2006), and a Ph.D. in Informatics (2011), all the degrees from the Aristotle University of Thessaloniki (AUTH). During the period 2004-2017, he served as Teacher of Mathematics in Secondary Education. From 2011-2017, he served as Adjunct Lecturer with the School of Informatics of AUTH. Since 2017, he has been on the Laboratory Teaching Staff with the School of Informatics of AUTH. His areas of research interest include: Databases, Data Structures, Data Mining, Information Retrieval, Similarity Search, Social Networks, and Bioinformatics. He is the author/co-author of 30 articles published in international journals and conference proceedings, plus 2 book chapters. His publications have received over 600 citations. He participated in 11 research projects and programs funded by the European Union and Greece. Finally, he serves as a PC member and reviewer for several international journals and conferences.Theodoros Tzouramanis is an Assistant Professor in the Department of Computer Science and Biomedical Informatics of the University of Thessaly. He received a five-year Diploma Degree in Electrical and Computer Engineering and a Ph.D. in Informatics, both from the Aristotle University of Thessaloniki. Prior to his current position, he served from 2003-2019 as Lecturer and later as Assistant Professor in the Department of Information and Communication Systems Engineering of the University of the Aegean. He has also been teaching at the Hellenic Open University since 2005. His research interests focus on data management, data security, and privacy. More than50 articles of his work have appeared in refereed scientific journals, conference proceedings, and chapters in books.Nikolaos Georgiadisis a Ph.D. candidate at the School of Informatics of Aristotle University of Thessaloniki (AUTH). He has a B.Sc. in Software Engineering from the Technical University of Kavala and a M.Sc. in Information Systems from the School of Informatics of AUTH. His main research interests focus on efficient algorithmic techniques for Knowledge Discovery from Big Data. He has professional experience as a Software Engineer in the IT industry in various companies in Greece, Germany, and Switzerland for over 15 years.Yannis Manolopoulos is a Professor and Vice-rector of the Open University of Cyprus. He received a five-year Diploma Degree in Electrical Engineering and a Ph.D. in Computer Engineering, both from the Aristotle University of Thessaloniki (AUTH). He has been with the University of Toronto, the University of Maryland at College Park,th

Inhalt
Fundamental Concepts.- Dynamic Versions of R-trees.- Static Versions of R-trees.- Query Processing Issues.- Fundamental Query Processing Techniques.- Processing More Complex Queries.- R-Trees In Modern Applications.- R-trees in Spatiotemporal Databases.- R-trees for Multimedia, Warehousing and Mining.- Advanced Issues.- Query Optimization Issues.- Implementation Issues.