Abstract
In this paper, we propose an approximate solution to the multi-step k-NN search. The traditional multi-step k-NN search (1) determines a tolerance through a k-NN query on a multidimensional index and (2) retrieves the final k results by evaluating the tolerance-based range query on the index and by accessing the actual database. The proposed tolerance reduction-based (approximate) solution reduces a large number of candidates by adjusting the tolerance of the range query on the index. To obtain the tight tolerance, the proposed solution forcibly decreases the tolerance by the average ratio of high-dimensional and low-dimensional distances. Experimental results show that the proposed approximate solution significantly reduces the number of candidates and the k-NN search time over the existing one.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R∗-tree: An Effi- cient and Robust Access Method for Points and Rectangles. In: Proc. Int’l Conf. on Management of Data, ACM SIGMOD, Atlantic City, New Jersey, pp. 322–331 (May 1990)
Faloutsos, C., Ranganathan, M., Manolopoulos, Y.: Fast Subsequence Matching in Time-Series Databases. In: Proc. Int’l Conf. on Management of Data, ACM SIGMOD, Minneapolis, Minnesota, pp. 419–429 (May 1994)
Han, W.-S., Lee, J., Moon, Y.-S., Hwang, S.-W., Yu, H.: A New Approach for Processing Ranked Subsequence Matching Based on Ranked Union. In: Proc. of Int’l Conf. on Management of Data, ACM SIGMOD, Athens, Greece (June 2011)
Korn, F., Sidiropoulos, N., Faloutsos, C., Siegel, E., Protopapas, Z.: Fast Nearest Neighbor Search in Medical Image Databases. In: Proc. of the 22nd Int’l Conference on Very Large Data Bases, Bombay, India, pp. 215–226 (September 1996)
Moon, Y.-S., Whang, K.-Y., Han, W.-S.: General Match: A Subsequence Matching Method in Time-Series Databases Based on Generalized Windows. In: Proc. Intl Conf. on Management of Data, ACM SIGMOD, Madison, Wisconsin, pp. 382–393 (June 2002)
Moon, Y.-S., Kim, B.-S., Kim, M.S., Whang, K.-Y.: Scaling-Invariant Bound-ary Image Matching Using Time-Series Matching Techniques. Data & Knowledge Engineering 69(10), 1022–1042 (2010)
Roh, G., Roh, J., Hwang, S., Yi, B.: Supporting Pattern Matching Queries over Trajectories on Road Networks. IEEE Trans. on Knowledge and Data Engineering 23(11), 1 758–1759 (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, S., Kim, BS., Choi, MJ., Moon, YS. (2014). An Approximate Multi-step k-NN Search in Time-Series Databases. In: Jeong, H., S. Obaidat, M., Yen, N., Park, J. (eds) Advances in Computer Science and its Applications. Lecture Notes in Electrical Engineering, vol 279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41674-3_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-41674-3_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41673-6
Online ISBN: 978-3-642-41674-3
eBook Packages: EngineeringEngineering (R0)