Sciweavers

458 search results - page 53 / 92
» Evaluation of partial path queries on xml data
Sort
View
ICDT
2009
ACM
105views Database» more  ICDT 2009»
16 years 5 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
SIGMOD
2007
ACM
105views Database» more  SIGMOD 2007»
16 years 4 months ago
Sonnet: an efficient distributed content-based dissemination broker
In this demonstration, we present a prototype content-based dissemination broker, called Sonnet, which is built upon structured overlay network. It combines approximate filtering ...
Aoying Zhou, Weining Qian, Xueqing Gong, Minqi Zho...
SIGMOD
2007
ACM
162views Database» more  SIGMOD 2007»
16 years 4 months ago
Effective and efficient update of xml in RDBMS
Querying XML effectively and efficiently using declarative languages such as XQuery and XPath has been widely studied in both academic and industrial settings. Most RDBMS vendors ...
Zhen Hua Liu, Muralidhar Krishnaprasad, James W. W...
SIGMOD
2008
ACM
127views Database» more  SIGMOD 2008»
15 years 4 months ago
Minimization of tree pattern queries with constraints
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...
Ding Chen, Chee Yong Chan
ICDE
2008
IEEE
218views Database» more  ICDE 2008»
16 years 5 months ago
AxPRE Summaries: Exploring the (Semi-)Structure of XML Web Collections
The nature of semistructured data in web collections is evolving. Increasingly, XML web documents (or documents exchanged via web services) are valid with regard to a schema, yet ...
Mariano P. Consens, Flavio Rizzolo, Alejandro A. V...