Sciweavers

1567 search results - page 36 / 314
» Compressing Relations and Indexes
Sort
View
SIGMOD
1998
ACM
124views Database» more  SIGMOD 1998»
14 years 1 months ago
An Alternative Storage Organization for ROLAP Aggregate Views Based on Cubetrees
The Relational On-Line Analytical Processing (ROLAP) is emerging as thedominant approach in data warehousing with decision support applications. In order to enhance query performa...
Yannis Kotidis, Nick Roussopoulos
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
11 years 11 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
CIKM
2001
Springer
14 years 1 months ago
Index Filtering and View Materialization in ROLAP Environment
Using materialized view to accelerate OLAP queries is one of the most common methods used in ROLAP systems. However, high storage and computation cost make this method very diffic...
Shi Guang Qiu, Tok Wang Ling
IR
2008
13 years 9 months ago
A compressed self-index using a Ziv-Lempel dictionary
A compressed full-text self-index for a text T , of size u, is a data structure used to search for patterns P, of size m, in T , that requires reduced space, i.e. space that depend...
Luís M. S. Russo, Arlindo L. Oliveira
SIGMOD
2002
ACM
124views Database» more  SIGMOD 2002»
14 years 9 months ago
Quadtree and R-tree indexes in oracle spatial: a comparison using GIS data
Spatial indexing has been one of the active focus areas in recent database research. Several variants of Quadtree and R-tree indexes have been proposed in database literature. In ...
Kothuri Venkata Ravi Kanth, Siva Ravada, Daniel Ab...