Sciweavers

366 search results - page 2 / 74
» Optimizing the Evaluation of XPath Using Description Logics
Sort
View
PODS
2008
ACM
143views Database» more  PODS 2008»
14 years 7 months ago
XPath, transitive closure logic, and nested tree walking automata
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
Balder ten Cate, Luc Segoufin
KRDB
2003
142views Database» more  KRDB 2003»
13 years 8 months ago
Optimizing Query Answering in Description Logics using Disjunctive Deductive Databases
Motivated by the possibilities of applying deductive database technology for efficient query answering in description logics, we present a translation operator µ that transforms...
Boris Motik, Raphael Volz
WISE
2002
Springer
14 years 7 days ago
Optimized Translation of XPath into Algebraic Expressions Parameterized by Programs Containing Navigational Primitives
We propose a new approach for the efficient evaluation of XPath expressions. This is important, since XPath is not only used as a simple, stand-alone query language, but is also ...
Sven Helmer, Carl-Christian Kanne, Guido Moerkotte
ICDE
2005
IEEE
114views Database» more  ICDE 2005»
14 years 29 days ago
VAMANA - A Scalable Cost-Driven XPath Engine
¡ Several systems have recently been proposed for the evaluation of XPath expressions. However, none of these systems have demonstrated both scalability with large document sizes ...
Venkatesh Raghavan, Kurt W. Deschler, Elke A. Rund...
VLDB
2004
ACM
101views Database» more  VLDB 2004»
14 years 21 days ago
Taming XPath Queries by Minimizing Wildcard Steps
This paper presents a novel and complementary technique to optimize an XPath query by minimizing its wildcard steps. Our approach is based on using a general composite axis called...
Chee Yong Chan, Wenfei Fan, Yiming Zeng