Abstract
The internet is undoubtedly the biggest data source ever with tons of data from different sources following different formats. One of the main challenges in computer science is how to make data sharing and exchange between these sources possible; or in other words, how to develop a system that can deal with all these differences in data representation and extract useful knowledge from there. And since XML is the de facto standard for representing data on the internet, XML query matching has gained so much popularity recently. In this paper we present new types of fuzzy arc matching that can match a pattern arc to a schema arc as long as the correspondent parent and child nodes are there and have reachability between them. Experimental results shown that the proposed approach provided better results than previous works.
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
Harold, E., Means, W.: XML in a Nutshell. O’Reilly Media, Incorporated (2004)
Tekli, J., Chbeir, R., Yetongnon, K.: An overview on XML similarity: Background, current trends and future directions. Computer Science Review 3, 151–173 (2009)
Gang, G.: Efficiently Querying Large XML Data Repositories: A Survey. IEEE Transactions on Knowledge and Data Engineering 19, 1381–1403 (2007)
Sukomal Pal, M.M.: XML Retrieval: A Survey. Internet Policies and Issues 8, 229–272 (2006)
Marouane, H.: A Survey of XML Tree Patterns. IEEE Transactions on Knowledge and Data Engineering 99 (2011)
Polyzotis, N., Garofalakis, M., Ioannidis, Y.: Approximate XML query answers. Presented at the Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data, Paris, France (2004)
Sanz, I., Mesiti, M., Guerrini, G., Berlanga, R.: Fragment-based approximate retrieval in highly heterogeneous XML collections. Data Knowl. Eng. 64, 266–293 (2008)
Sanz, I., Mesiti, M., Guerrini, G., Llavori, R.B.: Approximate subtree identification in heterogeneous XML documents collections. Presented at the Proceedings of the Third International Conference on Database and XML Technologies, Trondheim, Norway (2005)
Algergawy, A., Nayak, R., Saake, G.: Element similarity measures in XML schema matching. Information Sciences 180, 4975–4998 (2010)
Agarwal, N., Oliveras, M.G., Chen, Y.: Approximate Structural Matching over Ordered XML Documents. Presented at the Proceedings of the 11th International Database Engineering and Applications Symposium (2007)
Rao, P., Moon, B.: PRIX: Indexing And Querying XML Using Sequences. Presented at the Proceedings of the 20th International Conference on Data Engineering (2004)
Wang, H., Meng, X.: On the Sequencing of Tree Structures for XML Indexing. Presented at the Proceedings of the 21st International Conference on Data Engineering (2005)
Wang, H., Park, S., Fan, W., Yu, P.S.: ViST: a dynamic index method for querying XML data by tree structures. Presented at the Proceedings of the 2003 ACM SIGMOD international conference on Management of data, San Diego, California (2003)
Alzebdi, M., Chountas, P., Atanassov, K.: Approximate XML Query Matching and Rewriting Using Intuitionistic Fuzzy Trees. Presented at the IEEE IS Sofia (2012)
Alzebdi, M., Chountas, P., Atanassov, K.: Intuitionistic Fuzzy XML Query Matching. In: Christiansen, H., De Tré, G., Yazici, A., Zadrozny, S., Andreasen, T., Larsen, H.L. (eds.) FQAS 2011. LNCS, vol. 7022, pp. 306–317. Springer, Heidelberg (2011)
Alzebdi, M., Chountas, P., Atanassov, K.T.: An IFTr approach to approximate XML query matching. Presented at the SMC (2011)
Alzebdi, M., Chountas, P., Atanassov, K.: Enhancing DWH Models with the Utilisation of Multiple Hierarchical Schemata. In: IEEE SMC 2010, pp. 488–492 (2010)
Chountas, P., Alzebdi, M., Shannon, A., Atanassov, K.: On Intuitionistic Fuzzy Trees. Notes on Intuitionistic Fuzzy Sets 15(2), 30–32 (2009)
Wiwatwattana, N., Jagadish, H.V., et al.: X^ 3: A Cube Operator for XML OLAP. In: IEEE 23rd International Conference on Data Engineering, ICDE 2007, pp. 916–925 (2007)
Chen, Y., Chen, Y.: A new tree inclusion algorithm. Inf. Process. Lett. 98, 253–262 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alzebdi, M., Chountas, P., Atanassov, K. (2013). Arc-Based Soft XML Pattern Matching. In: Larsen, H.L., Martin-Bautista, M.J., Vila, M.A., Andreasen, T., Christiansen, H. (eds) Flexible Query Answering Systems. FQAS 2013. Lecture Notes in Computer Science(), vol 8132. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40769-7_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-40769-7_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40768-0
Online ISBN: 978-3-642-40769-7
eBook Packages: Computer ScienceComputer Science (R0)