PARALLEL RANGE SEARCH ALGORITHM USING MULTIPLE ATTRIBUTE TREE.

Nageswara S.V. Rao; S. S. Iyengar; R. L. Kashyap

PARALLEL RANGE SEARCH ALGORITHM USING MULTIPLE ATTRIBUTE TREE.

Nageswara S.V. Rao, S. S. Iyengar, R. L. Kashyap

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

A parallel algorithm is presented for the problem of range searches on a single-instruction multiple-data (SIMD) computing system with p processing elements. The linearized multiple attribute tree is used as the underlying data structure. The algorithm has complexity of O(kN/p), p less than equivalent to N, where k is the dimensionality and N is the number of points of the data space.

Original language	English
Title of host publication	Proceedings of the International Conference on Parallel Processing
Editors	Kai Hwang, Steven M. Jacobs, Earl E. Swartzlander
Publisher	IEEE
Pages	931-933
Number of pages	3
ISBN (Print)	0818607246
State	Published - 1986
Externally published	Yes

Publication series

Name	Proceedings of the International Conference on Parallel Processing
ISSN (Print)	0190-3918

Cite this

@inproceedings{efef191aef5c400e88717359a256afc4,

title = "PARALLEL RANGE SEARCH ALGORITHM USING MULTIPLE ATTRIBUTE TREE.",

abstract = "A parallel algorithm is presented for the problem of range searches on a single-instruction multiple-data (SIMD) computing system with p processing elements. The linearized multiple attribute tree is used as the underlying data structure. The algorithm has complexity of O(kN/p), p less than equivalent to N, where k is the dimensionality and N is the number of points of the data space.",

author = "Rao, {Nageswara S.V.} and Iyengar, {S. S.} and Kashyap, {R. L.}",

year = "1986",

language = "English",

isbn = "0818607246",

series = "Proceedings of the International Conference on Parallel Processing",

publisher = "IEEE",

pages = "931--933",

editor = "Kai Hwang and Jacobs, {Steven M.} and Swartzlander, {Earl E.}",

booktitle = "Proceedings of the International Conference on Parallel Processing",

}

PARALLEL RANGE SEARCH ALGORITHM USING MULTIPLE ATTRIBUTE TREE. / Rao, Nageswara S.V.; Iyengar, S. S.; Kashyap, R. L.
Proceedings of the International Conference on Parallel Processing. ed. / Kai Hwang; Steven M. Jacobs; Earl E. Swartzlander. IEEE, 1986. p. 931-933 (Proceedings of the International Conference on Parallel Processing).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - PARALLEL RANGE SEARCH ALGORITHM USING MULTIPLE ATTRIBUTE TREE.

AU - Rao, Nageswara S.V.

AU - Iyengar, S. S.

AU - Kashyap, R. L.

PY - 1986

Y1 - 1986

N2 - A parallel algorithm is presented for the problem of range searches on a single-instruction multiple-data (SIMD) computing system with p processing elements. The linearized multiple attribute tree is used as the underlying data structure. The algorithm has complexity of O(kN/p), p less than equivalent to N, where k is the dimensionality and N is the number of points of the data space.

AB - A parallel algorithm is presented for the problem of range searches on a single-instruction multiple-data (SIMD) computing system with p processing elements. The linearized multiple attribute tree is used as the underlying data structure. The algorithm has complexity of O(kN/p), p less than equivalent to N, where k is the dimensionality and N is the number of points of the data space.

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

M3 - Conference contribution

AN - SCOPUS:0022893924

SN - 0818607246

T3 - Proceedings of the International Conference on Parallel Processing

SP - 931

EP - 933

BT - Proceedings of the International Conference on Parallel Processing

A2 - Hwang, Kai

A2 - Jacobs, Steven M.

A2 - Swartzlander, Earl E.

PB - IEEE

ER -

PARALLEL RANGE SEARCH ALGORITHM USING MULTIPLE ATTRIBUTE TREE.

Abstract

Publication series

Other files and links

Fingerprint

Cite this