Indexing Techniques for Advanced Database Systems
Elisa Bertino, Beng Chin Ooi, Ron Sacks-Davis, Kian-Lee Tan, Justin Zobel, Boris Shidlovsky, Daniele Andronico
Springer Science & Business Media, 6 dic. 2012 - 250 páginas
Recent years have seen an explosive growth in the use of new database applications such as CAD/CAM systems, spatial information systems, and multimedia information systems. The needs of these applications are far more complex than traditional business applications. They call for support of objects with complex data types, such as images and spatial objects, and for support of objects with wildly varying numbers of index terms, such as documents. Traditional indexing techniques such as the B-tree and its variants do not efficiently support these applications, and so new indexing mechanisms have been developed. As a result of the demand for database support for new applications, there has been a proliferation of new indexing techniques.
The need for a book addressing indexing problems in advanced applications is evident. For practitioners and database and application developers, this book explains best practice, guiding the selection of appropriate indexes for each application. For researchers, this book provides a foundation for the development of new and more robust indexes. For newcomers, this book is an overview of the wide range of advanced indexing techniques.
Indexing Techniques for Advanced Database Systems is suitable as a secondary text for a graduate level course on indexing techniques, and as a reference for researchers and practitioners in industry.
Comentarios de usuarios - Escribir una reseña
No hemos encontrado ninguna reseña en los sitios habituales.
Otras ediciones - Ver todo
access methods algorithm AP-tree applications approach attribute Bertino binary binary tree bitmap bounding rectangle bucket cell CH-tree client clusters color histogram color-spatial Computer constraint contains cost covering rectangles Data Engineering data space data structure database systems deletion dimension dimension tables disk efficient entries example Figure grid hashing height-balanced histogram index structure indexing techniques inheritance hierarchy internal nodes International Conference interval inverted file inverted index inverted lists join index kd-tree key value key-value layer leaf node linear linear hashing matching multi-dimensional multi-index nested index object-oriented databases OIDs OLAP operations optimal partition path index performance pointer pointer swizzling Proc proposed query evaluation query terms R-tree range record relation relevant representation represented result retrieval SMAT spatial access methods spatial indexes split storage store node subspace subtree temporal temporal databases text databases transaction traversal tree TSB-tree tuples update valid words