Sciweavers

336 search results - page 51 / 68
» Analytic Cut Trees
Sort
View
SMA
2003
ACM
14 years 23 days ago
Geometric constraint solving via C-tree decomposition
This paper has two parts. First, we propose a method which can be used to decompose a geometric constraint graph into a c-tree. With this decomposition, solving for a well-constrai...
Xiao-Shan Gao, Gui-Fang Zhang
BTW
1999
Springer
145views Database» more  BTW 1999»
13 years 11 months ago
A Multi-Tier Architecture for High-Performance Data Mining
Data mining has been recognised as an essential element of decision support, which has increasingly become a focus of the database industry. Like all computationally expensive data...
Ralf Rantzau, Holger Schwarz
CORR
2011
Springer
183views Education» more  CORR 2011»
13 years 2 months ago
Pattern tree-based XOLAP rollup operator for XML complex hierarchies
—With the rise of XML as a standard for representing business data, XML data warehousing appears as a suitable solution for decision-support applications. In this context, it is ...
Marouane Hachicha, Jérôme Darmont
CIDR
2011
237views Algorithms» more  CIDR 2011»
12 years 11 months ago
Rethinking Database Algorithms for Phase Change Memory
Phase change memory (PCM) is an emerging memory technology with many attractive features: it is non-volatile, byte-addressable, 2–4X denser than DRAM, and orders of magnitude be...
Shimin Chen, Phillip B. Gibbons, Suman Nath
SIGMOD
2005
ACM
154views Database» more  SIGMOD 2005»
14 years 7 months ago
SHIFT-SPLIT: I/O Efficient Maintenance of Wavelet-Transformed Multidimensional Data
The Discrete Wavelet Transform is a proven tool for a wide range of database applications. However, despite broad acceptance, some of its properties have not been fully explored a...
Mehrdad Jahangiri, Dimitris Sacharidis, Cyrus Shah...