Abstract: This specification defines a format for representing simple sensor measurements and device parameters in the Sensor Measurement Lists (SenML). Representations are defined in JavaScript Object Notation (JSON), Concise Binary Object Representation (CBOR), Extensible Markup Language (XML), and Efficient XML Interchange (EXI), which share the common SenML data model. A simple sensor, such as a temperature sensor, could use one of these media types in protocols such as HTTP or CoAP to transport the measurements of the sensor or to be configured.

Abstract: This specification defines media types for representing simple sensor measurements and device parameters in the Sensor Measurement Lists (SenML). Representations are defined in JavaScript Object Notation (JSON), Concise Binary Object Representation (CBOR), eXtensible Markup Language (XML), and Efficient XML Interchange (EXI), which share the common SenML data model. A simple sensor, such as a temperature sensor, could use one of these media types in protocols such as HTTP or CoAP to transport the measurements of the sensor or to be configured.

Abstract: Trajectory Specification is a method of specifying aircraft trajectories with tolerances such that the position at any given time in flight is constrained to a precisely defined bounding space. The bounding space at any given time is defined by tolerances relative to a reference trajectory that specifies position as a function of time. The tolerances are dynamic and are based on the aircraft navigation capabilities and the Traffic situation. This paper proposes a standard Trajectory Specification Language (TSL) based on the Extensible Markup Language (XML) to represent these specifications and to communicate them by datalink. The language can be used to downlink trajectory requests from air to ground and to uplink trajectory assignments from ground to air. The XML format can be converted to binary for operational use, if necessary, using Efficient XML Interchange (EXI) or Abstract Syntax Notation (ASN.1).

Abstract: A new method is proposed for clustering XML documents by structure-constrained phrases. It is implemented by three machine-learning approaches previously unexplored in the XML domain, namely non-negative matrix (tri-)factorization, co-clustering and automatic transactional clustering. A novel class of XML features approximately captures structure-constrained phrases as n-grams contextualized by root-to-leaf paths. Experiments over real-world benchmark XML corpora show that the effectiveness of the three approaches improves with contextualized n-grams of suitable length. This confirms the validity of the devised method from multiple clustering perspectives. Two approaches overcome in effectiveness several state-of-the-art competitors. The scalability of the three approaches is investigated, too.

Abstract: As XML files are less redundant and readily reorganized, it is really difficult to design a XML watermarking scheme which can get a trade-off between robust and invisible. However, this trade-off can be achieved by the Zero-Watermark method. In this paper, two Zero-Watermark methods are designed and tested for XML documents. One is XSLT-related method which is designed with embedding extra codes in XSLT file to serve as sort of copyright function. Another uses the functional dependency of XML file as feature for Zero-Watermark. Experiment results show that both methods have good real-time performances. Experiment results show that Zero-Watermark algorithm with functional dependency can resist selection attacks, alteration attacks, reorganization attacks and compression attacks.

Abstract: Everyday a huge number of new information resources are linked to the web This way the web is growing very fast, making search tasks more and more difficult with worse results To solve the problem several initiatives were undertaken and a new area of research and development emerged: the one called Semantic Web When we refer to the semantic web we are thinking about a network of concepts Each concept has a group of related resources and can be related to other concepts; we can then use this concept network to navigate among web resources or simply among information resources From the undertaken initiatives one became an ISO standard: Topic Maps ISO 13250 The aim of this paper is to introduce a Topic Map (TM) Builder , that is a processor that extracts topics and relations from instances of a family of XML documents A TM-Builder is strongly dependent on the resources structure So, to extract a topic map for different collections of information resources (sets of documents with different structures) we have to implement several TM-Builders, one for each collection This is not very easy! To overcome this inconvenient we have created an XML abstraction layer for TM-Buildersthat enables us to specify the topic map we want to build from a concrete family of resources, in order to generate automatically the intended extractor To describe that process, ie the extraction of knowledge from XML documents to produce a TM, we present a language to specify topic maps for a class of XML documents, that we call XSTM (XML Specification for Topic Maps) We also discuss a XSL processor that automatically generates the Extractor from its formal specification written in XSTM, the XSTM-P

Abstract: In this paper we present Andromeda, a system for processing queries and updates on large XML documents. The system is based on the idea of statically and dynamically partitioning the input document, so as to distribute the computing load among the machines of a MapReduce cluster.

Abstract: Wireless data broadcast is an efficient way of delivering data of common interest to a large population of mobile devices within a proximate area, such as smart cities, battle fields, etc. In this work, we focus ourselves on studying the data placement problem of periodic XML data broadcast in mobile and wireless environments. This is an important issue, particularly when XML becomes prevalent in today’s ubiquitous and mobile computing devices and applications. Taking advantage of the structured characteristics of XML data, effective broadcast programs can be generated based on the XML data on the server only. An XML data broadcast system is developed and a theoretical analysis on the XML data placement on a wireless channel is also presented, which forms the basis of the novel data placement algorithm in this work. The proposed algorithm is validated through a set of experiments. The results show that the proposed algorithm can effectively place XML data on air and significantly improve the overall access efficiency.

Abstract: We consider the setting of secure publishing of XML documents, in which read-only access control policies (ACPs) over static XML datasets are enforced using cryptographic keys. The role-based access control (RBAC) model provides a flexible method for specifying such policies. Extending the RBAC model to include role parameterization addresses the problem of role proliferation which can occur in large scale systems. In this paper, we describe the complete design of a parameterized RBAC (PRBAC) model for XML documents. We also describe algorithms for generating the minimum number of keys required to enforce an arbitrary PRBAC policy; for distributing to each user only keys needed for decrypting accessible nodes; and for applying the minimal number of encryption operations to an XML document required to satisfy the protection requirements of the policy. The time complexity of our approach is linear w.r.t. document size and the number of roles.

Abstract: As XML documents are increasingly being used in a wide variety of applications and often people work in teams distributed across space and time, it is very important that users are supported for editing collaboratively XML documents. Existing tools do not offer appropriate support for the management of conflicting changes performed in parallel on XML documents. In this paper we propose a merging mechanism that offers users the possibility to define conflict nodes prevented from integration of concurrent changes. Changes referring to non-conflict nodes are automatically merged, while users are assisted to manually merge changes referring to conflict nodes. Changes are tracked by means of operations associated to the nodes they target and merging relies on an operation-transformation mechanism adapted for hierarchical structures.

Abstract: Keyword search on XML document has received wide attention. Many search semantics and algorithms have been proposed for XML keyword queries. But the existing approaches fall short in their abilities to support keyword queries over fuzzy XML documents. To overcome this limitation, in this paper, we discuss how to obtain and evaluate top-k smallest lowest common ancestor (SLCA) results of keyword queries on fuzzy XML documents. We define the fuzzy SLCA semantics on the fuzzy XML document, and then propose a novel encoding scheme to denote different types of nodes in fuzzy XML documents. After these, we propose two efficient algorithms to find k SLCA results with highest possibilities for a given keyword query on the fuzzy XML document. First one is an algorithm which can obtain the top-k SLCA results and their possibilities based on the stack technique. The second algorithm can obtain top-k SLCA results of keyword queries based on a set of SLCA’s properties. Finally, we compare and evaluate the performances of the two algorithms.

Abstract: XQuery Full-Text is the proposed standard language for querying XML documents using either standard or full-text conditions; while full-text conditions can have a boolean or a ranked semantics, standard conditions must be satisfied for an element to be returned. This paper proposes a more general formal model that considers structural, value-based and full-text conditions as desiderata rather than mandatory constraints. The goal is achieved defining a set of relaxation operators that, given a path expression or a selection condition, return a set of relaxed path expressions or selection conditions. Algebraic approximated operators are defined for representing typical queries and returns either elements that perfectly respect the conditions and elements that answer to a relaxed version of the original query. A score reflecting the level of satisfaction of the original query is assigned to each result of the relaxed query.

Abstract: In this paper we recommend the use of multi-channel for XML data in wireless broadcasting. First we divide XML data into information units as bucket, then extract path information (XPath) for any unit and build an index tree from the data path. Finally, make wireless data stream with merging parts of index tree and parts of XML data in multichannel XML. Then, create a protocol that allows mobile users access to the wireless XML stream generated with our method. We study 11 channels in server side and 3 orthogonal channels in client side.

Abstract: XML (Extensible Mark up language) is emerging as a tool for representing and exchanging data over the internet. When we want to store and query XML data, we can use two approaches either by using native databases or XML enabled databases. In this paper we deal with XML enabled databases. We use relational databases to store XML documents. In this paper we focus on mapping of XML DTD into relations. Mapping needs three steps: 1) Simplify Complex DTD’s 2) Make DTD graph by using simplified DTD’s 3) Generate Relational schema. We present an inlining algorithm for generating relational schemas from available DTD’s. This algorithm also handles recursion in an XML document.

Abstract: XML (Extensible Mark up language) is emerging as a tool for representing and exchanging data over the internet. When we want to store and query XML data, we can use two approaches either by using native databases or XML enabled databases. In this paper we deal with XML enabled databases. We use relational databases to store XML documents. In this paper we focus on mapping of XML DTD into relations. Mapping needs three steps: 1) Simplify Complex DTD’s 2) Make DTD graph by using simplified DTD’s 3) Generate Relational schema. We present an inlining algorithm for generating relational schemas from available DTD’s. This algorithm also handles recursion in an XML document.

Abstract: The volume of XML data exchange is explosively increasing, and the need for efficient mechanisms of XML data management is vital. Many XML storage models have been proposed for storing XML DTD-independent documents in relational database systems. Benchmarking is the best way to highlight pros and cons of different approaches. In this study, we use a common benchmarking scheme, known as XMark to compare the most cited and newly proposed DTD-independent methods in terms of logical reads, physical I/O, CPU time and duration. We show the effect of Label Path, extracting values and storing in another table and type of join needed for each method-s query answering.

Abstract: This report describes the development, design and implementation of a Java SE software application to create and persist objects from JSON and XML data. The software replicates data from adjacent business systems (i.e. CRIS), external RESTful web services (e.g. OaDoi) and persists data in a MySQL database.
Java frameworks and libraries were relevant to the model’s behaviour and subsequent design and implementation. Within the model, JAXB (‘Java Architecture for XML Binding’) enables efficient processing of XML data. JAXB ‘marshals’ POJOs into XML and ‘unmarshals’ XML back into POJOs. The ‘Hibernate ORM’ framework persists object data in relational database. In this project the database component used was MySQL v5.5.

Abstract: Data validation is becoming more and more important with the ever-growing amount of data being consumed and transmitted by systems over the Internet. It is important to ensure that the data being sent is valid as it may contain entry errors, which may be consumed by different systems causing further errors. XML has become the defacto standard for data transfer. The XML Schema Definition language (XSD) was created to help XML structural validation and provide a schema for data type restrictions, however it does not allow for more complex situations. In this article we introduce a way to provide rule based XML validation and correction through the extension and improvement of our SRML metalanguage. We also explore the option of applying it in a database as a trigger for CRUD operations allowing more granular dataset validation on an atomic level allowing for more complex dataset record validation rules.

Abstract: As the use of XML as a technology for data exchange has widely spread, the need of a new technology to store semi-structured data in a more efficient way has been emphasized. Consequently, XML DBs have been created in order to store a great amount of XML documents. However, like in previous data models as the relational model, data quality has been frequently left aside. Since data plays a key role in organization efficiency management, its quality should be managed. With the intention of providing a base for data quality management, our proposal address the adaptation of a XML DB development methodology focused on data quality. To do that we have based on some key area processes of a Data Quality Maturity reference model for information management process definition.

Abstract: The volume of XML data exchange is explosively increasing, and the need for efficient mechanisms of XML data management is vital. Many XML storage models have been proposed for storing XML DTD-independent documents in relational database systems. Benchmarking is the best way to highlight pros and cons of different approaches. In this study, we use a common benchmarking scheme, known as XMark to compare the most cited and newly proposed DTD-independent methods in terms of logical reads, physical I/O, CPU time and duration. We show the effect of Label Path, extracting values and storing in another table and type of join needed for each method's query answering.