736 search results - page 8 / 148 » A dynamic data structure for approximate range searching |
ICDE
2000
IEEE
14 years 10 months ago
2000
IEEE
: Many companies have recognized the strategic importance of the knowledge hidden in their large databases and have built data warehouses. Typically, updates are collected and appl...
SODA
2008
ACM
13 years 10 months ago
2008
ACM
We describe an asymptotically optimal data-structure for dynamic point location for horizontal segments. For n line-segments, queries take O(log n) time, updates take O(log n) amo...
VLDB
2007
ACM
14 years 9 months ago
2007
ACM
Market analysis is a representative data analysis process with many applications. In such an analysis, critical numerical measures, such as profit and sales, fluctuate over time a...
ISAAC
2005
Springer
14 years 2 months ago
2005
Springer
In this paper, we formulate a class of colored range query problems to model the multi-dimensional range queries in the presence of categorical information. By applying appropriate...
DOLAP
2005
ACM
13 years 11 months ago
2005
ACM
A novel framework for providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP is presented in this paper. Such a framework allows u...