Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 9,693 papers for “database compression”

Incremental Compression for Image Database

Xi Yin, Weiqing Huang · 2016

Image databases obtain the incremental images frequently. However in tradition it is directly compressed to the incremental image, which ignores the redundancy and similarity between images. The general compression way is not satisfied. With an increasing number of compression method proposed, we proposed a method called incremental image compressing method aiming to this question, which is to make the best of the redundancy and similarity between image database and incremental image. Firstly, we tried to classify the incremental image, then seek the most similar image in the class as the reference image, and encode the incremental image using the redundancy and similarity. Simulations test shows the compression results are obviously improved, so the proposed method is superior to traditional compression methods.

Cited by 0Open access

Database Compression on Graphics Processors

Rare & Special e-Zone (The Hong Kong University of Science and Technology) · 2010

Elsevier’s Scopus, the largest abstract and citation database of peer-reviewed literature. Search and access research from the science, technology, medicine, social sciences and arts and humanities fields.

Cited by 0

Tradeoffs in XML Database Compression

James Cheney · 2006

Large XML data files, or XML databases, are now a common way to distribute scientific and bibliographic data, and storing such data efficiently is an important concern. A number of approaches to XML compression have been proposed in the last five years. The most competitive approaches employ one or more statistical text compressors based on PPM or arithmetic coding in which some of the context is provided by the XML document structure. The purpose of this paper is to investigate the relationship between the extant proposals in more detail. We review the two main statistical modeling approaches proposed so far, and evaluate their performance on two representative XML databases. Our main finding is that while a recently-proposed multiple-model approach can provide better overall compression for large databases, it uses much more memory and converges more slowly than an older single-model approach.

Cited by 14

Compression of the cinema database

Andy Berres, James Ahrens · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · 2015

No abstract provided

Cited by 0Open access

Compression aware physical database design

Hideaki Kimura, Vivek Narasayya, Manoj Syamala · Proceedings of the VLDB Endowment · 2011

Modern RDBMSs support the ability to compress data using methods such as null suppression and dictionary encoding. Data compression offers the promise of significantly reducing storage requirements and improving I/O performance for decision support queries. However, compression can also slow down update and query performance due to the CPU costs of compression and decompression. In this paper, we study how data compression affects choice of appropriate physical database design, such as indexes, for a given workload. We observe that approaches that decouple the decision of whether or not to choose an index from whether or not to compress the index can result in poor solutions. Thus, we focus on the novel problem of integrating compression into physical database design in a scalable manner. We have implemented our techniques by modifying Microsoft SQL Server and the Database Engine Tuning Advisor (DTA) physical design tool. Our techniques are general and are potentially applicable to DBMSs that support other compression methods. Our experimental results on real world as well as TPC-H benchmark workloads demonstrate the effectiveness of our techniques.

Cited by 17

ERP Systems - SQL Database Compression

Fuxa, Lukáš · Brno University of Technology Digital Library (Brno University of Technology) · 2014

Předmětem této bakalářské práce je návrh na kompresi SQL databáze u informačního systému v nadnárodní společnosti. Výstupem mé práce bude návrh na kompresi SQL databáze. Firma si stanovila určité požadavky, které musí být dodrženy. Na základě těchto požadavků navrhnu různá řešení a z nich nakonec vyberu jedno, dle mého názoru nejlepší, které na daný problém aplikuji.

Cited by 0

Compression Methodologies for Columnar Database Optimization

Praveen Kumar Sadineni · Journal of Computational Science and Intelligent Technologies · 2022

Today’s life is completely dependent on data. Conventional relational databases take longer to respond to queries because they are built for row-wise data storage and retrieval. Due to their efficient read and write operations to and from hard discs, which reduce the time it takes for queries to produce results, columnar databases have recently overtaken traditional databases. To execute Business Intelligence and create decision-making systems, vast amounts of data gathered from various sources are required in data warehouses, where columnar databases are primarily created. Since the data are stacked closely together, and the seek time is reduced, columnar databases perform queries more quickly. With aggregation queries to remove unnecessary data, they allow several compression techniques for faster data access. To optimise the efficiency of columnar databases, various compression approaches, including NULL Suppression, Dictionary Encoding, Run Length Encoding, Bit Vector Encoding, and Lempel Ziv Encoding, are discussed in this work. Database operations are conducted on the compressed data to demonstrate the decrease in memory needs and speed improvements.

Cited by 0Open access

COMPRESSION AND DISTRIBUTION OF ORTHOPHOTOMAP DATABASE

Birutė Ruzgienė, Birutė Ruzgienė · 2012

Abstract Achievements in softcopy photogrammetry and advancements in GIS accommodating digital images as a raster data have led to a great demand for digital orthophoto images. Because of huge size of digital orthophotomaps (especially coloured orthophotos) image compression is being considered in the interest of a more efficient data storage and faster file transfer. Many image compression software packages exist on the market. The paper presents the results of the extensive investigation selecting software package, developing the procedure of orthophoto file compression/decompression procedure with acceptance criteria. The softcopy orthophotomap database has been tested (compressing and decompressing) on visual and geometric quality as well as for compression/decompression time. The investigations are carried out considering to distribution of image files allowing its clients to request and download any desired othophotos through the CD or on-line using Web server.

Cited by 0

A pioneer compression technique for database

Sarita Singh Bhadoria, Sushil Kumar, Piyush Kumar Shukla · 2008

The advent of information technology has affected all walks of life. And when we talk the use of information technology in a business environment, we cannot ignore the presence of a data base system as its core. Data base technology has also grown from a simple file system to data navigation system, & over a last two decade a majority of top-&-middle level business institutions have adopted the computerization process, & as a result have been flooded with data. Temporal database [1] (a database that require some aspect of time when organizing their information) often increases with the time like information from reservation counters (flight, railways, buses, hotels), Bank ATMs, shares price from stock market, insurance policies. So with the limited resource how to manage and store this data, the only possible solution we can have is to just compress & store it with in the available resource. The traditional approach of compression [2] make use of entropy encoding (compress without any regard to it's content), whereas we can take advantage of its structure (source encoding) for compression as we do in audio or image compression. This paper presents an attempt to apply this category of compression method for a database file.

Cited by 0

Real Time Database Compression Optimization Using Iterative Length Compression Algorithm

Muthukumar Murugesan, T. Ravichandran · 2013

Real time databases are processing millions and billions of records on daily basis. Handling huge volume of data's in real time environment are big challenges in the world. Global domain providers will have a massive number of transactions on day-by-day. Such a domain database will be grown GBs and TBs of data during daily activities. Traditional compression methods are progressively more difficult to dealing with very large databases.

Cited by 4Open access

Data Reduction and Compression in Database Systems

Alexander Thomasian · IGI Global eBooks · 2005

Data compression is storing data such that it requires less space than usual. Data compression has been effectively used in storing data in a compressed form on magnetic tapes, disks, and even main memory. In many cases, updated data cannot be stored in place when it is not compressible to the same or smaller size. Compression also reduces the bandwidth requirements in transmitting (program) code, data, text, images, speech, audio, and video. The transmission may be from main memory to the CPU and its caches, from tape and disk into main memory, or over local, metropolitan, and wide area networks. When data compression is used, transmission time improves or, conversely, the required transmission bandwidth is reduced. Two excellent texts on this topic are Sayood (2002) and Witten, Bell, and Moffat (1999).

Cited by 0

New Diversity Criterion and Database Compression Method

B. Liu, Amazu LU, L. Zhang et al. · 2004

Based on the topological scaffold classification approach to cluster a structural database, we propose a new criterion to evaluate the diversity of a chemical structural database. This criterion is defined as the ratio of scaffold number to total structure number in the database. Six databases have been evaluated by this criterion. To reduce the size of a database under the minimum losing structural diversity, a novel effective database compression method has been developed. The number of selected structures in each compounds group with common scaffold is determined by empirical K–4–5 rules, and the selected structures are those with the higher drug–like value (DLV). A validity test has been made by adding 200 new random nonoverlapping natural products into NCI3D, and the losing percent of that test data set is about 10.5%. Results show that NCI3D, MNPD (marine natural products database) and TCMD (traditional Chinese medical database) have 68.7%, 60.3%, 54.4% size reduced respectively by this method.

Cited by 1

Dynamic Creation and Compression of Access Database

Qin Yan-you · 2004

It gives out the methods for dynamic creating and compressing Access database in the programs, in order to solve the problem that can not be applyed for programs to create and compress database in the DBMS development.

Cited by 0

Implementing compression on distributed time series database

M Burman · Aaltodoc (Aalto University) · 2017

Rise of microservices and distributed applications in containerized deployments are putting increasing amount of burden to the monitoring systems. They push the storage requirements to provide suitable performance for large queries.
\n
\nIn this paper we present the changes we made to our distributed time series database, Hawkular-Metrics, and how it stores data more effectively in the Cassandra. We show that using our methods provides significant space savings ranging from 50 to 90% reduction in storage usage, while reducing the query speeds by over 90\\% compared to the nominal approach when using Cassandra.
\n 
\nWe also provide our unique algorithm modified from Gorilla compression algorithm that we use in our solution, which provides almost three times the throughput in compression with equal compression ratio.

Cited by 0Open access

Large Database Compression Based on Perceived Information

Thomas Maugey, Laura Toni · IEEE Signal Processing Letters · 2020

Lossy compression algorithms trade bits for quality, aiming at reducing as much as possible the bitrate needed to represent the original source (or set of sources), while preserving the source quality. In this letter, we propose a novel paradigm of compression algorithms, aimed at minimizing the information loss perceived by the final user instead of the actual source quality loss, under compression rate constraints. As main contributions, we first introduce the concept of perceived information (PI), which reflects the information perceived by a given user experiencing a data collection, and which is evaluated as the volume spanned by the sources features in a personalized latent space. We then formalize the rate-PI optimization problem and propose an algorithm to solve this compression problem. Finally, we validate our algorithm against benchmark solutions with simulation results, showing the gain in taking into account users' preferences while also maximizing the perceived information in the feature domain.

Cited by 4

The Sandia Computerized Shock Compression Bibliographical Database

James S. Wilbeck, Caryn Anderson, J. C. Hokanson et al. · 2024

A searchable and updateable bibliographical database is being developed which will be designed, controlled, and evaluated by working technical experts in the field of shock-compression science. It will emphasize shock-compression properties in the stress region of a few tens of GPa and provide a broad and complete base of bibliographical information on the shock-compression behavior of materials. Through the operation of technical advisors, the database provides authoritative bibliographical and keyword data for use by both the inexperienced and expert user. In its current form, it consists of: (1) a library of journal articles, reports, books, and symposia papers in the areas of shock physics and shock mechanics, and (2) a computerized database system containing complete bibliographical information, exhaustive keyword descriptions, and author abstracts for each of the documents in the database library.

Cited by 0