XML Database

One major challenge for businesses today is the openning of their Information Systems (IS), making them accessible to their partners over the Internet. To this aim, they expose interfaces of their IS via Web Service technology which consists in loosely coupled components using XML documents and commonly agreed standards to communicate. But this component set is heterogeneous and changing despite new technologies like Web Services which assure a minimum level of interoperability. As such, the automation of Web Service composition is a key enabler for rapid deployment of new composite services. Past work on the semantic Web provides several high level solutions to discover potential connections and interactions between heterogeneous Web Services. However, few or none of these tackle implementations issues related to XML messages management at the syntactic level. This article focuses on adapting some XML database solutions, specifically XML Schema matching, to leverage the semantic matching analysis by providing a data transformation that enables data integration of exchanged messages. Our approach requires no semantic addition to already existing industrial engines to execute the resulting compositions. The preliminary evaluation results, provided by an implementation in an industrial project, shows the effectiveness of the proposed solution.

We present a native XML database management system, Sedna, which is implemented from scratch as a full-featured database management system for storing large amounts of XML data. We believe that the key contribution of this system is an improved schema-based clustering storage strategy efficient for both XML querying and updating, and powered by a novel memory management technique. We position our approach with respect to state-of-the-art methods.

A web application or web app is a computer program of the client-server in which client is run on the server. The client may include user interface and the client service logic. In this paper, a web application is presented by developing a sports event management platform for colleges by using java, JSP, XML. The application works on the module system. There are two modules which are user and admin module. Further, the user module was divided into student and teacher modules. An android application for user module was developed in order to create a user-friendly environment. This application creates an ease atmosphere to keep up the sports event at colleges. The admin module consists of multiple operations where they will add the teacher who is answerable for the particular event, add events going down at completely different colleges, add students and so on. The Teacher may add the student, view the results, the student will view results, can register for event they're curious about and can also post their questions. This paper provides the fortunate demonstration of a sports event management platform for colleges through an web app and an android app.

Automatic information extraction from online published scientific documents is useful in various applications such as tagging, web indexing and search engine optimization. As a result, automatic
information extraction has become among the hottest areas of research in text mining. Although various information extraction techniques have been proposed in the literature, their efficiency demands domain specific documents with static and well-defined format. Furthermore, their accuracy is challenged with a slight modification in the format. To overcome these issues, a novel ontological framework for information
extraction (OFIE) using fuzzy rule-base (FRB) and word sense disambiguation (WSD) is proposed. The proposed approach is validated with a significantly wider document domains sourced from well-known
publishing services such as IEEE, ACM, Elsevier, and Springer. We have also compared the proposed information extraction approach against state-of-the-art techniques. The results of the experiment show that
the proposed approach is less sensitive to changes in the document format and has a significantly better average accuracy of 89.14% and F-score as 89%.

Invention of XML as a universal standard for data representation triggered enormously wide efforts for its adaptation into almost every IT activity. Databases took one of the focusing places of the XML research. This paper investigates the development path of XML from its origins to its current place in distributed database systems. Through enumeration of features and analysis of the problems related to XML and distributed database systems it forms a platform for understanding the consequences of adopting XML to this area of IT.

Data exploration and visualization systems are of great importance in the Big Data era. Exploring and visualizing very large datasets has become a major research challenge, of which scalability is a vital requirement. In this survey, we describe the major prerequisites and challenges that should be addressed by the modern exploration and visualization systems. Considering these challenges, we present how state-of-the-art approaches from the Database and Information Visualization communities attempt to handle them. Finally , we survey the systems developed by Semantic Web community in the context of the Web of Linked Data, and discuss to which extent these satisfy the contemporary requirements.

Encryption and decryption of data is a process used in cryptography for encryption of data, and to get the data back to the original data. Data will be encrypted plaintext is called, the data generated from the encryption process is called the chiphertext. In this research used a method that uses symmetric cryptographic key as a password in the encryption process and use the same key for decryption process that will produce the same data with original data plaintext. Plaintext data that is encrypted to produce a chipertex that can not be read by others. Chipertext will be sent to the second party that will have a reliable confidentiality. Chipertex data produced will vary according to the data input keys provided password. In this paper using plaintext data in the form of XML data. XML data was processed using the XML database Xindice. Data or information can be saved and processed using XML database Xindice, i.e. XML database Xindice is a database system that can acommodate information in XML format. Keywords : encryption, decryption, XML, XML database Xindice

Clinical data are dynamic in nature having a very heterogeneous variety of data, coming from different sources making up its structure. Management and analysis of data in this form becomes difficult if implemented using RDBMS. This paper gives a detailed description of the problems faced by clinical databases due to the constraints of RDBMS. Through this paper we compare RDBMS with NoSQL and XML databases and further propose the use of these newer technologies in order to overcome the short comings of RDBMS experienced while implementing clinical databases.While NoSQL and XML technologies are relatively new, with further advancements in technology both of them demonstrate a potential to become an important databasetechnology for clinical data management.

Clio is an existing schema-mapping tool that provides user-friendly means to manage and facilitate the complex task of transformation and integration of heterogeneous data such as XML over the Web or in XML databases. By means of mappings from source to target schemas, Clio can help users conveniently establish the precise semantics of data transformation and integration. In this paper we study the problem of how to efficiently implement such data transformation (i.e., generating target data from the source data based on schema mappings). We present a three-phase framework for highperformance XML-to-XML transformation based on schema mappings, and discuss methodologies and algorithms for implementing these phases. In particular, we elaborate on novel techniques such as streamed extraction of mapped source values and scalable diskbased merging of overlapping data (including duplicate elimination). We compare our transformation framework with alternative methods such as using XQuery or SQL/XML provided by current commercial databases. The results demonstrate that the three-phase framework (although as simple as it is) is highly scalable and outperforms the alternative methods by orders of magnitude.

The exponential growth of the use of web technology has emphasized the need for sharing spatial information over the Web. Nowadays there exist quite a lot of SDIs (Spatial Database Infrastructures) that facilitate the GIS user community in getting access to distributed spatial data through web technology. However, sometimes the users first have to process available spatial data to determine the needed information. In this study, we propose an approach to provide the geoprocessing services over the Web, using an XML database system as back-end and GML as data encoding standard. Given that currently there is not yet a formal standard query language for GML. We demonstrate that the XQuery language can be extended with spatial semantics to carry out spatial computation upon GML data, proposing a syntax for spatial functions in XQuery based on the GML data model.

The Web of Data is an open environment consisting of a great number of large inter-linked RDF datasets from various do-mains. In this environment, organizations and companies adopt the Linked Data practices utilizing Semantic Web (SW) tech-nologies, in order to publish their data and offer SPARQL endpoints (i.e., SPARQL-based search services). On the other hand, the dominant standard for information exchange in the Web today is XML. Additionally, many international standards (e.g., Dublin Core, MPEG-7, METS, TEI, IEEE LOM) in several domains (e.g., Digital Libraries, GIS, Multimedia, e-Learning) have been expressed in XML Schema. The aforementioned have led to an increasing emphasis on XML data, accessed using the XQuery query language. The SW and XML worlds and their developed infrastructures are based on different data models, semantics and query languages. Thus, it is crucial to develop interoperability mechanisms that allow the Web of Data users to access XML datasets, using SPARQL, from their own working environments. It is unrealistic to expect that all the existing legacy data (e.g., Relational, XML, etc.) will be transformed into SW data. Therefore, publishing legacy data as Linked Data and providing SPARQL endpoints over them has become a major research challenge. In this direction, we introduce the SPARQL2XQuery Framework which creates an interoperable environment, where SPARQL queries are automatically translated to XQuery queries, in order to access XML data across the Web. The SPARQL2XQuery Framework provides a mapping model for the expression of OWL–RDF/S to XML Schema mappings as well as a method for SPARQL to XQuery translation. To this end, our Framework supports both manual and automatic mapping specification between ontologies and XML Schemas. In the automatic mapping specification scenario, the SPARQL2XQuery exploits the XS2OWL component which transforms XML Sche-mas into OWL ontologies. Finally, extensive experiments have been conducted in order to evaluate the schema transfor-mation, mapping generation, query translation and query evaluation efficiency, using both real and synthetic datasets.

The twig join, which is used to find all occurrences of a twig pattern in an XML database, is a core operation for XML query processing. A great many strategies for handling this problem have been proposed and can be roughly classified into two groups. The first group decomposes a twig pattern (a small tree) into a set of binary relationships between pairs of nodes, such as parent-child and ancestor-descendant relations; and transforms a tree matching problem into a series of simple relation look-ups. The second group decomposes a twig pattern into a set of paths. Among all this kind of methods, the approach based on the so-called stack encoding by Bruno et. al. [2] is very interesting, which can represent in linear space a potentially exponential (in the number of query nodes) number of matching paths. However, the available processes for generating such compressed paths suffer some redundancy and can be significantly improved. In this paper, we analyze this method and show that th...

The German-Vietnamese water-related information system for the Mekong Delta (WISDOM) project supports business processes in Integrated Water Resources Management in Vietnam. Multiple disciplines bring together earth and ground based observation themes, such as environmental monitoring, water management, demographics, economy, information technology, and infrastructural systems.

A key factor for the outstanding success of database manage-ment systems is physical data independence: queries, and appli-cation programs, are able to refer to the data at the logical level, ignoring the details on how the data is physically stored and ac-cessed by the system. The corner stone of implementing physical data independence is an access path selection algorithm: whenever

XML has become a standard format in information exchange and integration on the Web. Much research has been conducted in recent years on XML technology, which has led to new developments in this field. The effective combination of XML and relational databases for portable Internet data exchange and data management is the technology platform of choice for the Internet Applications. Our paper describes the relationship between XML and relational databases and its potential as an enabling technology to support e-learning. Also the paper discusses how relational databases and XML fit together and briefly illustrates their implication in the development of elearning systems. We introduce our e-learning model, as an example of this new developing methodology.

This paper describes the overall design and architecture of the Timber XML database system currently being implemented at the University of Michigan. The system is based upon a bulk algebra for manipulating trees, and natively stores XML. New access methods have been developed to evaluate queries in the XML context, and new cost estimation and query optimization techniques have also been developed. We present performance numbers to support some of our design decisions.

XML has become a common language for data exchange on the Web, so it needs to be managed effectively. There are four central problems in XML data management: capture, storage, retrieval, and exchange. Even though numerous database systems are available, the relational database (RDB) is often used to store and query the content of XML documents. Therefore the processes of mapping from XML to RDB and vice versa occur frequently. Numerous researchers have proposed
approaches to map hierarchically structured XML documents into the tabular format of a RDB. However, the previously developed approaches have faced problems in terms of storage and query response time. If the design of a RDB is inefficient, the number of join operations between tables increases when a query is executed, which affects the query
response time. To overcome this limitation, this paper proposes a new mapping approach, known as XAncestor, which consists of two algorithms: an XML mapping algorithm (XtoDB) and a query mapping algorithm (XtoSQL). XtoDB maps XML documents to a fixed RDB with less storage space. XtoSQL translates XPath queries into corresponding SQL queries based on the constructed RDB in order to reduce the query response time i.e., the time taken to execute the translated SQL query. XAncestor is then developed as a prototype in order to test its  effectiveness. The results of XAncestor are compared with those produced by five similar approaches. The comparison proves that XAncestor performs better than the previously developed approaches in terms of effectiveness and scalability. The correctness of XAncestor is also verified. The paper concludes with some recommendations for further work.

This paper introduces a new video surveillance dataset that was captured by a network of synchronized cameras placed throughout an indoor setting and augmented with groundtruth data. The dataset includes ten minutes of footage of individuals who are moving throughout the sensor network. In addition, three scripted scenarios that contain behaviors exhibited over a wide-area, such as "gathering for a meeting" or "stealing an object" are included to assist researchers who are interested in wide-area surveillance and behavior recognition. In addition to the video data, a face and gait database for all twelve individuals observed by the network of cameras is supplied. Hand-segmented groundtruth foreground regions are provided for every 500th frame in all cameras and for many sequential frames in two overlapping views. The entrance and exit time of each individual in each camera for one of the scenarios is provided in an XML database. We believe that the dataset will help provide a common development and verification framework for the increasing number of research efforts related to video surveillance in multiple, potentially non-overlapping, camera networks.

XML documents are widely used as a generic container for textual contents. As they are increasingly growing in size, XML databases are emerging to efficiently store and query their contents. Besides, due to the hierarchic structure of XML documents, hierarchic visualizations are needed to facilitiate cognitive access to query results. BaseX is a simple database prototype, mapping XML documents to a table based tree encoding. An integrated treemap visualization and a query interface allow visual access to the documents and demonstrate the efficiency of the underlying data storage.

Component-based development methodology is one of the recent research windows in software engineering field. It investigates in how to build a reusable component to be used later in another application/context/domain. It targets the increase of software quality and the decrease of the production cost. Component-based development has many challenges to be applied in real world such as the impact on the running project schedule and budget. In this paper, a survey of component-based development and reuse driven development life cycles is presented. We present our proposed model " Integrated Component-Based development " (ICBD) life cycle. ICBD contains all the needed activities towards a complete component-based development lifecycle. Comparison between ICBD, normal component-based development, and non-component based development is provided in this research. The presented case study proves that ICBD could decrease the effort of the projects by 40% after few months of applying.

Hosam F. El-Sofany 1 , Fayed FM Ghaleb 2 , Sameh S. Daoud 2 , Samir A. El- ... Seoud 3 , Ahmad M. Hasna 1 , and Jihad M. Jaam 1 ... 1Department of Engineering and Computer Science, Faculty of Engineering, Qatar university. 2Department of Mathematics, Faculty of Science, Ain ...

Many applications and data enterprises need to change their data content and structure from time to time. The schema evolution in database systems has been studied well by the database community and several projects have been proposed for supporting schema modifications in XML and relational models individually. However, these studies do not investigate well the evolutionary process in hybrid XML-relational systems. In this paper we will investigate the schema evolution for current hybrid XML-relational systems. We will propose a taxonomy for schema evolution in a way that preserves a schema after data evolves. Finally, we proposed a general model which will be evaluated through a case study.

Main memory cache performance continues to play an important role in determining the overall performance of object-oriented, object-relational and XML databases. An effective method of improving main memory cache performance is to prefetch or pre-load pages in advance to their usage, in anticipation of main memory cache misses. In this paper we describe a framework for creating prefetching algorithms with the novel features of path and cache consciousness. Path consciousness refers to the use of short sequences of object references at key points in the reference trace to identify paths of navigation. Cache consciousness refers to the use of historical page access knowledge to guess which pages are likely to be main memory cache resident most of the time and then assumes these pages do not exist in the context of prefetching. We have conducted a number of experiments comparing our approach against four highly competitive prefetching algorithms. The results shows our approach outperforms existing prefetching techniques in some situations while performing worse in others. We provide guidelines as to when our algorithm should be used and when others maybe more desirable.

— In searching process user enter particular candidate searching keyword and with the help of searching algorithm respective searching query is executed on targeted dataset and result is return as an output of that algorithm. In this case it is expected that meaningful keyword has to be entered by user to get appropriate result set. In case of confusing bunch of keywords or ambiguity in it or short and indistinctness in it causes an irrelevant searching result. Also searching algorithms works on exact result fetching which can be irrelevant in case problem in input query and keyword. This problem statement is focused in this system. By considering the keyword and its relevant context in XML data , searching should be done using automatically diversification process of XML keyword search. In this way system may satisfy user, as user gets the analytical result set based on context of searching keywords. For more efficiency and to deal with big data, HADOOP platform is used. baseline efficient algorithms are proposed to incrementally compute top-k qualified query candidates as the diversified search intentions. Compare selection criteria are targeted: the k selected query candidates are most relevant to the given query while they have to cover maximal number of distinct results on real and synthetic data sets demonstrates the effectiveness diversification model and the efficiency of algorithms

Existing work on XML query evaluation has either focused on algebraic optimization techniques suitable for XML databases, or on algorithms to efficiently process XML messages represented as a stream of parsing events. In practice, complex applications often must handle both. In this paper, we develop a physical algebra that combines streaming operators with other standard relational and XML operators. Our physical model includes marked XML streams, which permit efficient XPath evaluation, but can only be consumed once. This constraint restricts the use of streaming operators to fragments of a query plan that only access data using depth-first traversal. We develop static analysis techniques to decide which fragment of a plan can be streamed. Our experiments demonstrate the benefits of blending streaming with other evaluation techniques. Serialize Streamed Streamed Sequence Export Attribute[person] MapToItem { Element[bid] } Export IN#uid LOuterJoin_Hash { IN#uid = IN#pid } MapIndex[i] MapFromItem{[dot: IN]} Open("pdb.xml") Load Map{[uid: ]} IN#dot TreePattern_TwigJoin [.//person{p}/@id{pid}] GroupBy [i][person]{IN#p} TreePattern_TwigJoin[./profile] MapFromItem{[dot: IN]} IN#person TreeProject_Token[.//bidder/@uid] TreeJoin_Token[.//bidder] TreeJoin_Token[./@uid]

The shift from SGML to XML has created new demands for managing structured documents. Many XML documents will be transient representations for the purpose of data exchange between different types of applications, but there will also be a need for effective means to manage persistent XML data as a database. In this paper we explore requirements for an XML database management system. The purpose of the paper is not to suggest a single type of system covering all necessary features. Instead the purpose is to initiate discussion of the requirements arising from document collections, to offer a context in which to evaluate current and future solutions, and to encourage the development of proper models and systems for XML database management. Our discussion addresses issues arising from data modelling, data definition, and data manipulation.

In relational model, functional dependency is a very well established concept. It is the technique used to enforce data integrity by specifying the constraints that may exist in the relations and in discovering redundancies during database design. XML as a new technology in data management need a similar technique to achieve data integrity in its environment. As the number of applications using native XML documents is increasing rapidly, there exist great interests in how to extend this concept in XML environment. However generalizing relational constraints to XML constraints is nontrivial because of the hierarchical and flexible structure of XML compared with flat representation of relational table. In this paper we propose a formal definition of functional dependency for XML that can specify constraints in hierarchical nested structure of XML. The advantage of this definition compared with the existing definitions is that, it's able to specify constraints that hold not only in the entire document (globally) but also can scope within the sub-document (locally).

We detail the design of a search engine for archival finding aids based on an XML database system. The resulting system shows results-which can vary in granularity from individual archival items to the whole fonds-within the context of the archive. The presentation preserves the archival structure by providing important contextual information, and all individual results can be "clicked", warping the user to the full finding aid with the selected part in focus.

This paper introduces a new video surveillance dataset that was captured by a network of synchronized cameras placed throughout an indoor setting and augmented with groundtruth data. The dataset includes ten minutes of footage of individuals who are moving throughout the sensor network. In addition, three scripted scenarios that contain behaviors exhibited over a wide-area, such as "gathering for a meeting" or "stealing an object" are included to assist researchers who are interested in wide-area surveillance and behavior recognition. In addition to the video data, a face and gait database for all twelve individuals observed by the network of cameras is supplied. Hand-segmented groundtruth foreground regions are provided for every 500th frame in all cameras and for many sequential frames in two overlapping views. The entrance and exit time of each individual in each camera for one of the scenarios is provided in an XML database. We believe that the dataset will help provide a common development and verification framework for the increasing number of research efforts related to video surveillance in multiple, potentially non-overlapping, camera networks.

VIDANN is a computer program that allows participants to watch a video on a standard TV and to write their annotations (thought /feeling entries) on paper attached to a writing tablet. The system is designed as a Microsoft ActiveX module. It can be further adapted by the individual researcherthrough the use of a VBScript. All data, including the participant's handwriting, are stored in an XML database. An accompanying Wizard has been designed that enables researchers to generate VBScripts for standard configurations.

Research on mobile augmented reality (AR) so far concentrated on building and deploying prototypes and investigating technical and user interface aspects. To create plausible application scenarios other concerns also need to be addressed. In particular, the size of the physical world made accessible by mobile AR raises new challenges in terms of scalability: the system will among others need a very large 3D world model, display this model efficiently without visual clutter or graphics overload, should operate in networked mode with arbitrary collaborators, provide tracking anywhere etc. In this paper we address some of these scalability issues, namely data management for very large geographic 3D models, and efficient techniques for collaborative outdoor user interfaces. As an application scenario, we use a tourist group guide application operating in the city of Vienna.

XML is a standard of data exchange between web applications such as in e-commerce, elearning and other web portals. The data volume has grown substantially in the web and in order to effectively retrieve or store these data, it is recommended to be physically or virtually fragmented and distributed into different nodes. Basically, fragmentation design contains of two parts: fragmentation operation and fragmentation method. There are three different kinds of fragmentation operation: Horizontal, Vertical and Hybrid, determines how the XML should be fragmented. The aim of this paper is to give an overview on the fragmentation design consideration.

We will present preliminary results of a project whose objectives are to document the phonetic development of infants in the first year of life, to highlight the role of laryngeal mechanisms in phonetic development and to determine whether laryngeal and pharyngeal articulations develop differently according to whether or not the infant's ambient language includes these sounds. We will describe (1) the collaborative web-based XML database and analysis network that we have set up for researchers in Victoria, Paris, Morocco, and China and (2) some initial phonetic results from a number of infants in the survey to illustrate the development of pharyngeal constriction, airstream mechanism control, stop control, phonation type, and pitch control in prebabbling. In our view, articulatory phonetic control begins in the pharynx.

The shift from SGML to XML has created new demands for managing structured documents. Many XML documents will be transient representations for the purpose of data exchange between different types of applications, but there will also be a need for effective means to manage persistent XML data as a database. In this paper we explore requirements for an XML database

XML has been recognized as a promising language for data exchange over the Internet. A number of query languages have been proposed for querying XML data. Most of those languages are path-expression based. One difficulty in forming path-expression based queries is that users have to know the structure of XML data against which the queries were issued. In this paper, we describe a DTD-driven visual query interface for XML database systems. With such an interface, a user can easily form path-expression based queries by clicking elements in the DTD tree displayed on the screen and supplying conditions if necessary. The interface and the query generation process are described in detail.

This paper summarizes the XBench family of benchmarks that are under development at the University of Waterloo. The benchmark identifies various classes of XML databases and applications and proposes a set of benchmarks to accommodate these classes.

A core set of efficient access methods is central to the development of any database system. In the context of an XML database, there has been considerable effort devoted to defining a good set of primitive operators and inventing efficient access methods for each individual operator. These primitive operators have been defined either at the macro-level (using a "pattern tree" to specify a selection, for example) or at the micro-level (using multiple explicit containment joins to instantiate a single XPath expression).

XML annotations are a widely occurring phenomenon in many application fields, and XML databases should be used to store and query such data. To provide intuitive and fast querying of annotations, we make a case for extending XPath with four new axis steps, that correspond with socalled StandOff joins, introduced here. The new steps can be efficiently implemented using a region index and fast looplifted StandOff MergeJoin algorithms. These techniques were added to the open-source XML DBMS MonetDB/X-Query, and we show in our evaluation it thus becomes capable of interactively querying >GB annotation databases.