958 search results - page 62 / 192 » Efficient data structures for range-aggregate queries on tre... |
94
Voted
CIKM
2005
Springer
15 years 6 months ago
2005
Springer
The basic relationships to be determined in XML query processing are ancestor-descendant (A-D), parent-child (P-C), sibling and ordering relationships. The containment labeling sc...
150
Voted
SPIRE
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Colored range queries are a well-studied topic in computational geometry and database research that, in the past decade, have found exciting applications in information r...
84
Voted
IPPS
1998
IEEE
15 years 4 months ago
1998
IEEE
Multi-dimensional index structures such as R-trees enable fast searching in high-dimensional spaces. They differ from uni-dimensional structures in the following aspects: (1) inde...
132
Voted
VISUAL
1999
Springer
15 years 4 months ago
1999
Springer
The FRAMES project is developing a system for video database search, content-based retrieval, and virtual video program synthesis. For dynamic synthesis applications, a video progr...
113
Voted
PC
2006
15 years 14 days ago
2006
Trees are important datatypes that are often used in representing structured data such as XML. Though trees are widely used in sequential programming, it is hard to write efficien...