Performing joins without decompression in a compressed database system | Zendy

Scott O'Connell | Zendy; N. Winterbottom | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Performing joins without decompression in a compressed database system

Author(s) -

Scott O'Connell,

N. Winterbottom

Publication year - 2003

Publication title -

acm sigmod record

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.372

H-Index - 142

eISSN - 1943-5835

pISSN - 0163-5808

DOI - 10.1145/640990.640991

Subject(s) - computer science , joins , database , database index , online transaction processing , compression (physics) , data compression , relational database , database tuning , view , data mining , database transaction , transaction processing , database design , information retrieval , search engine indexing , algorithm , programming language , materials science , composite material

There has been much work on compressing database indexes, but less on compressing the data itself. We examine the performance gains to be made by compression outside the index. A novel compression algorithm is reported, which enables the processing of queries without decompressing data needed to perform join operations in a database built on a triple store. The results of modelling the performance of the database with and without compression are given and compared with other recent work in this area. It is found that for some applications, gains in performance of over 50% are achievable, and in OLTP-like situations, there are also gains to be made.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research