TREE STRUCTURE DATA CHANGE DETECTION METHOD
DOI:
https://doi.org/10.20535/2411-2976.22014.30-39Abstract
The new method, increasing efficiency and reliability of change detection in three structures in the Internet data under indetermination of data structure (DTD, XML-Schema) is proposed in this paper. The Boolean linear programming problem was solved in two exact methods – modified Balazs with filter and modified DP method and A modified method for selecting a neural network architecture was proposed. There is also considered publish/subscribe system description enhanced with core module, which provides notifications of changes to subscribers only in case they occurred.
References
S. Сhawathe, H. Garcia-Molina, Meaningful change detection in structured data, in: Proceedings of the ACM, SIGMOD International Conference on Management of Data, Tuscon, Arizona, May 1997, pp. 26–37.
S. Chawathe, S. Abiteboul, J. Widom, Representing and querying changes in semistructured data, in: Proceedings of the International Conference on Data Engineering, Orlando, Florida, February 1998, pp. 4–13.
S. Flesca, E. Masciari Efficient and affective Web change Detection
Change Detection of XML Documents Using Signatures. Latifur Khan, Lei Wang and Yan Rao Department of Computer Science University of Texas at Dallas, 2003.
Küster, U., H. Lausen, and B. König-Ries, Evaluation of Semantic Service Discovery—A Survey and Directions for Future Research. Emerging Web Services Technology, 2008. 2: p. 41-58.
Keyvan M., Suhaimi I., Mojtaba K., Kanmani M., Sayed G. H. T.i, A comparative evaluation of semantic web service discovery approaches, Proceedings of the iiWAS2010, November 08-10, 2010, Paris, France.
J. Jyoti, A. Sachde, and S. Chakravarthy, “CX-DIFF: A Change Detection Algorithm for XML Content and Change Visualization for WebVigiL,” Data and Knowledge Eng., vol. 52, no. 2, pp. 209-230, 2005.
H. P. Khandagale and P. P. Halkarnikar. A Novel Approach for Web Page Change Detection System. International Journal of Computer Theory and Engineering, Vol. 2, No. 3, June, 2010.
Classification of Web-based publishing systems and subscription of information resources / Yu.N. Molchanov, N.A. Alekseyev, L.S. Globa, Feldman Marius // Visnyk of V.N. Karazina Kharkiv National University, series “Mathematical Modeling. Information Technology. Automated control systems”. – Vol. 9, № 809, 2008. – 3-8pp.
Larisa Globa, Mykola Alieksieiev, Iurii Molchanov, Liudmyla Kobzar /XML Documents Change Detection System, ACS, 2010.
Larysa Globa, Mykola Alieksieiev, Iurii Molchanov / XML DOCUMENTS CHANGE DETECTION SYSTEM BASED ON BOOLEAN LINEAR PROGRAMMING TASK, Metody Informatyki Stosowanej, Szczecin, 2/2011 (27).
A.N. Antamoshkin, I.S. Masich Efficient algorithms of constrained optimization of monotone pseudoboolean functions. Vesnik of SibSAU. Issue 4 – Krasnoyarsk: SibSAU, 2003.
Downloads
How to Cite
Issue
Section
License
The ownership of copyright remains with the Authors.
Authors may use their own material in other publications provided that the Journal is acknowledged as the original place of publication and National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute” as the Publisher.
ITS articles are published under Creative Commons licence:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under CC BY 4.0that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.