Rizki Saputra | Dian Nuswantoro University (original) (raw)

Rizki Saputra

Related Authors

Galih Hermawan

Tonni Limbong

Esa Firmansyah

Ananda Syaviri

Jana  Javornik

Gwen Robbins Schug

Gabriel Gutierrez-Alonso

John Sutton

Kevin Arbuckle

Lev Manovich

Lev Manovich

Graduate Center of the City University of New York

Uploads

Papers by Rizki Saputra

Research paper thumbnail of Kajian Teknis Jalan Angkut Untuk Pengupasanoverburden Pada Penambangan Batubaradi Pit 5 Pt. Kalimantan Prima Persadajob Site Tanjung Alamkalimantan Selatan

Research paper thumbnail of POTENSI BIOAKTIF EKSTRAK ALGA MERAH (Gracillaria verrucosa) TERHADAP KADAR MALONDIALDEHIDA (MDA) DAN GAMBARAN HISTOLOGI PARU TIKUS PUTIH (Rattus novergicus) PASCA INDUKSI FORMALIN

Research paper thumbnail of Optimized Data Indexing Algorithms for OLAP Systems

The need to process and analyze large data volumes, as well as to convey the information containe... more The need to process and analyze large data volumes, as well as to convey the information contained therein to decision makers naturally led to the development of OLAP systems. Similarly to SGBDs, OLAP systems must ensure optimum access to the storage environment. Although there are several ways to optimize database systems, implementing a correct data indexing solution is the most effective and less costly. Thus, OLAP uses indexing algorithms for relational data and n-dimensional summarized data stored in cubes. Today database systems implement derived indexing algorithms based on well-known Tree, Bitmap and Hash indexing algorithms. This is because no indexing algorithm provides the best performance for any particular situation (type, structure, data volume, application). This paper presents a new n-dimensional cube indexing algorithm, derived from the well known B-Tree index, which indexes data stored in data warehouses taking in consideration their multi-dimensional nature and provides better performance in comparison to the already implemented Tree-like index types.

Research paper thumbnail of Kajian Teknis Jalan Angkut Untuk Pengupasanoverburden Pada Penambangan Batubaradi Pit 5 Pt. Kalimantan Prima Persadajob Site Tanjung Alamkalimantan Selatan

Research paper thumbnail of POTENSI BIOAKTIF EKSTRAK ALGA MERAH (Gracillaria verrucosa) TERHADAP KADAR MALONDIALDEHIDA (MDA) DAN GAMBARAN HISTOLOGI PARU TIKUS PUTIH (Rattus novergicus) PASCA INDUKSI FORMALIN

Research paper thumbnail of Optimized Data Indexing Algorithms for OLAP Systems

The need to process and analyze large data volumes, as well as to convey the information containe... more The need to process and analyze large data volumes, as well as to convey the information contained therein to decision makers naturally led to the development of OLAP systems. Similarly to SGBDs, OLAP systems must ensure optimum access to the storage environment. Although there are several ways to optimize database systems, implementing a correct data indexing solution is the most effective and less costly. Thus, OLAP uses indexing algorithms for relational data and n-dimensional summarized data stored in cubes. Today database systems implement derived indexing algorithms based on well-known Tree, Bitmap and Hash indexing algorithms. This is because no indexing algorithm provides the best performance for any particular situation (type, structure, data volume, application). This paper presents a new n-dimensional cube indexing algorithm, derived from the well known B-Tree index, which indexes data stored in data warehouses taking in consideration their multi-dimensional nature and provides better performance in comparison to the already implemented Tree-like index types.

Log In