R-Trees: Theory and Applications (Advanced Information and Knowledge Processing) - Softcover

Über die Autorin bzw. den Autor

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.

Von der hinteren Coverseite

Nowadays, a significant number of applications require the organization of data elements which contain at least one spatial attribute. Space support in databases poses new challenges in every part of a database management system and the capability of spatial support in the physical layer is considered very important. This has led to the design of spatial access methods to enable the effective and efficient management of spatial objects.

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. Based on the observation that ``space is everywhere", the authors anticipate that we are in the beginning of the era of the ``ubiquitous R-tree" analogous to the way B-trees were considered 25 years ago. Written for database researchers, designers and programmers as well as graduate students, this comprehensive monograph will be a welcome addition to the field.

The book successfully integrates research results of the last 20 years, in a clear and highly readable manner. It is the first book dedicated to R-trees and related access methods, and I believe it will be valuable as a reference to everyone interested in the area.

Prof. Timos Sellis, National Technical University of Athens