Bhattacharya, Arnab (Computer scientist),
Fundamentals of database indexing and searching / Arnab Bhattacharya, Indian Institute of Technology (IIT), Kanpur India. - 1 online resource
1. Basics -- 2. Low-dimensional index structures -- 3. Disk-based index structures -- 4. Distances -- 5. High-dimensional spaces -- 6. Data reduction techniques.
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--
9780429073281
10.1201/b17767 doi
File organization (Computer science)
Database management.
Querying (Computer science)
Database searching.
Indexing.
QA76.9.F5 / B53 2015
005.741 / B575
Fundamentals of database indexing and searching / Arnab Bhattacharya, Indian Institute of Technology (IIT), Kanpur India. - 1 online resource
1. Basics -- 2. Low-dimensional index structures -- 3. Disk-based index structures -- 4. Distances -- 5. High-dimensional spaces -- 6. Data reduction techniques.
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--
9780429073281
10.1201/b17767 doi
File organization (Computer science)
Database management.
Querying (Computer science)
Database searching.
Indexing.
QA76.9.F5 / B53 2015
005.741 / B575