XML Database

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

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...

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 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.

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 ...

— 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

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.

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

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.