Best-selling in Non-Fiction Books
Save on Non-Fiction Books
- AU $46.25Trending at AU $49.65
- AU $3.73Trending at AU $7.41
- AU $27.04Trending at AU $31.41
- AU $70.90Trending at AU $78.37
- AU $25.16Trending at AU $27.12
- AU $19.24Trending at AU $24.20
- AU $22.60Trending at AU $23.15
About this product
- DescriptionThe area of similarity searching is a very hot topic for both research and c- mercial applications. Current data processing applications use data with c- siderably less structure and much less precise queries than traditional database systems. Examples are multimedia data like images or videos that offer query by example search, product catalogs that provide users with preference based search, scientific data records from observations or experimental analyses such as biochemical and medical data, or XML documents that come from hetero- neous data sources on the Web or in intranets and thus does t exhibit a global schema. Such data can neither be ordered in a canical manner r meani- fully searched by precise database queries that would return exact matches. This vel situation is what has given rise to similarity searching, also - ferred to as content based or similarity retrieval. The most general approach to similarity search, still allowing construction of index structures, is modeled in metric space. In this book. Prof. Zezula and his co authors provide the first mograph on this topic, describing its theoretical background as well as the practical search tools of this invative techlogy.
- Author(s)Giuseppe Amato,Michal Batko,Pavel Zezula,Vlastislav Dohnal
- PublisherSpringer-Verlag New York Inc.
- Date of Publication17/11/2005
- SubjectComputing: Professional & Programming
- Series TitleAdvances in Database Systems
- Series Part/Volume Numberv. 32
- Place of PublicationNew York, NY
- Country of PublicationUnited States
- ImprintSpringer-Verlag New York Inc.
- Content Notebiography
- Weight514 g
- Width156 mm
- Height234 mm
- Spine14 mm
- Format DetailsLaminated cover
This item doesn't belong on this page.
Thanks, we'll look into this.