{"id":55,"date":"2013-11-15T09:52:18","date_gmt":"2013-11-15T08:52:18","guid":{"rendered":"https:\/\/project.inria.fr\/QuiXProc\/?page_id=55"},"modified":"2013-12-05T10:12:30","modified_gmt":"2013-12-05T09:12:30","slug":"quixpath","status":"publish","type":"page","link":"https:\/\/project.inria.fr\/quix-tool-suite\/quixpath\/","title":{"rendered":"QuiXPath"},"content":{"rendered":"<p>The QuiXPath language is a large fragment of <a href=\"http:\/\/www.w3.org\/TR\/xpath20\/\" title=\"XPath 2.0\" target=\"_blank\">XPath 2.0<\/a> with backwards compatibility. <a title=\"QuiXPath Pro\" href=\"http:\/\/www.innovimax.fr\/\" target=\"_blank\">QuiXPath<\/a> can be used standalone and is hosted in QuiXSLT, QuiXProc and QuiXSchematron.<\/p>\n<p><a title=\"QuiXPath Open source\" href=\"https:\/\/code.google.com\/p\/quixpath\/source\/checkout\" target=\"_blank\">Free open source<\/a> (with less coverage) and a professional version are available.<\/p>\n<p><center><br \/>\n<a href=\"https:\/\/docs.google.com\/forms\/d\/1vpVkgexH_K4u66SwqvEu2ZnDr51T-uD3t2Zn7FgIkBc\/viewform?embedded=true#start=embed\" target=\"_blank\">Try it for free on the Test Machine<\/a>.<br \/>\n<\/center><\/p>\n<h2>Key Features<\/h2>\n<ul>\n<li>Large coverage: joins, aggregate functions  (sum, count,&#8230;), backward axis (preceding, ancestor&#8230;).<\/li>\n<li>Minimal buffering.<\/li>\n<li>Compile XPath to network of nested word automata.<\/li>\n<\/ul>\n<h2>Key Benefits<\/h2>\n<ul>\n<li>Easy training since XPath is a W3C standart.<\/li>\n<li>Covert 95% of XPathMark benchmark<\/li>\n<li>Provide efficient streaming algorithms for XPath.<\/li>\n<\/ul>\n<h2>Which fragment of XPath 2.0 is currently supported by QuiXPath? <\/h2>\n<p>Syntactically, QuiXPath follows the official<a href=\"http:\/\/www.w3.org\/TR\/xpath20\/\" title=\"XPath 2.0\" target=\"_blank\"> XPath W3C Recommendation<\/a> (even though it does not implement the full standard) . The current version of QuiXPath supports the following features:<\/p>\n<ul>\n<li>aggregate functions:  sum, avg, min, max, count&#8230;<\/li>\n<li>number functions: ceiling, floor, round&#8230;<\/li>\n<li>string functions: concat, starts-with, contains&#8230;<\/li>\n<li>positions<\/li>\n<li>filter: conjunction, disjoinction, negation<\/li>\n<li>relative operators: <, \u2264, =, \u2265, >, \u2260<\/li>\n<li>axis: child:: (\/),  descendant::, descendant-ot-self:: (\/\/), ancestor(..), attribute(@), preceding, following&#8230;<\/li>\n<li>node tests: node(), text(), comment(), wildcard (\u2217) or a tagname with their namespace<\/li>\n<\/ul>\n<h2>Learn More<\/h2>\n<p>[youtubegallery]<\/p>\n<div class=\"embed-container\"><iframe loading=\"lazy\" title=\"How Efficient is Streaming? (QuiXPath \/ INRIA \/ INNOVIMAX)\" width=\"555\" height=\"312\" src=\"https:\/\/www.youtube.com\/embed\/IlWkGFZhsgg?feature=oembed\" frameborder=\"0\" allow=\"accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture; web-share\" referrerpolicy=\"strict-origin-when-cross-origin\" allowfullscreen><\/iframe><\/div>\n<p>[\/youtubegallery]<\/p>","protected":false},"excerpt":{"rendered":"<p>The QuiXPath language is a large fragment of XPath 2.0 with backwards compatibility. QuiXPath can be used standalone and is hosted in QuiXSLT, QuiXProc and QuiXSchematron. Free open source (with less coverage) and a professional version are available. Try it for free on the Test Machine. Key Features Large coverage: joins, aggregate functions (sum, count,&#8230;), &hellip; <\/p>\n<p><a class=\"more-link btn\" href=\"https:\/\/project.inria.fr\/quix-tool-suite\/quixpath\/\">Continue reading<\/a><\/p>\n","protected":false},"author":379,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"open","ping_status":"open","template":"","meta":{"footnotes":"","_members_access_role":[],"_members_access_error":""},"class_list":["post-55","page","type-page","status-publish","hentry","nodate","item-wrap"],"_links":{"self":[{"href":"https:\/\/project.inria.fr\/quix-tool-suite\/wp-json\/wp\/v2\/pages\/55","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/project.inria.fr\/quix-tool-suite\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/project.inria.fr\/quix-tool-suite\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/project.inria.fr\/quix-tool-suite\/wp-json\/wp\/v2\/users\/379"}],"replies":[{"embeddable":true,"href":"https:\/\/project.inria.fr\/quix-tool-suite\/wp-json\/wp\/v2\/comments?post=55"}],"version-history":[{"count":31,"href":"https:\/\/project.inria.fr\/quix-tool-suite\/wp-json\/wp\/v2\/pages\/55\/revisions"}],"predecessor-version":[{"id":318,"href":"https:\/\/project.inria.fr\/quix-tool-suite\/wp-json\/wp\/v2\/pages\/55\/revisions\/318"}],"wp:attachment":[{"href":"https:\/\/project.inria.fr\/quix-tool-suite\/wp-json\/wp\/v2\/media?parent=55"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}