Equidepth partitioning of a data set based on finding its medians

Aditya P. Gurajada, Jaideep Srivastava

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

4 Citations (Scopus)

Abstract

One of the techniques to estimate selectivities of query predicates is by generating equidepth partitions for a relation and maintaining equidepth histograms. This paper presents a new technique to generate equidepth partitions for a secondary memory resident relation using a linear median find algorithm. A variation of this technique, which involves sorting of the individual blocks, is also proposed and extended to generate arbitrary number of partitions. The proposed techniques are compared with an external sorting based partitioning approach. Finally, an overall strategy to select the partitioning algorithm with possibly dynamic allocation of buffers is proposed.

Original languageEnglish
Title of host publicationProceedings of the 1991 Symposium on Applied Computing, SOAC 1991
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages92-101
Number of pages10
ISBN (Electronic)0818621362, 9780818621369
DOIs
Publication statusPublished - 1 Jan 1991
Externally publishedYes
Event1991 Symposium on Applied Computing, SOAC 1991 - Kansas City, United States
Duration: 3 Apr 19915 Apr 1991

Publication series

NameProceedings of the 1991 Symposium on Applied Computing, SOAC 1991

Conference

Conference1991 Symposium on Applied Computing, SOAC 1991
CountryUnited States
CityKansas City
Period3/4/915/4/91

Fingerprint

Sorting
Data storage equipment

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications
  • Hardware and Architecture
  • Information Systems
  • Software

Cite this

Gurajada, A. P., & Srivastava, J. (1991). Equidepth partitioning of a data set based on finding its medians. In Proceedings of the 1991 Symposium on Applied Computing, SOAC 1991 (pp. 92-101). [143854] (Proceedings of the 1991 Symposium on Applied Computing, SOAC 1991). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/SOAC.1991.143854

Equidepth partitioning of a data set based on finding its medians. / Gurajada, Aditya P.; Srivastava, Jaideep.

Proceedings of the 1991 Symposium on Applied Computing, SOAC 1991. Institute of Electrical and Electronics Engineers Inc., 1991. p. 92-101 143854 (Proceedings of the 1991 Symposium on Applied Computing, SOAC 1991).

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

Gurajada, AP & Srivastava, J 1991, Equidepth partitioning of a data set based on finding its medians. in Proceedings of the 1991 Symposium on Applied Computing, SOAC 1991., 143854, Proceedings of the 1991 Symposium on Applied Computing, SOAC 1991, Institute of Electrical and Electronics Engineers Inc., pp. 92-101, 1991 Symposium on Applied Computing, SOAC 1991, Kansas City, United States, 3/4/91. https://doi.org/10.1109/SOAC.1991.143854
Gurajada AP, Srivastava J. Equidepth partitioning of a data set based on finding its medians. In Proceedings of the 1991 Symposium on Applied Computing, SOAC 1991. Institute of Electrical and Electronics Engineers Inc. 1991. p. 92-101. 143854. (Proceedings of the 1991 Symposium on Applied Computing, SOAC 1991). https://doi.org/10.1109/SOAC.1991.143854
Gurajada, Aditya P. ; Srivastava, Jaideep. / Equidepth partitioning of a data set based on finding its medians. Proceedings of the 1991 Symposium on Applied Computing, SOAC 1991. Institute of Electrical and Electronics Engineers Inc., 1991. pp. 92-101 (Proceedings of the 1991 Symposium on Applied Computing, SOAC 1991).
@inproceedings{ca9825220ef248329eaaaace415e932a,
title = "Equidepth partitioning of a data set based on finding its medians",
abstract = "One of the techniques to estimate selectivities of query predicates is by generating equidepth partitions for a relation and maintaining equidepth histograms. This paper presents a new technique to generate equidepth partitions for a secondary memory resident relation using a linear median find algorithm. A variation of this technique, which involves sorting of the individual blocks, is also proposed and extended to generate arbitrary number of partitions. The proposed techniques are compared with an external sorting based partitioning approach. Finally, an overall strategy to select the partitioning algorithm with possibly dynamic allocation of buffers is proposed.",
author = "Gurajada, {Aditya P.} and Jaideep Srivastava",
year = "1991",
month = "1",
day = "1",
doi = "10.1109/SOAC.1991.143854",
language = "English",
series = "Proceedings of the 1991 Symposium on Applied Computing, SOAC 1991",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "92--101",
booktitle = "Proceedings of the 1991 Symposium on Applied Computing, SOAC 1991",

}

TY - GEN

T1 - Equidepth partitioning of a data set based on finding its medians

AU - Gurajada, Aditya P.

AU - Srivastava, Jaideep

PY - 1991/1/1

Y1 - 1991/1/1

N2 - One of the techniques to estimate selectivities of query predicates is by generating equidepth partitions for a relation and maintaining equidepth histograms. This paper presents a new technique to generate equidepth partitions for a secondary memory resident relation using a linear median find algorithm. A variation of this technique, which involves sorting of the individual blocks, is also proposed and extended to generate arbitrary number of partitions. The proposed techniques are compared with an external sorting based partitioning approach. Finally, an overall strategy to select the partitioning algorithm with possibly dynamic allocation of buffers is proposed.

AB - One of the techniques to estimate selectivities of query predicates is by generating equidepth partitions for a relation and maintaining equidepth histograms. This paper presents a new technique to generate equidepth partitions for a secondary memory resident relation using a linear median find algorithm. A variation of this technique, which involves sorting of the individual blocks, is also proposed and extended to generate arbitrary number of partitions. The proposed techniques are compared with an external sorting based partitioning approach. Finally, an overall strategy to select the partitioning algorithm with possibly dynamic allocation of buffers is proposed.

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

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

U2 - 10.1109/SOAC.1991.143854

DO - 10.1109/SOAC.1991.143854

M3 - Conference contribution

AN - SCOPUS:85049913453

T3 - Proceedings of the 1991 Symposium on Applied Computing, SOAC 1991

SP - 92

EP - 101

BT - Proceedings of the 1991 Symposium on Applied Computing, SOAC 1991

PB - Institute of Electrical and Electronics Engineers Inc.

ER -