958 search results - page 41 / 192 » Efficient data structures for range-aggregate queries on tre... |
118
Voted
DASFAA
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract. The rapid growth in the amount of XML data and the development of publish-subscribe systems have led to great interest in processing streaming XML data. We propose the Qs...
122
Voted
GEOINFO
2003
15 years 1 months ago
2003
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing...
JEA
2008
15 years 13 days ago
2008
The Spatial Approximation Tree (sa-tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alternative data...
107
click to vote
KDID
2003
15 years 1 months ago
2003
We introduce generalized version space trees, a novel data structure that serves as a condensed representation in inductive databases for graph mining. Generalized version space tr...
230
click to vote
ICDE
2006
IEEE
16 years 1 months ago
2006
IEEE
Streaming XPath evaluation algorithms must record a potentially exponential number of pattern matches when both predicates and descendant axes are present in queries, and the XML ...