NDLI: CURE for cubes: cubing using a ROLAP engine

Please wait, while we are loading the content...

Enterprise information mashups: integrating information, simply

Data integration: the teenage years

Safety guarantee of continuous join queries over punctuated data streams

Implementing mapping composition

Efficient secure query evaluation over encrypted XML databases

A linear time algorithm for optimal tree sibling partitioning and approximation algorithms in Natix

Efficient and decentralized PageRank approximation in a peer-to-peer web search network

Performance tradeoffs in read-optimized databases

Adaptive cleaning for RFID data streams

AFilter: adaptable XML filtering with prefix-caching suffix-clustering

A dip in the reservoir: maintaining sample synopses of evolving datasets

Relaxing join and selection queries

Similarity search: a matching based approach

Towards robust indexing for ranked queries

Approximate encoding for direct access and query processing over compressed bitmaps

LB_Keogh supports exact indexing of shapes under rotation invariance with arbitrary representations and distance measures

Type-based XML projection

ULDBs: databases with uncertainty and lineage

Putting context into schema matching

IT839 Policy leading to u-Korea

Querying business processes

CURE for cubes: cubing using a ROLAP engine

Adaptive density estimation

XML Evolution: a two-phase XML processing model using XML prefiltering techniques

Answering top-k queries using views

Indexing for function approximation

Efficiently linking text documents with relevant structured information

An integrated approach to recovery and high availability in an updatable, distributed data warehouse

Full disjunctions: polynomial-delay iterators in action

Providing resiliency to load variations in distributed stream processing

Mining frequent closed cubes in 3D datasets

Efficient exact set-similarity joins

Automatic extraction of dynamic record sections from search engine result pages

Efficient detection of empty-result queries

The making of TPC-DS

Contest of XML lock protocols

Efficient XSLT processing in relational database system

Globalization: challenges to database community

NUITS: a novel user interface for efficient keyword search over databases

Incremental schema matching

InteMon: intelligent system monitoring on large clusters

One platform for mining structured and unstructured data: dream or reality?

Foundations of automated database tuning

Next generation data management in enterprise application platforms

Scalable continuous query processing by tracking hotspots

Nested mappings: schema mapping reloaded

Anatomy: simple and effective privacy preservation

Efficient discovery of XML data redundancies

LinkClus: efficient clustering via heterogeneous semantic links

To tune or not to tune?: a lightweight physical design alerter

A deferred cleansing method for RFID data analytics

Answering tree pattern queries using views

On biased reservoir sampling in the presence of stream evolution

Using partial evaluation in distributed query evaluation

Progressive computation of the min-dist optimal-location query

An incrementally maintainable index for approximate lookups in hierarchical data

How to wring a table dry: entropy compression of relations and querying of compressed relations

Distance indexing on road networks

$Twig^{2}Stack:$ bottom-up processing of generalized-tree-pattern queries over XML documents

Creating probabilistic databases from information extraction models

Schema summarization

Home network: road to ubiquitous world

Query optimization over web services

Efficient allocation algorithms for OLAP over imprecise data

GMine: a system for scalable, interactive graph visualization and mining

MyPortal: robust extraction and aggregation of web content

Answering top-k queries with multi-dimensional selections: the ranking cube approach

Active and accelerated learning of cost models for optimizing scientific applications

Meaningful labeling of integrated query interfaces

Lazy database replication with snapshot isolation

The spatial skyline queries

Load shedding in stream databases: a control-based approach

Efficient incremental maintenance of data cubes

Analysis of two existing and one new dynamic programming algorithm for the generation of optimal bushy join trees without cross products

Trustworthy keyword search for regulatory-compliant records retention

Cost-based query transformation in Oracle

Data mining with the SAP NetWeaver BI accelerator

Adaptive self-tuning memory in DB2

On the path to efficient XML queries

IPAC: an interactive approach to access control for semi-structured data

A semantic information integration tool suite

Simple and realistic data generation

Streaming in a connected world: querying and tracking distributed data streams

Continuous nearest neighbor monitoring in road networks

Debugging schema mappings with routes

Towards robustness in query auditing

Inference of concise DTDs from XML data

Link spam detection based on mass estimation

Efficient scheduling of heterogeneous continuous queries

Online outlier detection in sensor data using non-parametric models

Maintaining XPath views in loosely coupled systems

State-slice: new paradigm of multi-query optimization of window-based stream queries

TRAC: toward recency and consistency reporting in a database with distributed data sources

Bellwether analysis: predicting global aggregates from local regions

FIX: feature-based indexing technique for XML documents

Compact histograms for hierarchical identifiers

Reference-based indexing of sequence databases

An algebraic query model for effective and efficient retrieval of XML fragments

Quality views: capturing and exploiting the user perspective on data quality

Multi-column substring matching for database schema translation

Advances in memory technology

iDM: a unified and versatile data model for personal dataspace management

Composite subset measures

A middleware for fast and flexible sensor network deployment

$EOS^{2}:$ unstoppable stateful PHP

IO-Top-k: index-access optimized top-k query processing

Adaptive execution of variable-accuracy functions

GORDIAN: efficient and scalable discovery of composite keys

Delay aware querying with seaweed

The new Casper: query processing for location services without compromising privacy

Window-aware load shedding for aggregation queries over data streams

Flowcube: constructing RFID flowcubes for multi-dimensional analysis of commodity flows

Containment of conjunctive object meta-queries

Query processing in the aqualogic data services platform

Mapping moving landscapes by mining mountains of logs: novel techniques for dependency model generation

Building conference proceedings requires adaptable workflow and content management

Trio: a system for data, uncertainty, and lineage

POP/FED: progressive query optimization for federated queries in DB2

XCheck: a platform for benchmarking XQuery engines

Query co-processing on commodity processors

Entirely declarative sensor network systems

SMOQE: a system for providing secure access to XML

SIREN: a similarity retrieval engine for complex data

SPIDER: a schema mapPIng DEbuggeR

GignoMDA: exploiting cross-layer optimization for complex database applications

A decade of progress in indexing and mining large time series databases

R-SOX: runtime semantic query optimization over XML streams

Crimson: a data management system to support evaluating phylogenetic tree reconstruction algorithms

AQAX: a system for approximate XML query answers

OntoQuest: exploring ontological data made easy

LGeDBMS: a small DBMS for embedded system with flash memory

Randomized algorithms for matrices and massive data sets

Using high dimensional indexes to support relevance feedback based interactive images retrieval

HUX: handling updates in XML

PARAgrab: a comprehensive architecture for web image management and multimodal querying

HISA: a query system bridging the semantic gap for large image databases

CURE for cubes: cubing using a ROLAP engine

Content Provider	ACM Digital Library
Author	Morfonios, Konstantinos Ioannidis, Yannis
Abstract	Data cube construction has been the focus of much research due to its importance in improving efficiency of OLAP. A significant fraction of this work has been on ROLAP techniques, which are based on relational technology. Existing ROLAP cubing solutions mainly focus on "flat" datasets, which do not include hierarchies in their dimensions. Nevertheless, the nature of hierarchies introduces several complications into cube construction, making existing techniques essentially inapplicable in a significant number of real-world applications. In particular, hierarchies raise three main challenges: (a) The number of nodes in a cube lattice increases dramatically and its shape is more involved. These require new forms of lattice traversal for efficient execution. (b) The number of unique values in the higher levels of a dimension hierarchy may be very small; hence, partitioning data into fragments that fit in memory and include all entries of a particular value may often be impossible. This requires new partitioning schemes. (c) The number of tuples that need to be materialized in the final cube increases dramatically. This requires new storage schemes that remove all forms of redundancy for efficient space utilization. In this paper, we propose CURE, a novel ROLAP cubing method that addresses these issues and constructs complete data cubes over very large datasets with arbitrary hierarchies. CURE contributes a novel lattice traversal scheme, an optimized partitioning method, and a suite of relational storage schemes for all forms of redundancy. We demonstrate the effectiveness of CURE through experiments on both real-world and synthetic datasets. Among the experimental results, we distinguish those that have made CURE the first ROLAP technique to complete the construction of the cube of the highest-density dataset in the APB-1 benchmark (12 GB). CURE was in fact quite efficient on this, showing great promise with respect to the potential of the technique overall.
Starting Page	379
Ending Page	390
Page Count	12
File Format	PDF
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2006-09-01
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in