114 search results - page 4 / 23 » Dynamic Spatial Approximation Trees for Massive Data |
DOLAP
2003
ACM
14 years 1 months ago
2003
ACM
Data warehouse and Online Analytical Processing(OLAP) play a key role in business intelligent systems. With the increasing amount of spatial data stored in business database, how ...
VLDB
2002
ACM
14 years 8 months ago
2002
ACM
We propose a new data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function de ned among them, which satis es the trian...
COMPGEOM
2010
ACM
14 years 1 months ago
2010
ACM
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 ...
MCS
2008
Springer
13 years 7 months ago
2008
Springer
Dynamical low-rank approximation is a differential-equation based approach to efficiently computing low-rank approximations to time-dependent large data matrices or to solutions o...
SSD
2005
Springer
14 years 1 months ago
2005
Springer
Most recent research on querying and managing data streams has concentrated on traditional data models where the data come in the form of tuples or XML data. Complex types of strea...