TITLE

GXQuery: Extending XQuery for Querying Graph-structured XML Data

AUTHOR(S)
Hongzhi Wang; Jianzhong Li
PUB. DATE
June 2011
SOURCE
Journal of Computing & Information Technology;Jun2011, Vol. 19 Issue 2, p83
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
XML data can be naturally modeled as a graph. Existing query languages to XML can only express queries of matching XML document with a tree-structured schema with structural and value constraints without the consideration of graph features. The ability of such query languages cannot satisfy various requirements of querying graph-structured XML data. In this paper, GXQuery is presented as an extension of XQuery, an XML query language recommended by W3C, to express more flexible query on graph-structured XML. GXQuery expressions can match XML document with graph-structured schema with not only structural and value constraints, but also topological constraints.
ACCESSION #
67069795

 

Related Articles

  • A survey using constraints to decision-making for fault tolerance in Business processes. G�mez-L�pez, M. T.; Gasca, Rafael Mart�nez; Maldonado, Carlos Ar�valo // International Journal of Software Engineering & Its Applications;Oct2010, Vol. 4 Issue 4, p79 

    Sometimes the business processes do not work how it is expected. In these cases, a diagnosis process has to be executed to determine the responsible activity or activities of the fault in order to substitute it or them for a correct activity. The aim of this paper is describe the necessary steps...

  • Optimal and efficient generalized twig pattern processing: a combination of preorder and postorder filterings. Bača, Radim; Krátký, Michal; Ling, Tok; Lu, Jiaheng // VLDB Journal International Journal on Very Large Data Bases;Jun2013, Vol. 22 Issue 3, p369 

    Searching for occurrences of a twig pattern query (TPQ) in an XML document is a core task of all XML database query languages. The generalized twig pattern (GTP) extends the TPQ model to include semantics related to output nodes, optional nodes, and boolean expressions which are part of the...

  • QUERYING DATABASES AND XML DOCUMENTS: COMPARATIVE STUDY AND A NEW PROPOSAL. García, Ana Fermoso; Larrea, María Jose Gil; Díaz Labrador, Jesús Luis // Proceedings of the IADIS International Conference on WWW/Interne;Jan2003, p933 

    XML has become the most useful standard of data interchange in the web and e-business world and there is a large amount of information stored in this format. Nonetheless, a large quantity of information remains stored in Relational Databases. It is very important to be able to jointly manage...

  • Format SPARQL Query Results into HTML Report. Abburu, Sunitha; Babu, G. Suresh // International Journal of Advanced Computer Science & Application;Jun2013, Vol. 4 Issue 6, p144 

    SPARQL is one of the powerful query languages for querying semantic data. It is recognized by the W3C as a query language for RDF. As an efficient query language for RDF, it has defined several query result formats such as CSV, TSV and XML etc. These formats are not attractive, understandable...

  • SECURING XML QUERY PROCESSING STORAGE. Shoniregun, Charles A.; Logvynovskiy, Oleksandr A.; Lu, Kevin // Australasian Journal of Information Systems;Sep2005, Vol. 13 Issue 1, p150 

    The effective processing of semi-structured data queries is a preliminary part of data mining stage. XML queries employ regular path expressions to find structural patterns within XML documents. The operation of structural join is a crucial part of XML query processing. Existing approaches...

  • QUILT- an XML Query Language. Robie, Jonathan; Chamberlin, Don; Floescu, Daniela // Software World;Mar2004, Vol. 35 Issue 2, p3 

    XML is an extremely versatile markup language, capable of labeling the information content of diverse data sources including structured and semi-structured documents, relational databases and object repositories. A query language of similar versatility is needed to realize the potential of XML...

  • Analysis and Design of Bio-Info-Collaborator Service Model to Collaborate Multiple Heterogeneous Bioinformatics Web Services. Soni, Isha; Nain, Amit // International Journal of Computer Applications;8/1/2012, Vol. 51, p1 

    In this paper, an approach to generate a mechanism for bioinformatics web services to register them with a Data Collaborator Web Service has been presented. The aim of this approach is to create new collaborator service model using existing web services. Up to now, the focus has been on...

  • Highly Expressive Query Languages for Unordered Data Trees. Abiteboul, Serge; Bourhis, Pierre; Vianu, Victor // Theory of Computing Systems;Nov2015, Vol. 57 Issue 4, p927 

    We study highly expressive query languages for unordered data trees, using as formal vehicles Active XML and extensions of languages in the while family. All languages may be seen as adding some form of control on top of a set of basic pattern queries. The results highlight the impact and...

  • RE-ENGINEERING OF A DISTRIBUTED OBJECT INFRASTRUCTURE FOR HETEROGENEOUS ENTERPRISE COMPUTATION OF CONTINUAL QUERIES. Leopold, Jennifer; Harankhedkar, Ritesh // Proceedings of the IADIS International Conference on WWW/Interne;Nov2004, p927 

    Interest in continual query processing systems is growing as the amount of information available over the Internet continues to increase. Users simply do not have the time to manually and repeatedly query multiple, heterogeneous webaccessible databases to search for or track all the information...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics