Existing User
New User
Forgot Password
Login
Email
*
Password
*
Register
Email ID
*
Password
*
Confirm Password
*
Name
User Type
*
Select
Student
Faculty
Others
Institute
Branch
Forgot Password
Email
*
Home
|
About Us
|
FAQ
|
Courses
|
Contact Us
|
Sign-In
Syllabus
|
Lectures
|
Downloads
| FAQ |
Ask a question
|
Course Co-ordinated by
IIT Kanpur
NPTEL
>> Computer Science and Engineering >> Indexing and Searching Techniques in Databases (Web) >>
Basic Database Queries
Modules / Lectures
Basics and Background
Basic Database Queries
Advanced Database Queries
Error Measures
Memory and Disk Accesses
Vector and Metric Spaces
Distances
Distance Functions
Earth Mover's Distance (EMD)
Earth Mover's Distance (EMD)
Hashing
Static and Dynamic Hashing
Linear hashing
Locality Sensitive Hashing and Grid File
One-dimensional Orderings
Index Structures
Index structure
Quadtrees and k-d-trees
Range Trees and Interval Trees
Voronoi Diagrams and Tries
Disk-based Index Structures
Disk-based Index Structures
General Framework
R-trees
R-trees
R-tree Variants
SS-trees,SR-trees,P-trees
X-tree
Analysis of High Dimensional Data
Analysis of Index Structures
Pyramid Technique and VA-files
M-trees
Dimensionality Reduction
Dimensionality Reduction
Singular Value Decomposition (SVD)
Principal Component Analysis (PCA)
FastMap
Embedding
Embedding
Data Representation
DFT and DCT
Wavelets
V-optimal Histograms
Miscellaneous Topics
Aggregation
Incremental Nearest Neighbor
Skyline Queries
Skyline Queries
References
Reading Material
loading...
Important: Please enable javascript in your browser and download
Adobe Flash player
to view this site
Site Maintained by Web Studio, IIT Madras. Contact Webmaster:
nptel@iitm.ac.in
