Abstract
Purpose: This study aims to propose and evaluate a searching scheme for a bichromatic reverse k-nearest neighbor (BRkNN) that has objects and queries in spatial networks. In this proposed scheme, the author’s search for the BRkNN of the query using an influence zone for each object with a network Voronoi diagram (NVD). Design/methodology/approach: The author’s analyze and evaluate the performance of the proposed searching scheme. Findings: The contribution of this paper is that it confirmed that the proposed searching scheme gives shorter processing time than the conventional linear search. Research limitations/implications: A future direction of this study will involve making a searching scheme that reduces the processing time when objects move automatically on spatial networks. Practical implications: In BRkNN, consider two groups in a convenience store, where several convenience stores, which are constructed in Groups A and B, operate in a given region. The author’s can use RNN is RkNN when k = 1 (RNN) effectively to set a new store considering the Euclidean and road distances among stores and the location relationship between Groups A and B. Originality/value: In the proposed searching scheme, the author’s search for the BRkNN of the query for each object with an NVD using the influence zone, which is the region where an object in the spatial network recognizes the nearest neighbor for the query.
| Original language | English |
|---|---|
| Pages (from-to) | 62-75 |
| Number of pages | 14 |
| Journal | International Journal of Pervasive Computing and Communications |
| Volume | 13 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 2017 |
Fingerprint
Keywords
- Bichromatic reverse k-nearest neighbor query
- Network Voronoi diagram
- Processing time
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)
Cite this
A proposition of querying scheme with network Voronoi diagram in bichromatic reverse k-nearest neighbor. / Gotoh, Yusuke; Okubo, Chiori.
In: International Journal of Pervasive Computing and Communications, Vol. 13, No. 1, 2017, p. 62-75.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - A proposition of querying scheme with network Voronoi diagram in bichromatic reverse k-nearest neighbor
AU - Gotoh, Yusuke
AU - Okubo, Chiori
PY - 2017
Y1 - 2017
N2 - Purpose: This study aims to propose and evaluate a searching scheme for a bichromatic reverse k-nearest neighbor (BRkNN) that has objects and queries in spatial networks. In this proposed scheme, the author’s search for the BRkNN of the query using an influence zone for each object with a network Voronoi diagram (NVD). Design/methodology/approach: The author’s analyze and evaluate the performance of the proposed searching scheme. Findings: The contribution of this paper is that it confirmed that the proposed searching scheme gives shorter processing time than the conventional linear search. Research limitations/implications: A future direction of this study will involve making a searching scheme that reduces the processing time when objects move automatically on spatial networks. Practical implications: In BRkNN, consider two groups in a convenience store, where several convenience stores, which are constructed in Groups A and B, operate in a given region. The author’s can use RNN is RkNN when k = 1 (RNN) effectively to set a new store considering the Euclidean and road distances among stores and the location relationship between Groups A and B. Originality/value: In the proposed searching scheme, the author’s search for the BRkNN of the query for each object with an NVD using the influence zone, which is the region where an object in the spatial network recognizes the nearest neighbor for the query.
AB - Purpose: This study aims to propose and evaluate a searching scheme for a bichromatic reverse k-nearest neighbor (BRkNN) that has objects and queries in spatial networks. In this proposed scheme, the author’s search for the BRkNN of the query using an influence zone for each object with a network Voronoi diagram (NVD). Design/methodology/approach: The author’s analyze and evaluate the performance of the proposed searching scheme. Findings: The contribution of this paper is that it confirmed that the proposed searching scheme gives shorter processing time than the conventional linear search. Research limitations/implications: A future direction of this study will involve making a searching scheme that reduces the processing time when objects move automatically on spatial networks. Practical implications: In BRkNN, consider two groups in a convenience store, where several convenience stores, which are constructed in Groups A and B, operate in a given region. The author’s can use RNN is RkNN when k = 1 (RNN) effectively to set a new store considering the Euclidean and road distances among stores and the location relationship between Groups A and B. Originality/value: In the proposed searching scheme, the author’s search for the BRkNN of the query for each object with an NVD using the influence zone, which is the region where an object in the spatial network recognizes the nearest neighbor for the query.
KW - Bichromatic reverse k-nearest neighbor query
KW - Network Voronoi diagram
KW - Processing time
UR - http://www.scopus.com/inward/record.url?scp=85021293938&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85021293938&partnerID=8YFLogxK
U2 - 10.1108/IJPCC-01-2017-0009
DO - 10.1108/IJPCC-01-2017-0009
M3 - Article
AN - SCOPUS:85021293938
VL - 13
SP - 62
EP - 75
JO - International Journal of Pervasive Computing and Communications
JF - International Journal of Pervasive Computing and Communications
SN - 1742-7371
IS - 1
ER -