Fundamentals of Database Indexing and Searching

Arnab Bhattacharya

ISBN 10: 1138033952 / ISBN 13: 9781138033955

Published by Taylor & Francis Ltd (Sales), 2016

About this Item

nach der Bestellung gedruckt Neuware - Printed after ordering - Fundamentals of Database Indexing and Searching presents well-known database searching and indexing techniques. It focuses on similarity search queries, showing how to use distance functions to measure the notion of dissimilarity.After defining database queries and similarity search queries, the book organizes the most common and representative index structures according to their characteristics. The author first describes low-dimensional index structures, memory-based index structures, and hierarchical disk-based index structures. He then outlines useful distance measures and index structures that use the distance information to efficiently solve similarity search queries. Focusing on the difficult dimensionality phenomenon, he also presents several indexing methods that specifically deal with high-dimensional spaces. In addition, the book covers data reduction techniques, including embedding, various data transforms, and histograms.Through numerous real-world examples, this book explores how to effectively index and search for information in large collections of data. Requiring only a basic computer science background, it is accessible to practitioners and advanced undergraduate students.

Seller Inventory # 9781138033955

Bibliographic Details

• Title: Fundamentals of Database Indexing and Searching
• Publisher: Taylor & Francis Ltd (Sales)
• Publication Date: 2016
• Language: English
• ISBN 10: 1138033952
• ISBN 13: 9781138033955
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 236W x 155H x 20D millimeters 236 millimeters width by 155 millimeters height by 20 millimeters depth
• Weight: 431 grams

About this title

Synopsis

Fundamentals of Database Indexing and Searching presents well-known database searching and indexing techniques. It focuses on similarity search queries, showing how to use distance functions to measure the notion of dissimilarity.

After defining database queries and similarity search queries, the book organizes the most common and representative index structures according to their characteristics. The author first describes low-dimensional index structures, memory-based index structures, and hierarchical disk-based index structures. He then outlines useful distance measures and index structures that use the distance information to efficiently solve similarity search queries. Focusing on the difficult dimensionality phenomenon, he also presents several indexing methods that specifically deal with high-dimensional spaces. In addition, the book covers data reduction techniques, including embedding, various data transforms, and histograms.

Through numerous real-world examples, this book explores how to effectively index and search for information in large collections of data. Requiring only a basic computer science background, it is accessible to practitioners and advanced undergraduate students.

About the Author

Arnab Bhattacharya