NDLI: Efficient and scalable data evolution with column oriented databases

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

Map-reduce extensions and recursive queries

Novel techniques to reduce search space in multiple minimum supports-based frequent pattern mining algorithms

GPX-matcher: a generic boolean predicate-based XPath expression matcher

Energy proportionality for disk storage using replication

Native support of multi-tenancy in RDBMS for software as a service

Answering tree pattern queries using views: a revisit

Keyword-based, context-aware selection of natural language query patterns

Efficient answering of set containment queries for skewed item distributions

SeMiTri: a framework for semantic annotation of heterogeneous trajectories

TAGs: scalable threshold-based algorithms for proximity computation in graphs

Fast random graph generation

Finding closed frequent item sets by intersecting transactions

Data integration with dependent sources

Predicting completion times of batch query workloads using interaction-aware models and simulation

Queries on dates: fast yet not blind

SocialSearch: enhancing entity search with social network matching

Schema matching and mapping: from usage to evaluation

A probabilistic XML merging tool

Database researchers: plumbers or thinkers?

Mining closed discriminative dyadic sequential patterns

An optimal strategy for monitoring top-k queries in streaming windows

Caching query-biased snippets for efficient retrieval

SLA-tree: a framework for efficiently supporting SLA-based decisions in cloud computing

Dynamic reasoning on XML updates

Unified structure and content search for personal information management systems

Subspace clustering for indexing high dimensional data: a main memory index based on local reductions and individual multi-representations

Efficient execution plans for distributed skyline query processing

Projection for XML update optimization

Symmetrizations for clustering directed graphs

Aspect-oriented relational algebra

Constructing concept relation network and its application to personalized web search

Memory-efficient frequent-itemset mining

Designing integration flows using hypercubes

Road crash proneness prediction using data mining

Big data and cloud computing: current state and future opportunities

Taking the OXPath down the deep web

Sequenced event set pattern matching

Fast and accurate computation of equi-depth histograms over data streams

Efficient and scalable data evolution with column oriented databases

On enhancing scalability for distributed RDF/S stores

Algebraic incremental maintenance of XML views

TopRecs: Top-k algorithms for item-based collaborative filtering

On (not) indexing quadratic form distance by metric access methods

Probabilistic range queries for uncertain trajectories on road networks

Efficient reverse skyline retrieval with arbitrary non-metric similarity measures

Efficient discovery of frequent subgraph patterns in uncertain graph databases

Synopses for probabilistic data over large domains

Effective and efficient sampling methods for deep web aggregation queries

Link-based hidden attribute discovery for objects on Web

Experience in Continuous analytics as a Service (CaaaS)

The hidden web, XML and the Semantic Web: scientific data management perspectives

SPRINT: ranking search results by paths

Making interval-based clustering rank-aware

Real-time approximate Range Motif discovery & data redundancy removal algorithm

A query optimization assistant for XPath

TPM: supporting pattern matching queries for road-network trajectory data

QueryViz: helping users understand SQL queries and their patterns

True language-level SQL debugging

SITAC: discovering semantically identical temporally altering concepts in text archives

Unraveling multi-dimensional data using pDView

RanKloud: a scalable ranked query processing framework on hadoop

Efficient and scalable data evolution with column oriented databases

Content Provider	ACM Digital Library
Author	Chen, Yi He, Bin Hsiao, Hui-I Liu, Ziyang
Abstract	Database evolution is the process of updating the schema of a database or data warehouse (schema evolution) and evolving the data to the updated schema (data evolution). It is often desired or necessitated when changes occur to the data or the query workload, the initial schema was not carefully designed, or more knowledge of the database is known and a better schema is concluded. The Wikipedia database, for example, has had more than 170 versions in the past 5 years [8]. Unfortunately, although much research has been done on the schema evolution part, data evolution has long been a prohibitively expensive process, which essentially evolves the data by executing SQL queries and re-constructing indexes. This prevents databases from being flexibly and frequently changed based on the need and forces schema designers, who cannot afford mistakes, to be highly cautious. Techniques that enable efficient data evolution will undoubtedly make life much easier. In this paper, we study the efficiency of data evolution, and discuss the techniques for data evolution on column oriented databases, which store each attribute, rather than each tuple, contiguously. We show that column oriented databases have a better potential than traditional row oriented databases for supporting data evolution, and propose a novel data-level data evolution framework on column oriented databases. Our approach, as suggested by experimental evaluations on real and synthetic data, is much more efficient than the query-level data evolution on both row and column oriented databases, which involves unnecessary access of irrelevant data, materializing intermediate results and re-constructing indexes.
Starting Page	105
Ending Page	116
Page Count	12
File Format	PDF
ISBN	9781450305280
DOI	10.1145/1951365.1951380
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2011-03-21
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Data evolution Column oriented database Bitmap index Schema
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