Performance Evaluation of Parallel S-Trees
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 d...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Tousidou, Eleni [verfasserIn] Vassilakopoulos, Michael [author] Manolopoulos, Yannis [author] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2000 |
|---|
| Umfang: |
Online-Ressource |
|---|
| Reproduktion: |
IGI Global InfoSci Journals Archive 2000 - 2012 |
|---|---|
| Übergeordnetes Werk: |
In: Journal of database management - Hershey, Pa : IGI Global, 2000, 11(2000), 3, Seite 28-34 |
| Übergeordnetes Werk: |
volume:11 ; year:2000 ; number:3 ; pages:28-34 |
| Links: |
|---|
| DOI / URN: |
10.4018/jdm.2000070103 |
|---|
| Katalog-ID: |
NLEJ244517096 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | NLEJ244517096 | ||
| 003 | DE-627 | ||
| 005 | 20240202180309.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 150605s2000 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.4018/jdm.2000070103 |2 doi | |
| 035 | |a (DE-627)NLEJ244517096 | ||
| 035 | |a (VZGNL)10.4018/jdm.2000070103 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 100 | 1 | |a Tousidou, Eleni |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Performance Evaluation of Parallel S-Trees |
| 264 | 1 | |c 2000 | |
| 300 | |a Online-Ressource | ||
| 336 | |a nicht spezifiziert |b zzz |2 rdacontent | ||
| 337 | |a nicht spezifiziert |b z |2 rdamedia | ||
| 338 | |a nicht spezifiziert |b zu |2 rdacarrier | ||
| 520 | |a 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 | ||
| 533 | |f IGI Global InfoSci Journals Archive 2000 - 2012 | ||
| 700 | 1 | |a Vassilakopoulos, Michael |e author |4 aut | |
| 700 | 1 | |a Manolopoulos, Yannis |e author |4 aut | |
| 773 | 0 | 8 | |i In |t Journal of database management |d Hershey, Pa : IGI Global, 2000 |g 11(2000), 3, Seite 28-34 |h Online-Ressource |w (DE-627)NLEJ24441971X |w (DE-600)2070075-1 |x 1533-8010 |7 nnns |
| 773 | 1 | 8 | |g volume:11 |g year:2000 |g number:3 |g pages:28-34 |
| 856 | 4 | 0 | |u http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2000070103 |m X:IGIG |x Verlag |z Deutschlandweit zugänglich |
| 856 | 4 | 2 | |u http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2000070103&buylink=true |q text/html |y Abstract |z Deutschlandweit zugänglich |
| 912 | |a ZDB-1-GIS | ||
| 912 | |a GBV_NL_ARTICLE | ||
| 951 | |a AR | ||
| 952 | |d 11 |j 2000 |e 3 |h 28-34 | ||
| author_variant |
e t et m v mv y m ym |
|---|---|
| matchkey_str |
article:15338010:2000----::efraceautoopr |
| hierarchy_sort_str |
2000 |
| publishDate |
2000 |
| allfields |
10.4018/jdm.2000070103 doi (DE-627)NLEJ244517096 (VZGNL)10.4018/jdm.2000070103 DE-627 ger DE-627 rakwb eng Tousidou, Eleni verfasserin aut Performance Evaluation of Parallel S-Trees 2000 Online-Ressource nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier 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 IGI Global InfoSci Journals Archive 2000 - 2012 Vassilakopoulos, Michael author aut Manolopoulos, Yannis author aut In Journal of database management Hershey, Pa : IGI Global, 2000 11(2000), 3, Seite 28-34 Online-Ressource (DE-627)NLEJ24441971X (DE-600)2070075-1 1533-8010 nnns volume:11 year:2000 number:3 pages:28-34 http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2000070103 X:IGIG Verlag Deutschlandweit zugänglich http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2000070103&buylink=true text/html Abstract Deutschlandweit zugänglich ZDB-1-GIS GBV_NL_ARTICLE AR 11 2000 3 28-34 |
| spelling |
10.4018/jdm.2000070103 doi (DE-627)NLEJ244517096 (VZGNL)10.4018/jdm.2000070103 DE-627 ger DE-627 rakwb eng Tousidou, Eleni verfasserin aut Performance Evaluation of Parallel S-Trees 2000 Online-Ressource nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier 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 IGI Global InfoSci Journals Archive 2000 - 2012 Vassilakopoulos, Michael author aut Manolopoulos, Yannis author aut In Journal of database management Hershey, Pa : IGI Global, 2000 11(2000), 3, Seite 28-34 Online-Ressource (DE-627)NLEJ24441971X (DE-600)2070075-1 1533-8010 nnns volume:11 year:2000 number:3 pages:28-34 http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2000070103 X:IGIG Verlag Deutschlandweit zugänglich http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2000070103&buylink=true text/html Abstract Deutschlandweit zugänglich ZDB-1-GIS GBV_NL_ARTICLE AR 11 2000 3 28-34 |
| allfields_unstemmed |
10.4018/jdm.2000070103 doi (DE-627)NLEJ244517096 (VZGNL)10.4018/jdm.2000070103 DE-627 ger DE-627 rakwb eng Tousidou, Eleni verfasserin aut Performance Evaluation of Parallel S-Trees 2000 Online-Ressource nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier 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 IGI Global InfoSci Journals Archive 2000 - 2012 Vassilakopoulos, Michael author aut Manolopoulos, Yannis author aut In Journal of database management Hershey, Pa : IGI Global, 2000 11(2000), 3, Seite 28-34 Online-Ressource (DE-627)NLEJ24441971X (DE-600)2070075-1 1533-8010 nnns volume:11 year:2000 number:3 pages:28-34 http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2000070103 X:IGIG Verlag Deutschlandweit zugänglich http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2000070103&buylink=true text/html Abstract Deutschlandweit zugänglich ZDB-1-GIS GBV_NL_ARTICLE AR 11 2000 3 28-34 |
| allfieldsGer |
10.4018/jdm.2000070103 doi (DE-627)NLEJ244517096 (VZGNL)10.4018/jdm.2000070103 DE-627 ger DE-627 rakwb eng Tousidou, Eleni verfasserin aut Performance Evaluation of Parallel S-Trees 2000 Online-Ressource nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier 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 IGI Global InfoSci Journals Archive 2000 - 2012 Vassilakopoulos, Michael author aut Manolopoulos, Yannis author aut In Journal of database management Hershey, Pa : IGI Global, 2000 11(2000), 3, Seite 28-34 Online-Ressource (DE-627)NLEJ24441971X (DE-600)2070075-1 1533-8010 nnns volume:11 year:2000 number:3 pages:28-34 http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2000070103 X:IGIG Verlag Deutschlandweit zugänglich http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2000070103&buylink=true text/html Abstract Deutschlandweit zugänglich ZDB-1-GIS GBV_NL_ARTICLE AR 11 2000 3 28-34 |
| allfieldsSound |
10.4018/jdm.2000070103 doi (DE-627)NLEJ244517096 (VZGNL)10.4018/jdm.2000070103 DE-627 ger DE-627 rakwb eng Tousidou, Eleni verfasserin aut Performance Evaluation of Parallel S-Trees 2000 Online-Ressource nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier 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 IGI Global InfoSci Journals Archive 2000 - 2012 Vassilakopoulos, Michael author aut Manolopoulos, Yannis author aut In Journal of database management Hershey, Pa : IGI Global, 2000 11(2000), 3, Seite 28-34 Online-Ressource (DE-627)NLEJ24441971X (DE-600)2070075-1 1533-8010 nnns volume:11 year:2000 number:3 pages:28-34 http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2000070103 X:IGIG Verlag Deutschlandweit zugänglich http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2000070103&buylink=true text/html Abstract Deutschlandweit zugänglich ZDB-1-GIS GBV_NL_ARTICLE AR 11 2000 3 28-34 |
| language |
English |
| source |
In Journal of database management 11(2000), 3, Seite 28-34 volume:11 year:2000 number:3 pages:28-34 |
| sourceStr |
In Journal of database management 11(2000), 3, Seite 28-34 volume:11 year:2000 number:3 pages:28-34 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| isfreeaccess_bool |
false |
| container_title |
Journal of database management |
| authorswithroles_txt_mv |
Tousidou, Eleni @@aut@@ Vassilakopoulos, Michael @@aut@@ Manolopoulos, Yannis @@aut@@ |
| publishDateDaySort_date |
2000-01-01T00:00:00Z |
| hierarchy_top_id |
NLEJ24441971X |
| id |
NLEJ244517096 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">NLEJ244517096</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240202180309.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">150605s2000 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.4018/jdm.2000070103</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)NLEJ244517096</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(VZGNL)10.4018/jdm.2000070103</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Tousidou, Eleni</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Performance Evaluation of Parallel S-Trees</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2000</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="f">IGI Global InfoSci Journals Archive 2000 - 2012</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Vassilakopoulos, Michael</subfield><subfield code="e">author</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Manolopoulos, Yannis</subfield><subfield code="e">author</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Journal of database management</subfield><subfield code="d">Hershey, Pa : IGI Global, 2000</subfield><subfield code="g">11(2000), 3, Seite 28-34</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)NLEJ24441971X</subfield><subfield code="w">(DE-600)2070075-1</subfield><subfield code="x">1533-8010</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:11</subfield><subfield code="g">year:2000</subfield><subfield code="g">number:3</subfield><subfield code="g">pages:28-34</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2000070103</subfield><subfield code="m">X:IGIG</subfield><subfield code="x">Verlag</subfield><subfield code="z">Deutschlandweit zugänglich</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2000070103&buylink=true</subfield><subfield code="q">text/html</subfield><subfield code="y">Abstract</subfield><subfield code="z">Deutschlandweit zugänglich</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-GIS</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_NL_ARTICLE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">11</subfield><subfield code="j">2000</subfield><subfield code="e">3</subfield><subfield code="h">28-34</subfield></datafield></record></collection>
|
| series2 |
IGI Global InfoSci Journals Archive 2000 - 2012 |
| author |
Tousidou, Eleni |
| spellingShingle |
Tousidou, Eleni Performance Evaluation of Parallel S-Trees |
| authorStr |
Tousidou, Eleni |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)NLEJ24441971X |
| format |
electronic Article |
| delete_txt_mv |
keep |
| author_role |
aut aut aut |
| collection |
NL |
| remote_str |
true |
| illustrated |
Not Illustrated |
| issn |
1533-8010 |
| topic_title |
Performance Evaluation of Parallel S-Trees |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
zu |
| hierarchy_parent_title |
Journal of database management |
| hierarchy_parent_id |
NLEJ24441971X |
| hierarchy_top_title |
Journal of database management |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)NLEJ24441971X (DE-600)2070075-1 |
| title |
Performance Evaluation of Parallel S-Trees |
| ctrlnum |
(DE-627)NLEJ244517096 (VZGNL)10.4018/jdm.2000070103 |
| title_full |
Performance Evaluation of Parallel S-Trees |
| author_sort |
Tousidou, Eleni |
| journal |
Journal of database management |
| journalStr |
Journal of database management |
| lang_code |
eng |
| isOA_bool |
false |
| recordtype |
marc |
| publishDateSort |
2000 |
| contenttype_str_mv |
zzz |
| container_start_page |
28 |
| author_browse |
Tousidou, Eleni Vassilakopoulos, Michael Manolopoulos, Yannis |
| container_volume |
11 |
| physical |
Online-Ressource |
| format_se |
Elektronische Aufsätze |
| author-letter |
Tousidou, Eleni |
| doi_str_mv |
10.4018/jdm.2000070103 |
| author2-role |
author |
| title_sort |
performance evaluation of parallel s-trees |
| title_auth |
Performance Evaluation of Parallel S-Trees |
| 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 |
| abstractGer |
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 |
| abstract_unstemmed |
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 |
| collection_details |
ZDB-1-GIS GBV_NL_ARTICLE |
| container_issue |
3 |
| title_short |
Performance Evaluation of Parallel S-Trees |
| url |
http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2000070103 http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2000070103&buylink=true |
| remote_bool |
true |
| author2 |
Vassilakopoulos, Michael Manolopoulos, Yannis |
| author2Str |
Vassilakopoulos, Michael Manolopoulos, Yannis |
| ppnlink |
NLEJ24441971X |
| mediatype_str_mv |
z |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.4018/jdm.2000070103 |
| up_date |
2024-07-06T08:09:30.534Z |
| _version_ |
1803816398262108160 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">NLEJ244517096</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240202180309.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">150605s2000 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.4018/jdm.2000070103</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)NLEJ244517096</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(VZGNL)10.4018/jdm.2000070103</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Tousidou, Eleni</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Performance Evaluation of Parallel S-Trees</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2000</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="f">IGI Global InfoSci Journals Archive 2000 - 2012</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Vassilakopoulos, Michael</subfield><subfield code="e">author</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Manolopoulos, Yannis</subfield><subfield code="e">author</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">Journal of database management</subfield><subfield code="d">Hershey, Pa : IGI Global, 2000</subfield><subfield code="g">11(2000), 3, Seite 28-34</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)NLEJ24441971X</subfield><subfield code="w">(DE-600)2070075-1</subfield><subfield code="x">1533-8010</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:11</subfield><subfield code="g">year:2000</subfield><subfield code="g">number:3</subfield><subfield code="g">pages:28-34</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2000070103</subfield><subfield code="m">X:IGIG</subfield><subfield code="x">Verlag</subfield><subfield code="z">Deutschlandweit zugänglich</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdm.2000070103&buylink=true</subfield><subfield code="q">text/html</subfield><subfield code="y">Abstract</subfield><subfield code="z">Deutschlandweit zugänglich</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-GIS</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_NL_ARTICLE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">11</subfield><subfield code="j">2000</subfield><subfield code="e">3</subfield><subfield code="h">28-34</subfield></datafield></record></collection>
|
| score |
7.3997183 |