Sciweavers

1179 search results - page 201 / 236
» Relational-style XML query
Sort
View
VLDB
2004
ACM
96views Database» more  VLDB 2004»
14 years 29 days ago
Answering XPath Queries over Networks by Sending Minimal Views
When a client submits a set of XPath queries to a XML database on a network, the set of answer sets sent back by the database may include redundancy in two ways: some elements may...
Keishi Tajima, Yoshiki Fukui
ICDT
2009
ACM
105views Database» more  ICDT 2009»
14 years 8 months ago
Efficient data structures for range-aggregate queries on trees
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
Hao Yuan, Mikhail J. Atallah
VLDB
2007
ACM
229views Database» more  VLDB 2007»
14 years 1 months ago
Sum-Max Monotonic Ranked Joins for Evaluating Top-K Twig Queries on Weighted Data Graphs
In many applications, the underlying data (the web, an XML document, or a relational database) can be seen as a graph. These graphs may be enriched with weights, associated with t...
Yan Qi 0002, K. Selçuk Candan, Maria Luisa ...
EDBT
2009
ACM
133views Database» more  EDBT 2009»
14 years 7 days ago
Schema-conscious filtering of XML documents
In a publish-subscribe system based on filtering of XML documents, subscribers specify their interests with profiles expressed in the XPath language. The system processes a stre...
Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soinine...
ICDT
2007
ACM
126views Database» more  ICDT 2007»
14 years 1 months ago
Combining Incompleteness and Ranking in Tree Queries
Abstract. In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers a...
Benny Kimelfeld, Yehoshua Sagiv