{"created":"2020-09-01T15:38:12.505523+00:00","id":5014,"links":{},"metadata":{"_buckets":{"deposit":"87bab35a-d59e-4f78-be27-926b30db57a9"},"_deposit":{"id":"5014","owners":[],"pid":{"revision_id":0,"type":"recid","value":"5014"},"status":"published"},"_oai":{"id":"oai:meral.edu.mm:recid/5014","sets":["1582963302567:1597824273898"]},"communities":["ucsy"],"item_1583103067471":{"attribute_name":"Title","attribute_value_mlt":[{"subitem_1551255647225":"Reverse kNN Query Algorithm on Road Network Distance","subitem_1551255648112":"en"}]},"item_1583103085720":{"attribute_name":"Description","attribute_value_mlt":[{"interim":"This paper proposed a reverse k nearestneighbor (RkNN) query algorithm in road networkdistance by using the simple materialization path view(SMPV) data structure.When a set of interest objects Pand a query point q are given, RkNN query retrievesreverse nearest neighbors of q from the set P. Twotypes of RNN, monochromatic (MRNN) andbichromatic (BRNN)are classified in the literature. Inconventional approaches for RNN query on a roadnetwork distance, it takes very long processing timebecausekNN search algorithm is invoked on everyvisited node. Using SMPV in combination withincremental Euclidean restriction (IER) frameworkreduces processing time in kNN search significantly.This paper studied for both types of RNN comparingwith the conventional method, Eager algorithm. Withextensive experiments, the proposed methodoutperformed Eager algorithm in term of processingtime especially when the k value is large."}]},"item_1583103108160":{"attribute_name":"Keywords","attribute_value":[]},"item_1583103120197":{"attribute_name":"Files","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_access","date":[{"dateType":"Available","dateValue":"2019-07-02"}],"displaytype":"preview","filename":"2. Reverse kNN Query Algorithm on Road Network Distance.pdf","filesize":[{"value":"130 Kb"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"url":"https://meral.edu.mm/record/5014/files/2. Reverse kNN Query Algorithm on Road Network Distance.pdf"},"version_id":"faca0372-31cd-4497-b22e-ff8a4f02c6d4"}]},"item_1583103131163":{"attribute_name":"Journal articles","attribute_value_mlt":[{"subitem_issue":"","subitem_journal_title":"Thirteenth International Conferences on Computer Applications(ICCA 2015)","subitem_pages":"","subitem_volume":""}]},"item_1583103147082":{"attribute_name":"Conference papers","attribute_value_mlt":[{"subitem_acronym":"","subitem_c_date":"","subitem_conference_title":"","subitem_part":"","subitem_place":"","subitem_session":"","subitem_website":""}]},"item_1583103211336":{"attribute_name":"Books/reports/chapters","attribute_value_mlt":[{"subitem_book_title":"","subitem_isbn":"","subitem_pages":"","subitem_place":"","subitem_publisher":""}]},"item_1583103233624":{"attribute_name":"Thesis/dissertations","attribute_value_mlt":[{"subitem_awarding_university":"","subitem_supervisor(s)":[{"subitem_supervisor":""}]}]},"item_1583105942107":{"attribute_name":"Authors","attribute_value_mlt":[{"subitem_authors":[{"subitem_authors_fullname":"Win, Tin Nilar"},{"subitem_authors_fullname":"Htoo, Htoo"},{"subitem_authors_fullname":"Ohsawa, Yutaka"}]}]},"item_1583108359239":{"attribute_name":"Upload type","attribute_value_mlt":[{"interim":"Publication"}]},"item_1583108428133":{"attribute_name":"Publication type","attribute_value_mlt":[{"interim":"Article"}]},"item_1583159729339":{"attribute_name":"Publication date","attribute_value":"2015-02-05"},"item_1583159847033":{"attribute_name":"Identifier","attribute_value":"http://onlineresource.ucsy.edu.mm/handle/123456789/91"},"item_title":"Reverse kNN Query Algorithm on Road Network Distance","item_type_id":"21","owner":"1","path":["1597824273898"],"publish_date":"2019-07-02","publish_status":"0","recid":"5014","relation_version_is_last":true,"title":["Reverse kNN Query Algorithm on Road Network Distance"],"weko_creator_id":"1","weko_shared_id":-1},"updated":"2021-12-13T02:45:18.112854+00:00"}