<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-01650272</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-25T22:52:37+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">A Progressive k-d tree for Approximate k-Nearest Neighbors</title>
            <author role="aut">
              <persName>
                <forename type="first">Jaemin</forename>
                <surname>Jo</surname>
              </persName>
              <email type="md5">8281d59553630c55da192da25f7cf894</email>
              <email type="domain">hcil.snu.ac.kr</email>
              <idno type="idhal" notation="numeric">1024025</idno>
              <idno type="halauthorid" notation="string">1271450-1024025</idno>
              <orgName ref="#struct-253831"/>
              <affiliation ref="#struct-253831"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Jinwook</forename>
                <surname>Seo</surname>
              </persName>
              <email type="md5">d2425872dd9a2dde1a33982e385fe445</email>
              <email type="domain">hcil.snu.ac.kr</email>
              <idno type="idhal" notation="numeric">1024026</idno>
              <idno type="halauthorid" notation="string">1271451-1024026</idno>
              <orgName ref="#struct-253831"/>
              <affiliation ref="#struct-253831"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Jean-Daniel</forename>
                <surname>Fekete</surname>
              </persName>
              <email type="md5">6ad8d674f3d6c9920d3b667534f7f1ec</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="string">jean-daniel-fekete</idno>
              <idno type="idhal" notation="numeric">8723</idno>
              <idno type="halauthorid" notation="string">1777-8723</idno>
              <idno type="ARXIV">https://arxiv.org/a/fekete_j_1</idno>
              <idno type="RESEARCHERID">http://www.researcherid.com/rid/N-9175-2018</idno>
              <idno type="IDREF">https://www.idref.fr/08305491X</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-3770-8726</idno>
              <idno type="VIAF">https://viaf.org/viaf/220807935</idno>
              <idno type="ISNI">http://isni.org/isni/0000000360668419</idno>
              <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?hl=en&amp;user=PMZ3h7sAAAAJ</idno>
              <idno type="RESEARCHERID">http://www.researcherid.com/rid/http://www.researcherid.com/rid/N-9175-2018</idno>
              <orgName ref="#struct-300009"/>
              <affiliation ref="#struct-56039"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Jean-Daniel</forename>
                <surname>Fekete</surname>
              </persName>
              <email type="md5">6ad8d674f3d6c9920d3b667534f7f1ec</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2017-11-28 13:05:56</date>
              <date type="whenModified">2025-02-26 15:22:03</date>
              <date type="whenReleased">2017-11-28 16:08:03</date>
              <date type="whenProduced">2017-10-02</date>
              <date type="whenEndEmbargoed">2017-11-28</date>
              <ref type="file" target="https://inria.hal.science/hal-01650272v1/document">
                <date notBefore="2017-11-28"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01650272v1/file/A_Progressive_KD_Tree___DSIA_VIS2017%20%281%29.pdf" id="file-1650272-1692930">
                <date notBefore="2017-11-28"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="113765">
                <persName>
                  <forename>Jean-Daniel</forename>
                  <surname>Fekete</surname>
                </persName>
                <email type="md5">6ad8d674f3d6c9920d3b667534f7f1ec</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01650272</idno>
            <idno type="halUri">https://inria.hal.science/hal-01650272</idno>
            <idno type="halBibtex">jo:hal-01650272</idno>
            <idno type="halRefHtml">&lt;i&gt;Workshop on Data Systems for Interactive Analysis (DSIA)&lt;/i&gt;, Oct 2017, Phoenix, United States</idno>
            <idno type="halRef">Workshop on Data Systems for Interactive Analysis (DSIA), Oct 2017, Phoenix, United States</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1650272-1692930"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="INRIA-SACLAY" corresp="INRIA">INRIA Saclay - Ile de France</idno>
            <idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="INRIA-SACLAY-2015" corresp="UNIV-PARIS-SACLAY">INRIA-SACLAY-2015</idno>
            <idno type="stamp" n="INRIA2017">INRIA2017</idno>
            <idno type="stamp" n="INRIA-300009">Inria 300009</idno>
            <idno type="stamp" n="LISN">Laboratoire Interdisciplinaire des Sciences du Numérique</idno>
            <idno type="stamp" n="GS-ENGINEERING">Graduate School Sciences de l'Ingénierie et des Systèmes</idno>
            <idno type="stamp" n="GS-COMPUTER-SCIENCE">Graduate School Computer Science</idno>
            <idno type="stamp" n="LISN-AVIZ" corresp="LISN">Analysis and Visualization </idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">A Progressive k-d tree for Approximate k-Nearest Neighbors</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Jaemin</forename>
                    <surname>Jo</surname>
                  </persName>
                  <email type="md5">8281d59553630c55da192da25f7cf894</email>
                  <email type="domain">hcil.snu.ac.kr</email>
                  <idno type="idhal" notation="numeric">1024025</idno>
                  <idno type="halauthorid" notation="string">1271450-1024025</idno>
                  <orgName ref="#struct-253831"/>
                  <affiliation ref="#struct-253831"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Jinwook</forename>
                    <surname>Seo</surname>
                  </persName>
                  <email type="md5">d2425872dd9a2dde1a33982e385fe445</email>
                  <email type="domain">hcil.snu.ac.kr</email>
                  <idno type="idhal" notation="numeric">1024026</idno>
                  <idno type="halauthorid" notation="string">1271451-1024026</idno>
                  <orgName ref="#struct-253831"/>
                  <affiliation ref="#struct-253831"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Jean-Daniel</forename>
                    <surname>Fekete</surname>
                  </persName>
                  <email type="md5">6ad8d674f3d6c9920d3b667534f7f1ec</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="string">jean-daniel-fekete</idno>
                  <idno type="idhal" notation="numeric">8723</idno>
                  <idno type="halauthorid" notation="string">1777-8723</idno>
                  <idno type="ARXIV">https://arxiv.org/a/fekete_j_1</idno>
                  <idno type="RESEARCHERID">http://www.researcherid.com/rid/N-9175-2018</idno>
                  <idno type="IDREF">https://www.idref.fr/08305491X</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-3770-8726</idno>
                  <idno type="VIAF">https://viaf.org/viaf/220807935</idno>
                  <idno type="ISNI">http://isni.org/isni/0000000360668419</idno>
                  <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?hl=en&amp;user=PMZ3h7sAAAAJ</idno>
                  <idno type="RESEARCHERID">http://www.researcherid.com/rid/http://www.researcherid.com/rid/N-9175-2018</idno>
                  <orgName ref="#struct-300009"/>
                  <affiliation ref="#struct-56039"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>Workshop on Data Systems for Interactive Analysis (DSIA)</title>
                  <date type="start">2017-10-02</date>
                  <settlement>Phoenix</settlement>
                  <country key="US">United States</country>
                </meeting>
                <imprint/>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Real-Time</term>
                <term xml:lang="en">Algorithm</term>
                <term xml:lang="en">Progressive Data Analysis</term>
                <term xml:lang="en">Approximate k-Nearest-Neighbors</term>
              </keywords>
              <classCode scheme="acm" n="H.3.3">H.: Information Systems/H.3: INFORMATION STORAGE AND RETRIEVAL/H.3.3: Information Search and Retrieval</classCode>
              <classCode scheme="halDomain" n="info.info-hc">Computer Science [cs]/Human-Computer Interaction [cs.HC]</classCode>
              <classCode scheme="halDomain" n="info.info-ai">Computer Science [cs]/Artificial Intelligence [cs.AI]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>We present a progressive algorithm for approximate k-nearest neighbor search. Although the use of k-nearest neighbor libraries (KNN) is common in many data analysis methods, most KNN algorithms can only be run when the whole dataset has been indexed, i.e., they are not online. Even the few online implementations are not progressive in the sense that the time to index incoming data is not bounded and can exceed the latency required by progressive systems. Exceeding this latency significantly impacts the interactivity of visualization systems especially when dealing with large-scale data. We improve traditional k-d trees for progressive approximate k-nearest neighbor search, enabling fast KNN queries while continuously indexing new batches of data when necessary. Following the progressive computation paradigm, our progressive k-d tree is bounded in time, allowing analysts to access ongoing results within an interactive latency. We also present performance benchmarks to compare online and progressive k-d trees.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-253831" status="VALID">
          <idno type="ROR">https://ror.org/04h9pn542</idno>
          <orgName>Seoul National University [Seoul]</orgName>
          <orgName type="acronym">SNU</orgName>
          <desc>
            <address>
              <addrLine>1 Gwanak-ro, Gwanak-gu, Seoul 151-742</addrLine>
              <country key="KR"/>
            </address>
            <ref type="url">http://www.useoul.edu/index.html</ref>
          </desc>
        </org>
        <org type="researchteam" xml:id="struct-56039" status="OLD">
          <idno type="RNSR">200818367J</idno>
          <orgName>Analysis and Visualization</orgName>
          <orgName type="acronym">AVIZ</orgName>
          <date type="start">2007-02-08</date>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>DIGITEO, Bat. Claude Shannon - Université de Paris-Sud, Bâtiment 660, 91190 Gif-sur-Yvette</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/aviz</ref>
          </desc>
          <listRelation>
            <relation active="#struct-118511" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-118511" status="VALID">
          <idno type="RNSR">200818248E</idno>
          <idno type="ROR">https://ror.org/0315e5x55</idno>
          <orgName>Centre Inria de Saclay</orgName>
          <desc>
            <address>
              <addrLine>1 rue Honoré d'Estienne d'OrvesBâtiment Alan TuringCampus de l'École Polytechnique91120 Palaiseau</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/saclay</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300009" status="VALID">
          <idno type="ROR">https://ror.org/02kvxyf05</idno>
          <orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
          <orgName type="acronym">Inria</orgName>
          <desc>
            <address>
              <addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/en/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>