1675 search results - page 124 / 335 » Implementing Data Cubes Efficiently |
ICDE
2008
IEEE
14 years 11 months ago
2008
IEEE
In data integration applications, a join matches elements that are common to two data sources. Often, however, elements are represented slightly different in each source, so an app...
HPCA
2005
IEEE
14 years 10 months ago
2005
IEEE
Many important applications exhibit large amounts of data parallelism, and modern computer systems are designed to take advantage of it. While much of the computation in the multi...
ICIAP
2005
ACM
14 years 10 months ago
2005
ACM
This paper presents an efficient implementation of moving least square(MLS) approximation for 3D surface reconstruction. The smoothness of the MLS is mainly determined by the weigh...
VLDB
2001
ACM
14 years 2 months ago
2001
ACM
Queries navigate semistructured data via path expressions, and can be accelerated using an index. Our solution encodes paths as strings, and inserts those strings into a special i...
SIGCOMM
1997
ACM
14 years 2 months ago
1997
ACM
Caching in the World Wide Web currently follows a naive model, which assumes that resources are referenced many times between changes. The model also provides no way to update a c...