Sciweavers

16 search results - page 2 / 4
» Monadic Queries over Tree-Structured Data
Sort
View
WEBDB
2004
Springer
154views Database» more  WEBDB 2004»
13 years 11 months ago
Twig Query Processing over Graph-Structured XML Data
XML and semi-structured data is usually modeled using graph structures. Structural summaries, which have been proposed to speedup XML query processing have graph forms as well. Th...
Zografoula Vagena, Mirella Moura Moro, Vassilis J....
WWW
2006
ACM
14 years 6 months ago
Online mining of frequent query trees over XML data streams
In this paper, we proposed an online algorithm, called FQT-Stream (Frequent Query Trees of Streams), to mine the set of all frequent tree patterns over a continuous XML data strea...
Hua-Fu Li, Man-Kwan Shan, Suh-Yin Lee
CIKM
2006
Springer
13 years 9 months ago
Amnesic online synopses for moving objects
We present a hierarchical tree structure for online maintenance of time-decaying synopses over streaming data. We exemplify such an amnesic behavior over streams of locations take...
Michalis Potamias, Kostas Patroumpas, Timos K. Sel...
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
14 years 5 months ago
Relational-style XML query
We study the problem of querying relational data embedded in XML. Relational data can be represented by various tree structures in XML. However, current XML query methods, such as...
Taro L. Saito, Shinichi Morishita
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
14 years 5 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...