Abstract
Schema inference has been an essential task in database management, and can be reduced to learning regular expressions from positive finite-samples. In this paper, schemata are inferred from unordered XML documents. We extend the single-occurrence regular expressions (SOREs) to single-occurrence regular expressions with unorder and counting (SOREUCs), and give an inference algorithm for SOREUCs. First, we present a finite automaton with unorder and counting (FAUC). Then, we construct an FAUC for recognizing a given finite sample. Next, the FAUC runs on the given finite sample to obtain counting operators. Finally we transform the FAUC to a SOREUC by introducing unordered concatenations and counting operators. Experimental results demonstrate that, SOREUCs have stronger expressive powers for modeling unordered schemata than existing works, and our algorithm can efficiently infer a concise SOREUC with better generalization ability.
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
Notes
- 1.
In this paper, the mentioned membership problem is the uniform version that both the string and a representation of the language are given as inputs.
- 2.
For instance, \(Perm(\{1,2,3\})\!=\!\{\{1,2,3\},\{1,3,2\},\{2,1,3\},\{2,3,1\},\{3,1,2\},\{3,2,1\}\}\).
- 3.
- 4.
References
Abiteboul, S., Bourhis, P., Vianu, V.: Highly expressive query languages for unordered data trees. Theory Comput. Syst. 57(4), 927–966 (2015)
Amer-Yahia, S., Cho, S., Lakshmanan, L.V., Srivastava, D.: Tree pattern query minimization. VLDB J. 11(4), 315–331 (2002)
Bex, G.J., Neven, F., Schwentick, T., Tuyls, K.: Inference of concise DTDs from XML data. In: International Conference on Very Large Data Bases, Seoul, Korea, September, pp. 115–126 (2006)
Bex, G.J., Neven, F., Schwentick, T., Vansummeren, S.: Inference of concise regular expressions and DTDs. ACM Trans. Database Syst. 35(2), 1–47 (2010)
Boneva, I., Ciucanu, R., Staworko, S.: Schemas for unordered XML on a DIME. Theory Comput. Syst. 57(2), 337–376 (2015)
Boneva, I., Ciucanu, R., Staworko, S.: Simple schemas for unordered XML. In: 16th International Workshop on the Web and Databases (WebDB) (2013)
Brüggemann-Klein, A., Wood, D.: One-unambiguous regular languages. Inf. Comput. 142(2), 182–206 (1998)
Ciucanu, R., Staworko, S.: Learning schemas for unordered XML. arXiv preprint arXiv:1307.6348 (2013)
Colazzo, D., Ghelli, G., Sartiani, C.: Linear time membership in a class of regular expressions with counting, interleaving, and unordered concatenation. ACM Trans. Database Syst. (TODS) 42(4), 1–44 (2017)
Czerwinski, W., Martens, W., Niewerth, M., Parys, P.: Minimization of tree pattern queries. In: Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pp. 43–54 (2016)
Florescu, D.: Managing semi-structured data. Queue 3(8), 18–24 (2005)
Freydenberger, D.D., Kötzing, T.: Fast learning of restricted regular expressions and DTDs. Theory Comput. Syst. 57(4), 1114–1158 (2015)
Gelade, W., Gyssens, M., Martens, W.: Regular expressions with counting: weak versus strong determinism. SIAM J. Comput. 41(1), 160–190 (2012)
Golshan, B., Halevy, A., Mihaila, G., Tan, W.C.: Data integration: after the teenage years. In: Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pp. 101–106 (2017)
Grijzenhout, S., Marx, M.: The quality of the XML Web. In: Proceedings of the 20th ACM International Conference on Information and Knowledge Management, pp. 1719–1724 (2011)
Grijzenhout, S., Marx, M.: The quality of the XML Web. J. Web Semant 19, 59–68 (2013)
Hovland, D.: The membership problem for regular expressions with unordered concatenation and numerical constraints. In: Dediu, A.-H., MartÃn-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 313–324. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-28332-1_27
Lohrey, M., Maneth, S., Reh, C.P.: Compression of unordered XML trees. In: 20th International Conference on Database Theory (ICDT 2017), pp. 18:1–18:17 (2017)
International Organization for Standardization: Information Processing: Text and Office Systems: Standard Generalized Markup Language (SGML). ISO (1986)
Staworko, S., Wieczorek, P.: Learning twig and path queries. In: Proceedings of the 15th International Conference on Database Theory, pp. 140–154 (2012)
Thompson, H., Beech, D., Maloney, M., Mendelsohn, N.: XML Schema Part 1: structures, 2nd Edn. W3C Recommendation (2004)
Wang, X., Chen, H.: Inferring deterministic regular expression with unorder. In: Chatzigeorgiou, A., et al. (eds.) SOFSEM 2020. LNCS, vol. 12011, pp. 325–337. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-38919-2_27
Acknowledgements
Thanks for professor Haiming Chen, who provided much advice for preparing the final version of this paper, and this work was supported by National Nature Science Foundation of China (Nos. 61872339, 61472405).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Wang, X. (2021). Inferring Deterministic Regular Expression with Unorder and Counting. In: Jensen, C.S., et al. Database Systems for Advanced Applications. DASFAA 2021. Lecture Notes in Computer Science(), vol 12682. Springer, Cham. https://doi.org/10.1007/978-3-030-73197-7_15
Download citation
DOI: https://doi.org/10.1007/978-3-030-73197-7_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-73196-0
Online ISBN: 978-3-030-73197-7
eBook Packages: Computer ScienceComputer Science (R0)