<?xml version='1.0' encoding='UTF-8'?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-10-24T20:54:01Z</responseDate>
  <request verb="GetRecord" identifier="oai:meral.edu.mm:recid/4256" metadataPrefix="oai_dc">https://meral.edu.mm/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:meral.edu.mm:recid/4256</identifier>
        <datestamp>2021-12-13T01:37:04Z</datestamp>
        <setSpec>1582963302567:1597824273898</setSpec>
        <setSpec>user-ucsy</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns="http://www.w3.org/2001/XMLSchema" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Generalized Vicinity Query Algorithm in Road Network Distance</dc:title>
          <dc:creator>Ohsawa, Yutaka</dc:creator>
          <dc:creator>Htoo, Htoo</dc:creator>
          <dc:creator>Sein, Myint Myint</dc:creator>
          <dc:description>Vicinity queries include set k nearestneighbor (SetkNN) query, ordered k nearestneighbor (OrderkNN) query, bi-chromaticreverse nearest neighbor (BRkNN) query anddistance range query. In existing approaches,each type of queries has been individuallystudied because they are different in querycriteria. Moreover, these types of queries takelong processing time in calculating road networkdistances. To improve in the efficiency, this paperproposes vicinity query algorithm based on thehigher-order network Voronoi region (NVR)which gives a unified procedure to run thesedifferent queries in an integrated frameworkalthough the query criteria of all individualsdiffer from each query type. Through extensiveexperiments, the proposed method significantlyoutperforms the existing works in terms ofprocessing time by nearly two orders ofmagnitude.</dc:description>
          <dc:date>2016-02-25</dc:date>
          <dc:identifier>http://hdl.handle.net/20.500.12678/0000004256</dc:identifier>
          <dc:identifier>https://meral.edu.mm/records/4256</dc:identifier>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
