TY - GEN
T1 - Continuous nearest neighbor search
AU - Lin, Lien Fa
AU - Chen, Chao-Chun
PY - 2008/12/1
Y1 - 2008/12/1
N2 - The query service for the location of an object is called Location Based Services (LBSs), and Reverse Nearest Neighbor (RNN) queries are one of them. RNN queries have diversified applications, such as decision support system, market decision, query of database document, and biological information. In the environment of wireless network, users often remain in moving conditions, and sending a query command while moving is a natural behavior. Availability of such service therefore becomes very important; we refer to this type of issue as Continuous Reverse Nearest Neighbor (CRNN) queries. Because an inquirer's location changes according to time, RNN queries will return different results according to different locations. For a CRNN query, executing RNN search for every point of time during a continuous query period will require a tremendously large price to pay. In this Study, an efficient algorithm is designed to provide precise results of a CRNN query in just one execution. In addition, a large amount of experiments were conducted to verify the above-mentioned method, of which results of the experiments showed significant enhancement in efficiency.
AB - The query service for the location of an object is called Location Based Services (LBSs), and Reverse Nearest Neighbor (RNN) queries are one of them. RNN queries have diversified applications, such as decision support system, market decision, query of database document, and biological information. In the environment of wireless network, users often remain in moving conditions, and sending a query command while moving is a natural behavior. Availability of such service therefore becomes very important; we refer to this type of issue as Continuous Reverse Nearest Neighbor (CRNN) queries. Because an inquirer's location changes according to time, RNN queries will return different results according to different locations. For a CRNN query, executing RNN search for every point of time during a continuous query period will require a tremendously large price to pay. In this Study, an efficient algorithm is designed to provide precise results of a CRNN query in just one execution. In addition, a large amount of experiments were conducted to verify the above-mentioned method, of which results of the experiments showed significant enhancement in efficiency.
UR - http://www.scopus.com/inward/record.url?scp=84869444820&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84869444820&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84869444820
SN - 1934272353
SN - 9781934272350
T3 - WMSCI 2008 - The 12th World Multi-Conference on Systemics, Cybernetics and Informatics, Jointly with the 14th International Conference on Information Systems Analysis and Synthesis, ISAS 2008 - Proc.
SP - 106
EP - 112
BT - WMSCI 2008 - The 12th World Multi-Conference on Systemics, Cybernetics and Informatics, Jointly with the 14th International Conference on Information Systems Analysis and Synthesis, ISAS 2008 - Proc.
T2 - 12th World Multi-Conference on Systemics, Cybernetics and Informatics, WMSCI 2008, Jointly with the 14th International Conference on Information Systems Analysis and Synthesis, ISAS 2008
Y2 - 29 June 2008 through 2 July 2008
ER -