Sciweavers

958 search results - page 1 / 192
» Efficient data structures for range-aggregate queries on tre...
Sort
View
CCCG
2009
14 years 11 months ago
Data Structures for Range Aggregation by Categories
We solve instances of a general class of problems defined as follows: Preprocess a set S of possibly weighted colored geometric objects (e.g. points/orthogonal segments/rectangles...
Saladi Rahul, Prosenjit Gupta, K. S. Rajan
158
Voted
ICDT
2009
ACM
105views Database» more  ICDT 2009»
15 years 11 months ago
Efficient data structures for range-aggregate queries on trees
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
Hao Yuan, Mikhail J. Atallah
CCCG
2008
14 years 12 months ago
Data Structures for Range-Aggregate Extent Queries
We consider a generalization of geometric range searching, with the goal of generating an informative "summary" of the objects contained in a query range via the applica...
Ravi Janardan, Prosenjit Gupta, Yokesh Kumar, Mich...
57
Voted
ER
2001
Springer
85views Database» more  ER 2001»
15 years 3 months ago
Efficient Execution of Range-Aggregate Queries in Data Warehouse Environments
Seokjin Hong, Byoungho Song, Sukho Lee
WAIM
2009
Springer
15 years 5 months ago
Probabilistic Threshold Range Aggregate Query Processing over Uncertain Data
Large amount of uncertain data is inherent in many novel and important applications such as sensor data analysis and mobile data management. A probabilistic threshold range aggrega...
Shuxiang Yang, Wenjie Zhang, Ying Zhang, Xuemin Li...