Fundamentals of database indexing and searching
 Responsibility
 author, Arnab Bhattacharya.
 Digital
 data file
 Publication
 Boca Raton, Florida : CRC Press, [2015]
 Copyright notice
 ©2015
 Physical description
 1 online resource
 Series
 Chapman & Hall Book
Online
More options
Description
Creators/Contributors
 Author/Creator
 Bhattacharya, Arnab (Computer scientist)
Contents/Summary
 Bibliography
 Includes bibliographical references and index.
 Contents

 Basics Database Queries Basic Setting Exact Search Similarity Search Join Errors
 LowDimensional Index Structures Hashing Static Hashing Dynamic Hashing Locality Sensitive Hashing (LSH) MultiDimensional Hashing SpaceFilling Curves
 MemoryBased Index Structures Index Structures Binary Search Tree (BST) Quadtree KDTree Range Tree Voronoi Diagram Tries Suffix Tree Bitmap Index
 DiskBased Index Structures Hierarchical Structures BTree and B+Tree KDBTree General Framework RTree R*Tree R+Tree Hilbert RTree SSTree SRTree PTree BulkLoading
 Distances Distance Functions Metric Spaces Lp Norm Quadratic Form Distance Cosine Similarity Statistical Distance Measures Distances between Sets of Objects Earth Mover's Distance Edit Distance
 DistanceBased Structures Triangular Inequality VPTree GHTree GNAT MTree SATree AESA Linear AESA (LAESA) AESA for Vector Spaces
 HighDimensional Spaces Curse of Dimensionality Analysis of Search for HighDimensional Data Expected Nearest Neighbor Distance Expected Number of Page Accesses Curse of Dimensionality
 HighDimensionality Structures XTree Pyramid Technique IMinMax VAFile ATree IQTree
 Data Reduction Techniques Dimensionality Reduction Techniques Properties Useful for Similarity Search Quality Measures Embedding Singular Value Decomposition (SVD) Principal Component Analysis (PCA) MultiDimensional Scaling (MDS) IsoMap FastMap Embedding Methods Bounds on Distortion
 Data Representation Techniques Discrete Fourier Transform (DFT) Discrete Cosine Transform (DCT) Discrete Wavelet Transform (DWT) VOptimal Histogram
 Appendices A Memory and Disk Accesses Memory Access Disks Flash
 B Distances of Bounding Boxes Distance of a Point from a Rectangle Distance of a Point from a Sphere Distance of a Sphere from a Rectangle Distance of a Sphere from a Sphere Distance of a Rectangle from a Rectangle
 C Vectors and Matrices Vector Spaces Matrices Properties of Matrices Dimensionality
 D Probability and Statistics Random Variable Probability Distribution Statistical Parameters.
 (source: Nielsen Book Data)
 Basics. LowDimensional Index Structures. DiskBased Index Structures. Distances. HighDimensional Spaces. Data Reduction Techniques. Appendices.
 (source: Nielsen Book Data)
 Publisher's summary

Fundamentals of Database Indexing and Searching presents wellknown 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 lowdimensional index structures, memorybased index structures, and hierarchical diskbased 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 highdimensional spaces. In addition, the book covers data reduction techniques, including embedding, various data transforms, and histograms. Through numerous realworld 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.
(source: Nielsen Book Data)
 Publisher's summary

Fundamentals of Database Indexing and Searching presents wellknown 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 ind.
(source: Nielsen Book Data)
Subjects
 Subjects
 File organization (Computer science)
 Database management.
 Querying (Computer science)
 Database searching.
 Indexing.
 Abstracting and Indexing
 Fichiers (Informatique) > Organisation.
 Bases de données > Gestion.
 Bases de données > Interrogation.
 Indexation (Documentation)
 online searching.
 COMPUTERS/Desktop Applications/Databases.
 COMPUTERS/Database Management/General.
 COMPUTERS/System Administration/Storage & Retrieval.
Bibliographic information
 Publication date
 2015
 ISBN
 9781466582552 (electronic bk.)
 1466582553 (electronic bk.)
 9781466582545