Sciweavers

958 search results - page 5 / 192
» Efficient data structures for range-aggregate queries on tre...
Sort
View
WIDM
2004
ACM
13 years 11 months ago
Ctree: a compact tree for indexing XML data
In this paper, we propose a novel compact tree (Ctree) for XML indexing, which provides not only concise path summaries at the group level but also detailed child-parent links at ...
Qinghua Zou, Shaorong Liu, Wesley W. Chu
ICDE
2001
IEEE
128views Database» more  ICDE 2001»
14 years 7 months ago
Counting Twig Matches in a Tree
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
Zhiyuan Chen, H. V. Jagadish, Flip Korn, Nick Koud...
BDA
2004
13 years 7 months ago
Tree Graph Views: On Efficient Evaluation of XQuery in an XML Mediator
XQuery is the emerging standard for querying XML data sources. XLive is a light XML/XQuery mediator developed at University of Versailles whose engine processes an XML algebra der...
Tuyet-Tram Dang-Ngoc, Georges Gardarin, Nicolas Tr...
APWEB
2004
Springer
13 years 11 months ago
Labeling and Querying Dynamic XML Trees
Abstract With the growing importance of XML in data exchange, much research tends to provide a compact labeling scheme and a flexible query facility to extract data from dynamic XM...
Jiaheng Lu, Tok Wang Ling
JGTOOLS
2008
100views more  JGTOOLS 2008»
13 years 6 months ago
Proximity Cluster Trees
Hierarchical spatial data structures provide a means for organizing data for efficient processing. Most spatial data structures are optimized for performing queries, such as inters...
Elena Jakubiak Hutchinson, Sarah F. Frisken, Ronal...