Performance Evaluation of Parallel S-Trees

Tousidou, Eleni; Vassilakopoulos, Michael; Manolopoulos, Yannis

doi:10.4018/jdm.2000070103

Cited by 6 publications

(6 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Future work could involve the application of the previous methods in a distributed environment F like the gaining popularity SSDS model [28] F or in a parallel environment [29,30]. Finally, another step for future research is the examination of the method's performance on joining sets [23,26].…”

Section: Resultsmentioning

confidence: 99%

Signature-based structures for objects with set-valued attributes

Tousidou

Bozanis

Manolopoulos

2002

Information Systems

Self Cite

View full text Add to dashboard Cite

Aiming at the efficient retrieval of objects with set-valued attributes, we introduce three variations of a new method in order to satisfy subset and superset queries. Our approach is to combine the advantages of two access methods, that of linear Hashing and of tree-shaped methods, on which other similar methods have been previously reported as well. Performance estimation analytical functions for each particular method are presented, followed by a thorough experimental comparison of all investigated structures, where analytical and experimental results deviate 10% on the average. Finally, the results of this performance evaluation are presented and discussed, clearly showing the superiority of the new methods reaching an improvement of up to 85%. r

show abstract

Section: Resultsmentioning

confidence: 99%

Signature-based structures for objects with set-valued attributes

Tousidou

Bozanis

Manolopoulos

2002

Information Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…Future work could involve a combination of S-trees with some of the methods that are based on data partitioning in combination with hashing techniques [36]. A possible direction could also be the application of this method in a parallel environment [37].…”

Section: Resultsmentioning

confidence: 99%

Improved Methods for Signature-Tree Construction

Tousidou¹

2000

The Computer Journal

View full text Add to dashboard Cite

Signature-based tree structures which have been proposed in the past do not perform well for large databases. The problem arises from the fact that they are incapable of pruning searching, especially at the upper tree levels, and thus they have decreased selectivities. In this paper, we locate a number of reasons for this problem and propose several methods for node splitting and partial-tree restructuring, which lead to improved query-response times. We have implemented all methods and we present experimental results, which indicate that the proposed methods are superior in all cases to the standard one and up to 5-10 times better for medium and higher weights in inclusive (partialmatch) queries. Additionally, we have developed new functions for the performance estimation of signature trees which, in contrast to a previous estimation function, are able to take into account the outcome of different split methods and to provide more accurate estimation.

show abstract

“…Tousidou et al [12] has been used S -tree in order to improve performance and they proposed parallel S -tree. S -tree is a dynamic height-balanced tree similar in structure to B+ -Tree and designed for storing signatures.…”

Section: Related Workmentioning

confidence: 99%

R-Tree for phase change memory

Jabarov

Choi

et al. 2017

COMSIS J

View full text Add to dashboard Cite

Nowadays, many applications use spatial data for instance-location information, so storing spatial data is important. We suggest using R-Tree over PCM. Our objective is to design a PCM-sensitive R-Tree that can store spatial data as well as improve the endurance problem. Initially, we examine how R-Tree causes endurance problems in PCM, and we then optimize it for PCM. We propose doubling the leaf node size, writing a split node to a blank node, updating parent nodes only once and not merging the nodes after deletion when the minimum fill factor requirement does not meet. Based on our experimental results while using benchmark dataset, the number of write operations to PCM in average decreased by 56 times by using the proposed R-Tree. Moreover, the proposed R-Tree scheme improves the performance in terms of processing time in average 23% compared to R-Tree.

show abstract

Performance Evaluation of Parallel S-Trees

Cited by 6 publications

References 10 publications

Signature-based structures for objects with set-valued attributes

Signature-based structures for objects with set-valued attributes

Improved Methods for Signature-Tree Construction

R-Tree for phase change memory

Contact Info

Product

Resources

About