Similarity Search - The Metric Space Approach
The proliferation of information housed in computerized domains makes it vital to find tools to search these resources efficiently and effectively. Ordinary retrieval techniques are inadequate because sorting is simply impossible. Consequently, proximity searching has become a fundamental computation task in a variety of application areas.
Similarity Search focuses on the state of the art in developing index structures for searching the metric space. Part I of the text describes major theoretical principles, and provides an extensive survey of specific techniques for a large range of applications. Part II concentrates on approaches particularly designed for searching in large collections of data. After describing the most popular centralized disk-based metric indexes, approximation techniques are presented as a way to significantly speed up search time at the cost of some imprecision in query results. Finally, the scalable and distributed metric structures are discussed.
Password: knowfree.net
Random Posts
- XML for Bioinformatics - Springer
- Corporate Governance and Corporate Finance A European Perspective
- Financial accounting information for decisions by Ingram - McGraw Hill
- Computer Macworld UK 2007 Expo
- [SAP Labs] Commonly Used Reports: Illustrations and Perspectives
- Hack Proofing you Wireless Network
- Ethical Hacker Tools and more
- Navigating C++ and Object-oriented Design - Prentice Hall
- Cognitive Wireless Networks - Springer
- Microsoft ASP.Net Coding Strategies with the Microsoft ASP.NET Team
