Sciweavers

116 search results - page 20 / 24
» Efficient Evaluation of XML Middle-ware Queries
Sort
View
DASFAA
2009
IEEE
173views Database» more  DASFAA 2009»
14 years 2 months ago
A Uniform Framework for Ad-Hoc Indexes to Answer Reachability Queries on Large Graphs
Graph-structured databases and related problems such as reachability query processing have been increasingly relevant to many applications such as XML databases, biological databas...
Linhong Zhu, Byron Choi, Bingsheng He, Jeffrey Xu ...
SIGMOD
2003
ACM
140views Database» more  SIGMOD 2003»
14 years 10 months ago
Stream Processing of XPath Queries with Predicates
We consider the problem of evaluating large numbers of XPath filters, each with many predicates, on a stream of XML documents. The solution we propose is to lazily construct a sin...
Ashish Kumar Gupta, Dan Suciu
BTW
2007
Springer
133views Database» more  BTW 2007»
14 years 2 months ago
Pathfinder: XQuery Compila-tion Techniques for Relational Database Targets
: Relational database systems are highly efficient hosts to table-shaped data. It is all the more interesting to see how a careful inspection of both, the XML tree structure as wel...
Jens Teubner
JIDM
2010
155views more  JIDM 2010»
13 years 8 months ago
DeweyIDs - The Key to Fine-Grained Management of XML Documents
Because XML documents tend to be very large and are more and more collaboratively processed, their fine-grained storage and management is a must for which, in turn, a flexible tree...
Michael Peter Haustein, Theo Härder, Christia...
DEXA
2006
Springer
136views Database» more  DEXA 2006»
14 years 1 months ago
Faster Twig Pattern Matching Using Extended Dewey ID
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. Recently, Lu et al. [7] proposed the TJFast algorithm ...
Chung Keung Poon, Leo Yuen