Sciweavers

1179 search results - page 104 / 236
» Relational-style XML query
Sort
View
CORR
2006
Springer
113views Education» more  CORR 2006»
13 years 10 months ago
The Tree Inclusion Problem: In Linear Space and Faster
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been ...
Philip Bille, Inge Li Gørtz
PVLDB
2008
128views more  PVLDB 2008»
13 years 9 months ago
Implementing filesystems by tree-aware DBMSs
With the rise of XML, the database community has been challenged by semi-structured data processing. Since the data type behind XML is the tree, state-of-the-art RDBMSs have learn...
Alexander Holupirek, Marc H. Scholl
VLDB
2001
ACM
80views Database» more  VLDB 2001»
14 years 2 months ago
Views in a Large Scale XML Repository
We are interested in de ning and querying views in a huge and highly heterogeneous XML repository Web scale. In this context, view de nitions are very large and there is no appa...
Sophie Cluet, Pierangelo Veltri, Dan Vodislav
XIMEP
2006
ACM
194views Database» more  XIMEP 2006»
14 years 4 months ago
Template Folding for XPath
We discuss query evaluation for XML-based server systems where the same query is evaluated on every incoming XML message. In a typical scenario, many of the incoming messages will...
Carl-Christian Kanne, Guido Moerkotte
CIKM
2009
Springer
14 years 4 months ago
Bitmap indexes for relational XML twig query processing
Due to an increasing volume of XML data, it is considered prudent to store XML data on an industry-strength database system instead of relying on a domain specific application or...
Kyong-Ha Lee, Bongki Moon