Sciweavers

12 search results - page 1 / 3
» The DC-Tree: A Fully Dynamic Index Structure for Data Wareho...
Sort
View
ICDE
2000
IEEE
158views Database» more  ICDE 2000»
14 years 5 months ago
The DC-Tree: A Fully Dynamic Index Structure for Data Warehouses
: 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...
Hans-Peter Kriegel, Jörn Kohlhammer, Martin E...
SISAP
2009
IEEE
134views Data Mining» more  SISAP 2009»
13 years 10 months ago
EGNAT: A Fully Dynamic Metric Access Method for Secondary Memory
—We introduce a novel metric space search data structure called EGNAT, which is fully dynamic and designed for secondary memory. The EGNAT is based on Brin’s GNAT static index,...
Roberto Uribe Paredes, Gonzalo Navarro
DAWAK
2001
Springer
13 years 8 months ago
Shared Index Scans for Data Warehouses
Tree based indexing structures like -trees, ·-trees, Bitmap indexes and Ê-trees have become essential for getting good performance when accessing vast datasets. However, most dat...
Yannis Kotidis, Yannis Sismanis, Nick Roussopoulos
ICDE
2002
IEEE
149views Database» more  ICDE 2002»
14 years 5 months ago
Indexing Spatio-Temporal Data Warehouses
Spatio-temporal databases store information about the positions of individual objects over time. In many applications however, such as traffic supervision or mobile communication ...
Dimitris Papadias, Yufei Tao, Panos Kalnis, Jun Zh...
IS
2011
12 years 10 months ago
Fully dynamic metric access methods based on hyperplane partitioning
Metric access methods based on hyperplane partitioning have the advantage, compared to the ballpartitioning-based ones, that regions do not overlap. The price is less flexibility...
Gonzalo Navarro, Roberto Uribe Paredes