Performance evaluation of grid based multi-attribute record declustering methods

Bhaskar Himatsingka, Jaideep Srivastava

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

In this study we focus on multi-attribute declustering methods which are based on some type of grid-based partitioning of the data space. Theoretical results are derived which show that no declustering method can be strictly optimal for range queries if the number of disks is greater than 5. A detailed performance evaluation is carried out to see how various declustering schemes perform under a wide range of query and database scenarios (both relative to each other and to the optimal). Parameters that are varied include shape and size of queries, database size, number of attributes and the number of disks. The results show that information about common queries on a relation is very important and ought to be used in deciding the declustering for it, and that this is especially crucial for small queries. Also, there is no clear winner, and as such parallel database systems must support a number of declustering methods.

Original languageEnglish
Title of host publicationProceedings - International Conference on Data Engineering
Editors Anon
Place of PublicationLos Alamitos, CA, United States
PublisherPubl by IEEE
Pages356-365
Number of pages10
ISBN (Print)0818654007
Publication statusPublished - 1994
Externally publishedYes
EventProceedings of the 10th International Conference on Data Engineering - Houston, TX, USA
Duration: 14 Feb 199418 Feb 1994

Other

OtherProceedings of the 10th International Conference on Data Engineering
CityHouston, TX, USA
Period14/2/9418/2/94

ASJC Scopus subject areas

  • Software
  • Engineering(all)
  • Engineering (miscellaneous)

Cite this

Himatsingka, B., & Srivastava, J. (1994). Performance evaluation of grid based multi-attribute record declustering methods. In Anon (Ed.), Proceedings - International Conference on Data Engineering (pp. 356-365). Los Alamitos, CA, United States: Publ by IEEE.

Performance evaluation of grid based multi-attribute record declustering methods. / Himatsingka, Bhaskar; Srivastava, Jaideep.

Proceedings - International Conference on Data Engineering. ed. / Anon. Los Alamitos, CA, United States : Publ by IEEE, 1994. p. 356-365.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Himatsingka, B & Srivastava, J 1994, Performance evaluation of grid based multi-attribute record declustering methods. in Anon (ed.), Proceedings - International Conference on Data Engineering. Publ by IEEE, Los Alamitos, CA, United States, pp. 356-365, Proceedings of the 10th International Conference on Data Engineering, Houston, TX, USA, 14/2/94.
Himatsingka B, Srivastava J. Performance evaluation of grid based multi-attribute record declustering methods. In Anon, editor, Proceedings - International Conference on Data Engineering. Los Alamitos, CA, United States: Publ by IEEE. 1994. p. 356-365
Himatsingka, Bhaskar ; Srivastava, Jaideep. / Performance evaluation of grid based multi-attribute record declustering methods. Proceedings - International Conference on Data Engineering. editor / Anon. Los Alamitos, CA, United States : Publ by IEEE, 1994. pp. 356-365
@inproceedings{3136766ff5c14c7b9069ca0e39a8e5ff,
title = "Performance evaluation of grid based multi-attribute record declustering methods",
abstract = "In this study we focus on multi-attribute declustering methods which are based on some type of grid-based partitioning of the data space. Theoretical results are derived which show that no declustering method can be strictly optimal for range queries if the number of disks is greater than 5. A detailed performance evaluation is carried out to see how various declustering schemes perform under a wide range of query and database scenarios (both relative to each other and to the optimal). Parameters that are varied include shape and size of queries, database size, number of attributes and the number of disks. The results show that information about common queries on a relation is very important and ought to be used in deciding the declustering for it, and that this is especially crucial for small queries. Also, there is no clear winner, and as such parallel database systems must support a number of declustering methods.",
author = "Bhaskar Himatsingka and Jaideep Srivastava",
year = "1994",
language = "English",
isbn = "0818654007",
pages = "356--365",
editor = "Anon",
booktitle = "Proceedings - International Conference on Data Engineering",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Performance evaluation of grid based multi-attribute record declustering methods

AU - Himatsingka, Bhaskar

AU - Srivastava, Jaideep

PY - 1994

Y1 - 1994

N2 - In this study we focus on multi-attribute declustering methods which are based on some type of grid-based partitioning of the data space. Theoretical results are derived which show that no declustering method can be strictly optimal for range queries if the number of disks is greater than 5. A detailed performance evaluation is carried out to see how various declustering schemes perform under a wide range of query and database scenarios (both relative to each other and to the optimal). Parameters that are varied include shape and size of queries, database size, number of attributes and the number of disks. The results show that information about common queries on a relation is very important and ought to be used in deciding the declustering for it, and that this is especially crucial for small queries. Also, there is no clear winner, and as such parallel database systems must support a number of declustering methods.

AB - In this study we focus on multi-attribute declustering methods which are based on some type of grid-based partitioning of the data space. Theoretical results are derived which show that no declustering method can be strictly optimal for range queries if the number of disks is greater than 5. A detailed performance evaluation is carried out to see how various declustering schemes perform under a wide range of query and database scenarios (both relative to each other and to the optimal). Parameters that are varied include shape and size of queries, database size, number of attributes and the number of disks. The results show that information about common queries on a relation is very important and ought to be used in deciding the declustering for it, and that this is especially crucial for small queries. Also, there is no clear winner, and as such parallel database systems must support a number of declustering methods.

UR - http://www.scopus.com/inward/record.url?scp=0028203166&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028203166&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0028203166

SN - 0818654007

SP - 356

EP - 365

BT - Proceedings - International Conference on Data Engineering

A2 - Anon, null

PB - Publ by IEEE

CY - Los Alamitos, CA, United States

ER -