Sciweavers

182 search results - page 6 / 37
» Approximate Colored Range Queries
Sort
View
WAIM
2009
Springer
14 years 3 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...
COMPGEOM
2010
ACM
14 years 1 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
CCCG
2008
13 years 10 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...
STOC
2001
ACM
159views Algorithms» more  STOC 2001»
14 years 8 months ago
Optimal static range reporting in one dimension
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
Stephen Alstrup, Gerth Stølting Brodal, The...
EDBT
2009
ACM
124views Database» more  EDBT 2009»
13 years 11 months ago
Processing probabilistic spatio-temporal range queries over moving objects with uncertainty
Range queries for querying the current and future positions of the moving objects have received growing interests in the research community. Existing methods, however, assume that...
Bruce S. E. Chung, Wang-Chien Lee, Arbee L. P. Che...