-
Notifications
You must be signed in to change notification settings - Fork 0
/
index.html
13 lines (13 loc) · 10.3 KB
/
index.html
1
2
3
4
5
6
7
8
9
10
11
12
13
<!doctype html><html class=no-js lang=en><head><meta name=generator content="Hugo 0.135.0"><meta charset=UTF-8><meta name=viewport content="width=device-width,initial-scale=1"><meta http-equiv=X-UA-Compatible content="IE=edge"><title>Vector Database Group @ NTU</title>
<script>(function(e,t){e[t]=e[t].replace("no-js","js")})(document.documentElement,"className")</script><meta name=description content="Welcome to our website!"><meta property="og:url" content="https://VectorDB-NTU.github.io/"><meta property="og:site_name" content="Vector Database Group @ NTU"><meta property="og:title" content="Home"><meta property="og:description" content="About us We are Vector Database Research Group at Nanyang Technological University. Our interests lie in high-dimensional vector data management (and its applications in large models such as retrieval-augmented generative AI).
Large-scale high-dimensional vector data has become ubiquitous in contemporary times. For instance, various forms of unstructured data, such as images, videos, texts, and speeches, are typically transformed into vectors using deep learning techniques. These vectors are subsequently employed in downstream analytical tasks. Nearest neighbor (NN) search in high-dimensional vector space constitutes a fundamental problem with a wide array of applications in information retrieval, recommendations, and retrieval-based large language models. We have developed several techniques for approximate NN (ANN), including:"><meta property="og:locale" content="en"><meta property="og:type" content="website"><meta itemprop=name content="Home"><meta itemprop=description content="About us We are Vector Database Research Group at Nanyang Technological University. Our interests lie in high-dimensional vector data management (and its applications in large models such as retrieval-augmented generative AI).
Large-scale high-dimensional vector data has become ubiquitous in contemporary times. For instance, various forms of unstructured data, such as images, videos, texts, and speeches, are typically transformed into vectors using deep learning techniques. These vectors are subsequently employed in downstream analytical tasks. Nearest neighbor (NN) search in high-dimensional vector space constitutes a fundamental problem with a wide array of applications in information retrieval, recommendations, and retrieval-based large language models. We have developed several techniques for approximate NN (ANN), including:"><meta itemprop=datePublished content="2024-12-09T00:00:00+00:00"><meta itemprop=dateModified content="2024-12-09T00:00:00+00:00"><meta itemprop=wordCount content="149"><meta name=twitter:card content="summary"><meta name=twitter:title content="Home"><meta name=twitter:description content="About us We are Vector Database Research Group at Nanyang Technological University. Our interests lie in high-dimensional vector data management (and its applications in large models such as retrieval-augmented generative AI).
Large-scale high-dimensional vector data has become ubiquitous in contemporary times. For instance, various forms of unstructured data, such as images, videos, texts, and speeches, are typically transformed into vectors using deep learning techniques. These vectors are subsequently employed in downstream analytical tasks. Nearest neighbor (NN) search in high-dimensional vector space constitutes a fundamental problem with a wide array of applications in information retrieval, recommendations, and retrieval-based large language models. We have developed several techniques for approximate NN (ANN), including:"><link rel=stylesheet href=/css/style.css><link rel=stylesheet href=/css/custom.css><link rel=alternate type=application/rss+xml href=/index.xml title="Vector Database Group @ NTU"><link rel="shortcut icon" href=/favicon.ico></head><body class=body><header class=header><div class="logo logo--mixed"><div class=container><a class=logo__link href=/ title="Vector Database Group @ NTU" rel=home><div class="logo__item logo__imagebox"><img class=logo__img src=/img/NTU_badge.png alt="Logo image"></div><div class="logo__item logo__text"><div class=logo__title>Vector Database Group @ NTU</div><div class=logo__tagline>Nanyang Technological University</div></div></a></div></div></header><nav class=menu><div class=container><button class=menu__btn aria-haspopup=true aria-expanded=false tabindex=0>
<span class=menu__btn-title tabindex=-1>Menu</span></button><ul class=menu__list><li class="menu__item menu__item--active"><a class=menu__link href=/><span class=menu__text>Home</span></a></li><li class=menu__item><a class=menu__link href=/impacts/><span class=menu__text>Impacts</span></a></li><li class=menu__item><a class=menu__link href=/news/><span class=menu__text>News</span></a></li><li class=menu__item><a class=menu__link href=/publications/><span class=menu__text>Publications</span></a></li><li class=menu__item><a class=menu__link href=/people/><span class=menu__text>People</span></a></li></ul></div></nav><div class="container wrapper flex"><div class=primary><main class="main list" role=main><div class="content main__content clearfix"><h1 id=about-us>About us</h1><p>We are Vector Database Research Group at Nanyang Technological University. Our interests lie in high-dimensional vector data management (and its applications in large models such as retrieval-augmented generative AI).</p><p><img src=/img/bigdata.webp alt=bigdata></p><p>Large-scale high-dimensional vector data has become ubiquitous in contemporary times. For instance, various forms of unstructured data, such as images, videos, texts, and speeches, are typically transformed into vectors using deep learning techniques. These vectors are subsequently employed in downstream analytical tasks. Nearest neighbor (NN) search in high-dimensional vector space constitutes a fundamental problem with a wide array of applications in information retrieval, recommendations, and retrieval-based large language models. We have developed several techniques for approximate NN (ANN), including:</p><ul><li><a href=https://arxiv.org/abs/2409.09913>Extended RaBitQ for allowing more flexible quantization with varying compression rates</a> (arXiv).</li><li><a href=https://arxiv.org/abs/2411.12229>SymphonyQG for combining graph-based index with quantization</a> (SIGMOD'25)</li><li><a href=https://arxiv.org/abs/2409.02571>iRangeGraph for attribute-filtered ANN</a> (SIGMOD'25)</li><li><a href=https://arxiv.org/abs/2405.12497>RaBitQ for quantizing high-dimensional vectors</a> (SIGMOD'24)</li><li><a href=https://arxiv.org/abs/2303.09855>ADSampling for efficient and reliable distance comparisons</a> (SIGMOD'23)</li></ul></div></main></div><aside class=sidebar><div class="widget-search widget"><form class=widget-search__form role=search method=get action=https://duckduckgo.com/><label><input class=widget-search__field type=search placeholder=SEARCH... name=q aria-label=SEARCH...>
</label><input class=widget-search__submit type=submit value=Search>
<input type=hidden name=sites value=https://VectorDB-NTU.github.io/></form></div><div class="widget-recent widget"><h4 class=widget__title>Recent Posts</h4><div class=widget__content><ul class=widget__list><li class=widget__item><a class=widget__link href=/news/symqg/>SymphonyQG has been accepted by SIGMOD' 25</a></li><li class=widget__item><a class=widget__link href=/news/irange/>iRangeGraph has been accepted by SIGMOD' 25</a></li><li class=widget__item><a class=widget__link href=/news/rabitq/>RaBitQ has been accepted by SIGMOD' 24</a></li><li class=widget__item><a class=widget__link href=/news/adsampling/>ADSampling has been accepted by SIGMOD' 23</a></li></ul></div></div><div class="widget-taglist widget"><h4 class=widget__title>Tags</h4><div class=widget__content><a class="widget-taglist__link widget__link btn" href=/tags/ann-search/ title="ANN Search">ANN Search</a>
<a class="widget-taglist__link widget__link btn" href=/tags/vector-db-algorithms/ title="Vector DB Algorithms">Vector DB Algorithms</a>
<a class="widget-taglist__link widget__link btn" href=/tags/vector-db-index/ title="Vector DB Index">Vector DB Index</a></div></div><div class="widget-social widget"><h4 class="widget-social__title widget__title">Social</h4><div class="widget-social__content widget__content"><div class="widget-social__item widget__item"><a class="widget-social__link widget__link btn" title=GitHub rel="noopener noreferrer" href=https://github.com/VectorDB-NTU target=_blank><svg class="widget-social__link-icon icon icon-github" width="24" height="24" viewBox="0 0 384 374"><path d="m192 0C85.9.0.0 85.8.0 191.7c0 84.7 55 156.6 131.3 181.9 9.6 1.8 13.1-4.2 13.1-9.2.0-4.6-.2-16.6-.3-32.6-53.4 11.6-64.7-25.7-64.7-25.7-8.7-22.1-21.3-28-21.3-28-17.4-11.9 1.3-11.6 1.3-11.6 19.3 1.4 29.4 19.8 29.4 19.8 17.1 29.3 44.9 20.8 55.9 15.9 1.7-12.4 6.7-20.8 12.2-25.6-42.6-4.8-87.5-21.3-87.5-94.8.0-20.9 7.5-38 19.8-51.4-2-4.9-8.6-24.3 1.9-50.7.0.0 16.1-5.2 52.8 19.7 15.3-4.2 31.7-6.4 48.1-6.5 16.3.1 32.7 2.2 48.1 6.5 36.7-24.8 52.8-19.7 52.8-19.7 10.5 26.4 3.9 45.9 1.9 50.7 12.3 13.4 19.7 30.5 19.7 51.4.0 73.7-44.9 89.9-87.7 94.6 6.9 5.9 13 17.6 13 35.5.0 25.6-.2 46.3-.2 52.6.0 5.1 3.5 11.1 13.2 9.2C329 348.2 384 276.4 384 191.7 384 85.8 298 0 192 0z"/></svg>
<span>GitHub</span></a></div><div class="widget-social__item widget__item"><a class="widget-social__link widget__link btn" title=Email href=mailto:[email protected]><svg class="widget-social__link-icon icon icon-mail" width="24" height="24" viewBox="0 0 416 288"><path d="m0 16v256 16h16 384 16v-16V16 0h-16H16 0zm347 16-139 92.5L69 32zM199 157.5l9 5.5 9-5.5L384 46v210H32V46z"/></svg>
<span>[email protected]</span></a></div><div class="widget-social__item widget__item"><a class="widget-social__link widget__link btn" title="Cheng Long's Home Page" rel="noopener noreferrer" href=https://personal.ntu.edu.sg/c.long/index.html target=_blank><span>Cheng Long's Home Page</span></a></div></div></div></aside></div><footer class=footer><div class="container footer__container flex"><div class=footer__copyright>© 2024 Vector Database Group @ NTU.
<span class=footer__copyright-credits>Generated with <a href=https://gohugo.io/ rel="nofollow noopener" target=_blank>Hugo</a> and <a href=https://github.com/pfadfinder-konstanz/hugo-dpsg/ rel="nofollow noopener" target=_blank>DPSG</a> theme.</span></div></div></footer><script async defer src=/js/menu.js></script><script src=/js/custom.js></script></body></html>