A Fast Filtering Method of Invalid Information in XML File
In practical application scenarios, XML files are analyzed and understood structurally according to the nested element tags, element attributes, element contents, etc. However, users are not clear about the content published based on XML in advance, so it is difficult to obtain the required content...
Saved in:
Published in | Big Data Analytics for Cyber-Physical System in Smart City Vol. 1303; pp. 259 - 264 |
---|---|
Main Authors | , , , , , , |
Format | Book Chapter |
Language | English |
Published |
Singapore
Springer
2020
Springer Singapore |
Series | Advances in Intelligent Systems and Computing |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | In practical application scenarios, XML files are analyzed and understood structurally according to the nested element tags, element attributes, element contents, etc. However, users are not clear about the content published based on XML in advance, so it is difficult to obtain the required content quickly and completely. Especially for large-scale XML files, the analysis time and iteration time are longer, and the time lost due to analysis errors is also longer. In this paper, a fast filtering method of invalid information in XML file is studied. Firstly, the method can establish an index for the XML file to be processed, and then query the case with the highest similarity with the index in the knowledge base, and match the case with the index with the highest similarity in the knowledge base. Then, the preprocess of the XML file is selected from the XML preprocessing process library according to the matching results. Finally, the results of the preliminary processing are transmitted to the receiver for further processing. The practical results show that this method can effectively reduce the length of XML file to be processed, and achieve the beneficial effect of rapid processing on the terminal, and greatly improve the efficiency. |
---|---|
ISBN: | 9789813345737 981334573X |
ISSN: | 2194-5357 2194-5365 |
DOI: | 10.1007/978-981-33-4572-0_38 |