02936nam a22004695i 4500001001800000003000900018005001700027007001500044008004100059020003700100024003500137050001700172072001600189072001600205072002300221072001500244072001500259100008600274245008200360250001800442264006900460300003300529336002600562337002600588338003600614347002400650505011600674520121500790650005402005650004202059650004602101650003702147650005802184710003402242773002602276776003602302776003602338856004602374912001402420912001502434999001702449978-3-031-55182-6DE-He21320251030111748.0cr nn 008mamaa240327s2024    sz |    s    |||| 0|eng d  a97830315518269978-3-031-55182-67 a10.1007/978-3-031-55182-62doi 4aQA75.5-76.95 7aUNH2bicssc 7aUND2bicssc 7aCOM0300002bisacsh 7aUNH2thema 7aUND2thema1 aBruch, Sebastian.eauthor.4aut4http://id.loc.gov/vocabulary/relators/aut97410110aFoundations of Vector Retrievalh[electronic resource] /cby Sebastian Bruch.  a1st ed. 2024. 1aCham :bSpringer Nature Switzerland :bImprint: Springer,c2024.  aXX, 185 p.bonline resource.  atextbtxt2rdacontent  acomputerbc2rdamedia  aonline resourcebcr2rdacarrier  atext filebPDF2rda0 aPreface -- Part I Introduction -- Part II Retrieval Algorithms -- Part III Compression -- Part IV Appendices. .  aThis book presents the fundamentals of vector retrieval. To this end, it delves into important data structures and algorithms that have been successfully used to solve the vector retrieval problem efficiently and effectively. This monograph is divided into four parts. The first part introduces the problem of vector retrieval and formalizes the concepts involved. The second part delves into retrieval algorithms that help solve the vector retrieval problem efficiently and effectively. It includes a chapter each on brand-and-bound algorithms, locality sensitive hashing, graph algorithms, clustering, and sampling. Part three is devoted to vector compression and comprises chapters on quantization and sketching. Finally, the fourth part presents a review of background material in a series of appendices, summarizing relevant concepts from probability, concentration inequalities, and linear algebra. The book emphasizes the theoretical aspects of algorithms and presents related theorems and proofs. It is thus mainly written for researchers and graduate students in theoretical computer science and database and information systems who want to learn about the theoretical foundations of vector retrieval. 0aInformation storage and retrieval systems.965568 0aComputer sciencexMathematics.96404114aInformation Storage and Retrieval.96557024aMathematics of Computing.96650124aMathematical Applications in Computer Science.9655182 aSpringerLink (Online service)0 tSpringer Nature eBook08iPrinted edition:z978303155181908iPrinted edition:z978303155183340uhttps://doi.org/10.1007/978-3-031-55182-6  aZDB-2-SCS  aZDB-2-SXCS  c58702d58702