621 search results - page 13 / 125 » Efficient algorithms for minimizing tree pattern queries |
WWW
2006
ACM
14 years 8 months ago
2006
ACM
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...
AMAI
2008
Springer
13 years 8 months ago
2008
Springer
This paper discusses the problem of building efficient coverage paths for a team of robots. An efficient multi-robot coverage algorithm should result in a coverage path for every ...
HICSS
2008
IEEE
13 years 8 months ago
2008
IEEE
Given an edge-weighted tree T, a k-trunk is a subtree Tk with k leaves in T which minimizes the sum of the distances of all vertices in T from Tk plus the weight of Tk. In this pa...
IS
2008
13 years 8 months ago
2008
Implementations that load XML documents and give access to them via, e.g., the DOM, suffer from huge memory demands: the space needed to load an XML document is usually many times...
ICDE
2003
IEEE
14 years 9 months ago
2003
IEEE
XKeyword provides efficient keyword proximity queries on large XML graph databases. A query is simply a list of keywords and does not require any schema or query language knowledg...