We present a new XML-based search technology for e-commerce that enables users to formulate complex customer or vendor preferences, which typically occur within B2C or B2B applications. Preferences are modeled in a very natural way by partial orders. Since our semantics of multi-attribute preferences implements the Pareto-optimality principle, Preference XPATH queries avoid both the unwanted "e...

XPath is a language for XML document navigation. It is part of many XML related applications and standards such as XSLT, Document Object Models, XQuery, XLink, etc. This paper studies active forms of learning XPath expressions. In particular, we show nonlearnability of the XPath fragments using the equivalence and membership queries. In response to these negative results and visualisation probl...

Boyer-Moore-Horspool (BMH) algorithm is commonly used to solve text searching problems. In this paper is used to solve the constraint subset of XPath queries offering effective algorithm to resolve such queries. XML can be grasp as text file contains tags and its content; that kind of view to XML is used in this work. We constraint XML document content and possible XPath queries. This work focu...

As XML finds its place in information technology, query languages for XML attract much attention. Among them XPath is the most known. This article reveals a surprising fact that the upcoming XPath 2.0 is capable of sorting sequences, which is proved formally. We also mark out an incompleteness of XQuery Core and an insufficiency of definition of XQuery Core sorting semantics. The fact that XPat...

Running XPath queries on XML data steams is a challenge. Current approaches that store the entire document tree in memory are more suited for static environments. We modify the existing YFilter architecture to support online execution of XPath queries. This is achieved by minimal buffering of the data stream and dynamic pruning of the document tree in memory. These modifications enable us to ef...

We propose XPathMark, an XPath benchmark for XMark. It consists of a set of queries which covers the main aspects of the language XPath 1.0. These queries have been designed for XML documents generated under XMark, a popular benchmark for XML data management. We suggest a methodology to evaluate the XPath benchmark on a given XML engine and, by way of example, we evaluate two popular XML engine...

We study the satisfiability problem for XPath fragments supporting the following-sibling and preceding-sibling axes. Although this problem was recently studied for XPath fragments without sibling axes, little is known about the impact of the sibling axes on the satisfiability analysis. To this end we revisit the satisfiability problem for a variety of XPath fragments with sibling axes, in the p...

The evaluation of XPath expressions plays a central role in accessing XML documents and therefore may be used in XML database systems for different components. We demonstrate that different applications ranging from access control to transaction synchronization to the reuse of query results have very similar requirements to the evaluation of XPath expressions, which can be solved by the same tw...

Applications of description logics (DLs) such as OWL 2 and ontologybased data access (OBDA) require understanding of how to pose database queries over DL knowledge bases. While there have been many studies regarding traditional relational query formalisms such as conjunctive queries and their extensions, little attention has been paid to graph database queries, despite the fact that graph datab...