Sciweavers

258 search results - page 28 / 52
» Multidimensional Index Structures in Relational Databases
Sort
View
BTW
2009
Springer
114views Database» more  BTW 2009»
13 years 10 months ago
Efficient Verification of B-tree Integrity
: The integrity of B-tree structures can become compromised for many reasons. Since these inconsistencies manifest themselves in unpredictable ways, all commercial database managem...
Goetz Graefe, R. Stonecipher
IJCNN
2000
IEEE
13 years 11 months ago
Regression Analysis for Rival Penalized Competitive Learning Binary Tree
The main aim of this paper is to develop a suitable regression analysis model for describing the relationship between the index efficiency and the parameters of the Rival Penaliz...
Xuequn Li, Irwin King
DOLAP
2005
ACM
13 years 9 months ago
A relevance-extended multi-dimensional model for a data warehouse contextualized with documents
Current data warehouse and OLAP technologies can be applied to analyze the structured data that companies store in their databases. The circumstances that describe the context ass...
Juan Manuel Pérez, Rafael Berlanga Llavori,...
SSD
2009
Springer
127views Database» more  SSD 2009»
13 years 12 months ago
Incremental Reverse Nearest Neighbor Ranking in Vector Spaces
In this paper, we formalize the novel concept of incremental reverse nearest neighbor ranking and suggest an original solution for this problem. We propose an efficient approach f...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
EDBT
2000
ACM
13 years 11 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...