Sciweavers

146 search results - page 3 / 30
» Elliptic Indexing of Multidimensional Databases
Sort
View
JIIS
2000
111views more  JIIS 2000»
13 years 6 months ago
Multidimensional Index Structures in Relational Databases
Abstract. Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on effi...
Christian Böhm, Stefan Berchtold, Hans-Peter ...
SSD
1997
Springer
90views Database» more  SSD 1997»
13 years 11 months ago
The S-Tree: An Efficient Index for Multidimensional Objects
Charu C. Aggarwal, Joel L. Wolf, Philip S. Yu, Mar...
EDBT
2006
ACM
156views Database» more  EDBT 2006»
14 years 7 months ago
Indexing Incomplete Databases
Incomplete databases, that is, databases that are missing data, are present in many research domains. It is important to derive techniques to access these databases efficiently. We...
Guadalupe Canahuate, Michael Gibas, Hakan Ferhatos...
CIDR
2007
98views Algorithms» more  CIDR 2007»
13 years 8 months ago
Spatial Indexing of Large Multidimensional Databases
István Csabai, Marton Trencseni, Laszlo Dob...
SIGMOD
2003
ACM
163views Database» more  SIGMOD 2003»
14 years 7 months ago
Multi-Dimensional Clustering: A New Data Layout Scheme in DB2
We describe the design and implementation of a new data layout scheme, called multi-dimensional clustering, in DB2 Universal Database Version 8. Many applications, e.g., OLAP and ...
Sriram Padmanabhan, Bishwaranjan Bhattacharjee, Ti...