Sciweavers

146 search results - page 23 / 30
» Elliptic Indexing of Multidimensional Databases
Sort
View
IDEAS
2000
IEEE
112views Database» more  IDEAS 2000»
15 years 1 months ago
Bulk Loading a Data Warehouse Built Upon a UB-Tree
This paper considers the issue of bulk loading large data sets for the UB-Tree, a multidimensional index structure. Especially in dataware housing (DW), data mining and OLAP it is...
Robert Fenk, Akihiko Kawakami, Volker Markl, Rudol...
VISUAL
1999
Springer
15 years 1 months ago
Similarity Search Using Multiple Examples in MARS
Abstract. Unlike traditional database management systems, in multimedia databases that support content-based retrieval over multimedia objects, it is difficult for users to express...
Kriengkrai Porkaew, Sharad Mehrotra, Michael Orteg...
KDD
2000
ACM
222views Data Mining» more  KDD 2000»
15 years 1 months ago
Interactive exploration of very large relational datasets through 3D dynamic projections
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
Li Yang
EDBT
2000
ACM
15 years 1 months ago
Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
Caetano Traina Jr., Agma J. M. Traina, Bernhard Se...
SIGMOD
2006
ACM
149views Database» more  SIGMOD 2006»
15 years 9 months ago
Efficient query processing on unstructured tetrahedral meshes
Modern scientific applications consume massive volumes of data produced by computer simulations. Such applications require new data management capabilities in order to scale to te...
Stratos Papadomanolakis, Anastassia Ailamaki, Juli...