Abstract
Similarity search for data streams has attracted much attention recently in the area of information recommendation. This paper studies a continuous set similarity search which regards the latest W items in a data stream as an evolving set. So far, a top-k similarity search problem called CEQ (Continuous similarity search for Evolving Query) has been researched in the literature, where the query evolves dynamically and the database consists of multiple static sets. By contrast, this paper examines a new top-k similarity search problem, where the query is a static set and the database consists of multiple dynamic sets extracted from multiple data streams. This new problem is named as CED (Continuous similarity search for Evolving Database). Our main contribution is to develop a pruning-based exact algorithm for CED. Though our algorithm is created by extending the previous pruning-based exact algorithm for CEQ, it runs substantially faster than the one which simply adapts the exact algorithm for CEQ to CED. Our algorithm achieves this speed by devising two novel techniques to refine the similarity upper bounds for pruning.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Efstathiades, C., Belesiotis, A., Skoutas, D., Pfoser, D.: Similarity search on spatio-textual point sets. In: Proceedings of the 19th International Conference on Extending Database Technology, EDBT, pp. 329–340 (2016)
Mann, W., Augsten, N., Jensen, C.S.: SWOOP: top-k similarity joins over set streams. CoRR abs/1711.02476 (2017). http://arxiv.org/abs/1711.02476
Leong Hou, U., Zhang, J., Moruatidis, K., Li, Y.: Continuous top-k monitoring on document streams. IEEE Trans. Knowl. Data Eng. 29(5), 991–1003 (2017)
Wang, P., et al.: A memory-efficient sketch method for estimating high similarities in streaming sets. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 25–33 (2019)
Wang, X., Zhang, Y., Zhang, W., Lin, X., Huang, Z.: Skype: top-k spatial-keyword publish/subscribe over sliding window. Proc. VLDB Endow. 9(7), 588–599 (2016)
Xu, X., Gao, C., Pei, J., Wang, K., Al-Barakati, A.: Continuous similarity search for evolving queries. Knowl. Inf. Syst. 48(3), 649–678 (2015). https://doi.org/10.1007/s10115-015-0892-x
Yamazaki, T., Koga, H., Toda, T.: Fast exact algorithm to solve continuous similarity search for evolving queries. In: Sung, W.K., et al. (eds.) AIRS 2017. LNCS, vol. 10648, pp. 84–96. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-70145-5_7
Yang, D., Shastri, A., Rundensteiner, E.A., Ward, M.O.: An optimal strategy for monitoring top-k queries in streaming windows. In: Proceedings of the 14th International Conference on Extending Database Technology, pp. 57–68 (2011)
Yang, D., Li, B., Cudré-Mauroux, P.: POIsketch: semantic place labeling over user activity streams. In: Proceedings of the IJCAI 2016, pp. 2697–2703 (2016)
Acknowledgments
This work was supported by JSPS KAKENHI Grant Number JP18K11311, 2020.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Koga, H., Noguchi, D. (2020). Continuous Similarity Search for Evolving Database. In: Satoh, S., et al. Similarity Search and Applications. SISAP 2020. Lecture Notes in Computer Science(), vol 12440. Springer, Cham. https://doi.org/10.1007/978-3-030-60936-8_12
Download citation
DOI: https://doi.org/10.1007/978-3-030-60936-8_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-60935-1
Online ISBN: 978-3-030-60936-8
eBook Packages: Computer ScienceComputer Science (R0)