Evaluating XPath Expressions on Light Weight BitCube
نویسندگان
چکیده
منابع مشابه
Evaluating Linear XPath Expressions by Pattern-Matching Automata
We consider the problem of efficiently evaluating a large number of XPath expressions, especially in the case when they define subscriber profiles for filtering of XML documents. For each document in an XML document stream, the task is to determine those profiles that match the document. In this article we present a new general method for filtering with profiles expressed by linear XPath expres...
متن کاملMinimising Simple XPath Expressions
We consider a subset of XPath expressions, called simple XPath expressions, which correspond to a class of conjunctive queries. We show that, in the absence of a DTD, each simple XPath expression has a unique minimal equivalent expression which can be found in polynomial time. We then consider D-equivalence, the equivalence of expressions with respect to the set of documents valid for a given D...
متن کاملSatisfiability of XPath Expressions
In this paper, we investigate the complexity of deciding the satisfiability of XPath 2.0 expressions, i.e., whether there is an XML document for which their result is nonempty. Several fragments that allow certain types of expressions are classified as either in PTIME or NP-hard to see which type of expression make this a hard problem. Finally, we establish a link between XPath expressions and ...
متن کاملEvaluating XPath Queries on XML Data Streams
Whenever queries have to be evaluated on XML data streams or when the memory that is available to evaluate the XML data is relatively small compared to the document DOM based approaches that have to load and store large parts of the document in main memory will fail. In comparison, we present an approach to evaluate XPath queries on SAX streams that supports all axes of core XPath, including th...
متن کاملTransforming XPath Expressions into Relational Algebra Expressions With Kleene Closure
In the problem of translating XPath expressions into SQL queries, the most challenging part is to find a way to minimize the use of least fixpoint (LFP) operators when a DTD graph contains cycles. In this paper, we address this issue and present a new algorithm to do the task based on the recognition of a kind of DTD graphs, which can be reduced to a single node by contracting nodes into their ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer and Communication Technology
سال: 2010
ISSN: 2231-0371,0975-7449
DOI: 10.47893/ijcct.2010.1060