Abstract
Recently because there are many kinds of exchanges of the information such as the dramatic growth of the internet, ubiquitous computing environment, and sensor network, it is required to process the infinite sequential data. And also there are researches related to query processing for streaming XML data. As a basic research to efficiently query, we propose a mining method to extract frequent structures of XML stream data in recent window based on the active window sliding using trigger rules.
Funding for this paper was provided by Namseoul university.
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.
Similar content being viewed by others
References
Manku, G.S., Motwani, R.: Approximate Frequency Counts over Data Streams. In: International Conference on Very Large Data Bases (2002)
Deligiannakis, A., Kotidis, Y., Roussopoulos, N.: Hierarchical In-Network Data Aggregation with Quality Guarantees. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., Böhm, K. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 658–675. Springer, Heidelberg (2004)
Chen, G., Wu, X., Zhu, X.: Mining Sequential Patterns Across Data Streams. Univ. of Vermont Computer Science Technical Report (CS-05-04) (2005)
Li, H.F., Lee, S.Y.: Mining Frequent Itemsets over Data Streams using Efficient Window Sliding Techniques. International Journal of Expert Systems with Applications (2009)
Chen, J., DeWitt, D.J., Tian, F., Wang, U.: A Scalable Continuous Query System for Internet Database. In: ACM SIGMOD (2000)
Yang, L.H., Lee, M.L., Hsu, W.: Finding Hot Query Patterns over An XQuery Stream. VLDB Journal Special Issue on Data Stream Processing (2004)
Asai, T., Abe, K., Kawasoe, S., Sakamoto, H., et al.: Online Algorithms for Mining Semi-Structured Data Stream. In: IEEE International Conference on Data Mining (2002)
Hwang, J.H., Gu, M.S.: Finding Frequent Structures in XML Stream Data. In: Computational Science and Its Applications, ICCSA (2009)
Hsieh, M.C., Wu, Y.H., Chen, A.L.: Discovering Frequent Tree Patterns over Data Stream. In: Proc. of SIAM (2006)
Leung, C.K.S., Khan, Q.I., Hoque, T.: CanTree: A Tree Structure for Efficient Incremental Mining of Frequent Pattern Sets. In: IEEE International Conference on Data Mining (2005)
Leung, C.K.S., Khan, Q.I.: DSTree: A Tree Structure for the Mining of Frequent Sets from Data Streams. In: IEEE International Conference on Data Mining (2006)
Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: Proc. of ACM SIGMOD International Conference on the Management of Data (2000)
NIAGARA query engine, http://www.cs.wisc.edu/niagara/data.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hwang, J.H., Gu, M.S. (2012). A Trigger Based Approach for Mining Frequent Structures of XML. In: Lee, G., Howard, D., Ślęzak, D., Hong, Y.S. (eds) Convergence and Hybrid Information Technology. ICHIT 2012. Communications in Computer and Information Science, vol 310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32692-9_52
Download citation
DOI: https://doi.org/10.1007/978-3-642-32692-9_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32691-2
Online ISBN: 978-3-642-32692-9
eBook Packages: Computer ScienceComputer Science (R0)