000 03955nam a22005655i 4500
001 978-1-84628-293-5
003 DE-He213
005 20170628033851.0
007 cr nn 008mamaa
008 100904s2006 xxk| s |||| 0|eng d
020 _a9781846282935
_9978-1-84628-293-5
024 7 _a10.1007/978-1-84628-293-5
_2doi
050 4 _aQA76.9.D3
072 7 _aUN
_2bicssc
072 7 _aUMT
_2bicssc
072 7 _aCOM021000
_2bisacsh
082 0 4 _a005.74
_223
100 1 _aManolopoulos, Yannis.
_eauthor.
245 1 0 _aR-Trees: Theory and Applications
_h[electronic resource] /
_cby Yannis Manolopoulos, Alexandros Nanopoulos, Apostolos N. Papadopoulos, Yannis Theodoridis.
264 1 _aLondon :
_bSpringer London,
_c2006.
300 _aXIX, 194p. 77 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aAdvanced Information and Knowledge Processing,
_x1610-3947
505 0 _aFundamental 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.
520 _aNowadays, 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
650 0 _aComputer science.
650 0 _aData structures (Computer science).
650 0 _aComputer files.
650 0 _aDatabase management.
650 0 _aInformation storage and retrieval systems.
650 1 4 _aComputer Science.
650 2 4 _aDatabase Management.
650 2 4 _aData Storage Representation.
650 2 4 _aData Structures.
650 2 4 _aInformation Storage and Retrieval.
650 2 4 _aFiles.
700 1 _aNanopoulos, Alexandros.
_eauthor.
700 1 _aPapadopoulos, Apostolos N.
_eauthor.
700 1 _aTheodoridis, Yannis.
_eauthor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9781852339777
830 0 _aAdvanced Information and Knowledge Processing,
_x1610-3947
856 4 0 _uhttp://dx.doi.org/10.1007/978-1-84628-293-5
912 _aZDB-2-SCS
999 _c17207
_d17207