{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T18:05:10Z","timestamp":1754157910199,"version":"3.41.2"},"reference-count":14,"publisher":"Emerald","issue":"3","license":[{"start":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T00:00:00Z","timestamp":1314662400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,8,30]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-heading\">Purpose<\/jats:title><jats:p>eXtensible Markup Language (XML) data are data which are not necessarily constrained by a schema, XML is fast emerging as a standard for data representation and exchange on the world wide web, the ability to intelligently query XML data becomes increasingly important. Some XML graphical query languages for XML data have been proposed but they are either too complex or too limited in the power of expression and in their use. The purpose of this paper is to propose a recursive graphical query language for querying and restructuring XML data (RGQLX). The expressive power of RGQLX is comparable to Fixpoint. RGQLX language is a multi\u2010sorted graphical language integrating grouping, aggregate functions, nested queries and recursion.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Design\/methodology\/approach<\/jats:title><jats:p>The methodology emphasizes on RGQLX's development which is base of G\u2010XML data model syntax to express a wide variety of XML queries, ranging from simple selection, to expressive data transformations involving grouping, aggregation and sorting. RGQLX allows users to express recursive visual queries in an elegant manner. RGQLX has an operational semantics based on the annotated XML, which serves to express queries and data trees in form of XML. The paper presents an algorithm to achieve the matching between data and query trees after translating a query tree into annotated XML.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Findings<\/jats:title><jats:p>Developed and demonstrated were: a G\u2010XML model; recursive queries; annotated XML for the semantic operations and a matching algorithm.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Research limitations\/implications<\/jats:title><jats:p>The future research work on RGQLX language will be expanding it to include recursive aggregations.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Practical implications<\/jats:title><jats:p>The algorithms\/approaches proposed can be easily integrated in any commercial product to enhance the performance of XML query languages.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Originality\/value<\/jats:title><jats:p>The proposed work integrates various novel techniques for XML query syntax\/semantic into a single language with a suitable matching algorithm. The power of this proposal is in the class of Fixpoint queries.<\/jats:p><\/jats:sec>","DOI":"10.1108\/17440081111165893","type":"journal-article","created":{"date-parts":[[2011,9,10]],"date-time":"2011-09-10T07:25:19Z","timestamp":1315639519000},"page":"269-291","source":"Crossref","is-referenced-by-count":0,"title":["A recursive visual query language for XML data"],"prefix":"10.1108","volume":"7","author":[{"given":"Mourad","family":"Ykhlef","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","reference":[{"doi-asserted-by":"crossref","unstructured":"Angelaccio, M., Catarci, T. and Santucci, G. (1990), \u201cQBD*: a graphical query language with recursion\u201d, IEEE Transactions on Software Engineering, Vol. 16 No. 10, pp. 1150\u201063.","key":"key2022021119590390100_b1","DOI":"10.1109\/32.60295"},{"doi-asserted-by":"crossref","unstructured":"Braga, D., Campi, A. and Ceri, S. (2003), \u201cXQBE (XQuery by example): a visual interface to the standard XML query language\u201d, ACM Transactions on Database Systems, Vol. 30 No. 2, pp. 398\u2010443.","key":"key2022021119590390100_b2","DOI":"10.1145\/1071610.1071613"},{"doi-asserted-by":"crossref","unstructured":"Ceri, S., Comai, S., Damiani, E., Fraternali, P., Paraboschi, S. and Tanca, L. (1999), \u201cXML\u2010GL: a graphical language for querying and restructuring XML documents\u201d, Computer Networks, Vol. 31 No. 11, pp. 1171\u201087.","key":"key2022021119590390100_b3","DOI":"10.1016\/S1389-1286(99)00014-6"},{"doi-asserted-by":"crossref","unstructured":"Consens, M. and Mendelzon, A. (1990), \u201cGraphLog:\u2009a visual formalism for real life recursion\u201d, Proceedings of the 9th ACM SIGACT\u2010SIGMOD\u2010SIGART Symposium on Principles of Database Systems, Nashville, TN, USA, pp. 404\u201016.","key":"key2022021119590390100_b4","DOI":"10.1145\/298514.298591"},{"unstructured":"Cruz, I.F., Mendelzon, A. and Wood, P.T. (1988), \u201cG+: recursive queries without recursion\u201d, Proceedings of the 2nd International Conference on Expert Database Systems, Vienna, VA, USA, pp. 355\u201068.","key":"key2022021119590390100_b5"},{"doi-asserted-by":"crossref","unstructured":"Erwig, M. (2003), \u201cXing: a visual XML query language\u201d, Journal of Visual Languages and Computing, Vol. 14 No. 1, pp. 5\u201045.","key":"key2022021119590390100_b6","DOI":"10.1016\/S1045-926X(02)00074-5"},{"unstructured":"Evangelista Filha, I.M.R., Laender, A.H.F. and Silva, A.S. (2001), \u201cQuerying semi\u2010structured data by example: the QSByE interface\u201d, Proceedings of the Int'l Workshop Information Integration on the Web, UNIRIO, Rio de Janeiro, pp. 156\u201063.","key":"key2022021119590390100_b7"},{"unstructured":"W3C (2001), W3C (2001), World Wide Web Consortium. Extensible Stylesheet Language (XSL) Version 1.0, W3C Recommendation, October, available at: www.w3.org\/TR\/xsl\/.","key":"key2022021119590390100_b9"},{"unstructured":"W3C (2002), World Wide Web Consortium. XQuery 1.0: An XML Query Language W3C Working Draft, June, available at: www.w3.org\/XML\/Query.","key":"key2022021119590390100_b10"},{"doi-asserted-by":"crossref","unstructured":"Wei, N. and Tok Wang, L. (2003), \u201cGLASS: a graphical query language for semi\u2010structured data\u201d, The Eighth International Conference on Database Systems for Advanced Applications, Kyoto, March 26\u201028, p. 363.","key":"key2022021119590390100_b8","DOI":"10.1109\/DASFAA.2003.1192402"},{"unstructured":"Yao, J.T. and Zhang, M. (2004), \u201cA fast tree pattern matching algorithm for XML query\u201d, IEEE\/WIC\/ACM International Conference on Web Intelligence (WI\u201904), Bejing.","key":"key2022021119590390100_b11"},{"unstructured":"Ykhlef, M. (2007), \u201cRecursive SQL\u2010Like query language for XML\u201d, Jakarta: The 9th International Conference on Information Integration and Web\u2010based Applications and Services, December, Jakarta, pp. 235\u201045.","key":"key2022021119590390100_b12"},{"doi-asserted-by":"crossref","unstructured":"Ykhlef, M. and Alqahtani, S. (2009), \u201cGQLX: a new graphical query language for XML data\u201d, The 11th International Conference on Information Integration and Web\u2010 based Applications & Services (iiWAS2009), Kuala Lumpur.","key":"key2022021119590390100_b13","DOI":"10.1145\/1806338.1806379"},{"doi-asserted-by":"crossref","unstructured":"Ykhlef, M. and Alqahtani, S. (2010), \u201cQuerying and restructuring XML data by graphical query language\u201d, International Journal of Web Information Systems, Vol. 6 No. 2, pp. 230\u201047.","key":"key2022021119590390100_b14","DOI":"10.1108\/17440081011070169"}],"container-title":["International Journal of Web Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/17440081111165893","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/17440081111165893\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/17440081111165893\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T00:25:03Z","timestamp":1753403103000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ijwis\/article\/7\/3\/269-291\/166150"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,30]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,8,30]]}},"alternative-id":["10.1108\/17440081111165893"],"URL":"https:\/\/doi.org\/10.1108\/17440081111165893","relation":{},"ISSN":["1744-0084"],"issn-type":[{"type":"print","value":"1744-0084"}],"subject":[],"published":{"date-parts":[[2011,8,30]]}}}