Dealing with large schema sets in mobile SOS-based applications
Alain Tamayo, Carlos Granell, Joaqu\'in Huerta

TL;DR
This paper presents an algorithm that simplifies large XML schema sets for mobile SOS applications, improving performance by generating efficient code tailored to specific application needs.
Contribution
It introduces a novel algorithm that reduces large XML schemas into application-specific subsets, optimizing XML data binding for mobile SOS-based applications.
Findings
Significant reduction in XML schema complexity.
Improved memory and processing efficiency on mobile devices.
Enhanced performance of SOS-based mobile applications.
Abstract
Although the adoption of OGC Web Services for server, desktop and web applications has been successful, its penetration in mobile devices has been slow. One of the main reasons is the performance problems associated with XML processing as it consumes a lot of memory and processing time, which are scarce resources in a mobile device. In this paper we propose an algorithm to generate efficient code for XML data binding for mobile SOS-based applications. The algorithm take advantage of the fact that individual implementations use only some portions of the standards' schemas, which allows the simplification of large XML schema sets in an application-specific manner by using a subset of XML instance files conforming to these schemas.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
