Welcome to the InfoSci Platform
Reference Hub3
Performance Evaluation of Parallel S-Trees

Performance Evaluation of Parallel S-Trees

Eleni Tousidou, Michael Vassilakopoulos, Yannis Manolopoulos
Copyright: © 2000 |Volume: 11 |Issue: 3 |Pages: 7
ISSN: 1063-8016|EISSN: 1533-8010|ISSN: 1063-8016|EISBN13: 9781615200733|EISSN: 1533-8010|DOI: 10.4018/jdm.2000070103
Cite Article Cite Article

MLA

Tousidou, Eleni, et al. "Performance Evaluation of Parallel S-Trees." JDM vol.11, no.3 2000: pp.28-34. http://doi.org/10.4018/jdm.2000070103

APA

Tousidou, E., Vassilakopoulos, M., & Manolopoulos, Y. (2000). Performance Evaluation of Parallel S-Trees. Journal of Database Management (JDM), 11(3), 28-34. http://doi.org/10.4018/jdm.2000070103

Chicago

Tousidou, Eleni, Michael Vassilakopoulos, and Yannis Manolopoulos. "Performance Evaluation of Parallel S-Trees," Journal of Database Management (JDM) 11, no.3: 28-34. http://doi.org/10.4018/jdm.2000070103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

The S-tree is a dynamic height-balanced tree similar in structure to B+trees. S-trees store fixed length bit-strings, which are called signatures. Signatures are used for indexing textbases, relational, object oriented and extensible databases as well as in data mining. In this article, methods of designing multi-disk B-trees are adapted to S-trees and new methods of parallelizing S-trees are developed. The resulting structures aim at achieving performance gain by accessing two or more disks simultaneously. In addition, two different searching techniques that exploit parallel disk accessing are devised. Performance results of experiments based on the new structures and searching techniques are also presented and discussed.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.