Abstract
Videos have become one of the most important communication means these days. In this paper, we propose an approach to efficiently bulk-insert a set of new video index-entries into the existing video database for content-based video search. Given the current situation that enormous amount of new videos are created and uploaded to the video sharing websites, the efficient approaches are highly required. The environment we focused is where a B + -tree is applied to index the video content-features. We propose a hybrid bulk-insertion approach based on a well-known bulk-insertion. Unlike the traditional bulk-insertion in which the traversals to insert the remaining index entries are performed to the ancestors, we propose to add a leaf-level traversal to improve the efficiency. Thus, our approach works in a hybrid manner, i.e., it switches between the leaf and ancestor traversals with regard to a condition with a very small additional cost. The experiments have been conducted to evaluate our proposed work by comparing to the one-by-one insertion approach, and the traditional bulk-insertion approach. The experiment results show that the proposed approach is highly efficient for video content-based indexing.
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
Wesch, M.: Youtube statistics (2008), http://mediatedcultures.net/ksudigg/?p=163
Cheng, R., Huang, Z., Shen, H.T., Zhou, X.: Interactive near-duplicate video retrieval and detection. In: MM 2009: Proceedings of the seventeen ACM International Conference on Multimedia, pp. 1001–1002. ACM, New York (2009)
Shen, H.T., Ooi, B.C., Zhou, X.: Towards effective indexing for very large video sequence database. In: SIGMOD 2005: Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, pp. 730–741. ACM, New York (2005)
Zhou, X., Zhou, X., Shen, H.T.: Efficient similarity search by summarization in large video database. In: Bailey, J., Fekete, A. (eds.) Eighteenth Australasian Database Conference (ADC 2007), CRPIT, Ballarat, Australia, ACS, vol. 63, pp. 161–167 (2007)
Kim, S.W.: On batch-constructing b+-trees: algorithm and its performance evaluation. Information Sciences 144, 151–167 (2002)
Pollari-Malmi, K., Soisalon-Soininen, E.: Concurrency control and i/o-optimality in bulk insertion. In: String Processing and Information Retrieval, pp. 161–170 (2004)
Chang, H.S., Sull, S., Lee, S.U.: Efficient video indexing scheme for content-based retrieval. IEEE Transactions on Circuits and Systems for Video Technology 9, 1269–1279 (1999)
Cheung, S.S., Zakhor, A.: Efficient video similarity measurement with video signature. IEEE Transactions on Circuits and Systems for Video Technology 13, 59–74 (2003)
Böhm, C., Berchtold, S., Keim, D.A.: Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Computing Suveys 33, 322–373 (2001)
Huang, Z., Shen, H.T., Shao, J., Zhou, X., Cui, B.: Bounded coordinate system indexing for real-time video clip search. ACM Transactions on Information Systems 27, 1–33 (2009)
Lu, H., Ooi, B.C., Shen, H.T., Xue, X.: Hierarchical indexing structure for efficient similarity search in video retrieval. IEEE Transactions on Knowledge and Data Engineering 18, 1544–1559 (2006)
Chen, L., Choubey, R., Rundensteiner, E.A.: Merging r-trees: Efficient strategies for local bulk insertion. Geoinformatica 6, 7–34 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Onkhum, N., Natwichai, J. (2010). Efficient Bulk-Insertion for Content-Based Video Indexing. In: Kang, BH., Richards, D. (eds) Knowledge Management and Acquisition for Smart Systems and Services. PKAW 2010. Lecture Notes in Computer Science(), vol 6232. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15037-1_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-15037-1_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15036-4
Online ISBN: 978-3-642-15037-1
eBook Packages: Computer ScienceComputer Science (R0)