210 search results - page 38 / 42 » Complex Group-By Queries for XML |
WISE
2006
Springer
14 years 21 days ago
2006
Springer
Maintaining a semantic cache of materialized XPath views inside or outside the database, is a novel, feasible and efficient approach to accelerate XML query processing. However, th...
ICWS
2007
IEEE
13 years 8 months ago
2007
IEEE
There is a critical need to design and develop tools tract away the fundamental complexity of XML based Web services specifications and toolkits, and provide an elegant, intuitive...
IM
2007
13 years 6 months ago
2007
Today’s search engines are increasingly required to broaden their capabilities beyond free-text search. More complex features, such as supporting range constraints over numeric ...
ICDE
2010
IEEE
14 years 6 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
EDBT
2006
ACM
14 years 6 months ago
2006
ACM
: This work describes a method for processing XPath on a relational back-end that significantly limits the number of SQL joins required, takes advantage of the strengths of modern ...