NDLI: Compression-Aware Algorithms for Massive Datasets

Content Provider	IEEE Xplore Digital Library
Author	Brunelle, N. Robins, G. Shelat, A.
Copyright Year	2015
Description	Author affiliation: Dept. of Comput. Sci., Univ. of Virginia, Charlottesville, VA, USA (Brunelle, N.; Robins, G.; Shelat, A.)
Abstract	While massive datasets are often stored in compressed format, most algorithms are designed to operate on uncompressed data. We address this growing disconnect by developing a framework for compression-aware algorithms that operate directly on compressed datasets. Synergistically, we also propose new algorithmically-aware compression schemes that enable algorithms to efficiently process the compressed data. In particular, we apply this general methodology to geometric / CAD datasets that are ubiquitous in areas such as graphics, VLSI, and geographic information systems. We develop example algorithms and corresponding compression schemes that address different types of datasets, including point sets and graphs. Our methods are more efficient than their classical counterparts, and they extend to both lossless and lossy compression scenarios. This motivates further investigation of how this approach can enable algorithms to process ever-increasing big data volumes.
Starting Page	441
Ending Page	441
File Size	94487
Page Count	1
File Format	PDF
ISBN	9781479984305
ISSN	10680314
DOI	10.1109/DCC.2015.74
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-04-07
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Algorithm design and analysis Data compression Big data Computer science Design automation Graphics Very large scale integration graph algorithms compression-aware algorithms algorithmically-aware compressions geometric algorithms graph compression pointset compression
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications

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

Design Automation Algorithms: Research and Applications

An Approach to Graph and Netlist Compression

Recursive block structured data compression

Decomposition of Logic Networks into Silicon

A new approach to perform circuit verification using O(n) algorithms

A Placement Capability Based on Partitioning

Efficient handling of large wiring data in TANGATE

A fast hierarchical quadratic placement algorithm

High-Performance Routing at the Nanometer Scale

Compression-Aware Algorithms for Massive Datasets

Similar Documents

Design Automation Algorithms: Research and Applications

An Approach to Graph and Netlist Compression

Recursive block structured data compression

Decomposition of Logic Networks into Silicon

A new approach to perform circuit verification using O(n) algorithms

A Placement Capability Based on Partitioning

Efficient handling of large wiring data in TANGATE

A fast hierarchical quadratic placement algorithm

High-Performance Routing at the Nanometer Scale

Compression-Aware Algorithms for Massive Datasets