The HeightBL Algorithm for Bulk-loading F-Onion-trees
Saved in:
| Title: | The HeightBL Algorithm for Bulk-loading F-Onion-trees |
|---|---|
| Authors: | Carosia, Arthur Emanuel de Oliveira, Ciferri, Ricardo Rodrigues, Ciferri, Cristina Dutra de Aguiar |
| Contributors: | FAPESP, CNPq, CAPES and FINEP |
| Source: | Journal of Information and Data Management; v. 5, n. 3 (2014): SBBD 2014; 321 Journal of Information and Data Management; Vol 5 No 3 (2014): SBBD 2014; 321 Journal of Information and Data Management; v. 5 n. 3 (2014): SBBD 2014; 321 |
| Publisher Information: | SBC - Brazilian Computer Society, 2014. |
| Publication Year: | 2014 |
| Subject Terms: | metric access method, similarity search, bulk-loading, Onion-tree, F-Onion-tree |
| Description: | The F-Onion-tree is a robust access method that slices the metric space into disjoint subspaces to provide quick indexing of complex data in the main memory. However, the F-Onion-tree only performs element-by-element insertions into its structure, i.e. it does not introduce a technique to build the index considering all elements of the dataset at once. In this article, we fill this gap. We propose the HeightBL algorithm for bulk-loading F-Onion-trees. Performance tests with real-world data with different volumes and dimensionalities showed that the index produced by the HeightBL algorithm is very compact. Compared with the element-by-element insertion, the size of the index reduced from 53.42% to 71.25%. The experiments also showed that the HeightBL algorithm significantly improved range and k-NN query processing performance. It required from 13.38% up to 99.94% less distance calculations and was from 8.57% up to 99.04% faster than the element-by-element insertion. |
| Document Type: | Article |
| File Description: | application/pdf; application/zip |
| Language: | English |
| ISSN: | 2178-7107 |
| Access URL: | https://seer.ufmg.br/index.php/jidm/article/view/729 https://seer.ufmg.br/index.php/jidm/article/view/288 |
| Accession Number: | edsair.dedup.wf.002..6d68f19a689a1da03a2bc6e8606b6a86 |
| Database: | OpenAIRE |
| FullText | Text: Availability: 0 CustomLinks: – Url: https://explore.openaire.eu/search/publication?articleId=dedup_wf_002%3A%3A6d68f19a689a1da03a2bc6e8606b6a86 Name: EDS - OpenAIRE (s4221598) Category: fullText Text: View record at OpenAIRE – Url: https://resolver.ebscohost.com/openurl?sid=EBSCO:edsair&genre=article&issn=21787107&ISBN=&volume=&issue=&date=20140928&spage=&pages=&title=Journal of Information and Data Management&atitle=The%20HeightBL%20Algorithm%20for%20Bulk-loading%20F-Onion-trees&aulast=Carosia%2C%20Arthur%20Emanuel%20de%20Oliveira&id=DOI: Name: Full Text Finder Category: fullText Text: Full Text Finder Icon: https://imageserver.ebscohost.com/branding/images/FTF.gif MouseOverText: Full Text Finder – Url: https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=EBSCO&SrcAuth=EBSCO&DestApp=WOS&ServiceName=TransferToWoS&DestLinkType=GeneralSearchSummary&Func=Links&author=Carosia%20AEdO Name: ISI Category: fullText Text: Nájsť tento článok vo Web of Science Icon: https://imagesrvr.epnet.com/ls/20docs.gif MouseOverText: Nájsť tento článok vo Web of Science |
|---|---|
| Header | DbId: edsair DbLabel: OpenAIRE An: edsair.dedup.wf.002..6d68f19a689a1da03a2bc6e8606b6a86 RelevancyScore: 770 AccessLevel: 3 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 769.565551757813 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: The HeightBL Algorithm for Bulk-loading F-Onion-trees – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Carosia%2C+Arthur+Emanuel+de+Oliveira%22">Carosia, Arthur Emanuel de Oliveira</searchLink><br /><searchLink fieldCode="AR" term="%22Ciferri%2C+Ricardo+Rodrigues%22">Ciferri, Ricardo Rodrigues</searchLink><br /><searchLink fieldCode="AR" term="%22Ciferri%2C+Cristina+Dutra+de+Aguiar%22">Ciferri, Cristina Dutra de Aguiar</searchLink> – Name: Author Label: Contributors Group: Au Data: FAPESP, CNPq, CAPES and FINEP – Name: TitleSource Label: Source Group: Src Data: Journal of Information and Data Management; v. 5, n. 3 (2014): SBBD 2014; 321<br />Journal of Information and Data Management; Vol 5 No 3 (2014): SBBD 2014; 321<br />Journal of Information and Data Management; v. 5 n. 3 (2014): SBBD 2014; 321 – Name: Publisher Label: Publisher Information Group: PubInfo Data: SBC - Brazilian Computer Society, 2014. – Name: DatePubCY Label: Publication Year Group: Date Data: 2014 – Name: Subject Label: Subject Terms Group: Su Data: <searchLink fieldCode="DE" term="%22metric+access+method%2C+similarity+search%22">metric access method, similarity search</searchLink><br /><searchLink fieldCode="DE" term="%22bulk-loading%22">bulk-loading</searchLink><br /><searchLink fieldCode="DE" term="%22Onion-tree%22">Onion-tree</searchLink><br /><searchLink fieldCode="DE" term="%22F-Onion-tree%22">F-Onion-tree</searchLink> – Name: Abstract Label: Description Group: Ab Data: The F-Onion-tree is a robust access method that slices the metric space into disjoint subspaces to provide quick indexing of complex data in the main memory. However, the F-Onion-tree only performs element-by-element insertions into its structure, i.e. it does not introduce a technique to build the index considering all elements of the dataset at once. In this article, we fill this gap. We propose the HeightBL algorithm for bulk-loading F-Onion-trees. Performance tests with real-world data with different volumes and dimensionalities showed that the index produced by the HeightBL algorithm is very compact. Compared with the element-by-element insertion, the size of the index reduced from 53.42% to 71.25%. The experiments also showed that the HeightBL algorithm significantly improved range and k-NN query processing performance. It required from 13.38% up to 99.94% less distance calculations and was from 8.57% up to 99.04% faster than the element-by-element insertion. – Name: TypeDocument Label: Document Type Group: TypDoc Data: Article – Name: Format Label: File Description Group: SrcInfo Data: application/pdf; application/zip – Name: Language Label: Language Group: Lang Data: English – Name: ISSN Label: ISSN Group: ISSN Data: 2178-7107 – Name: URL Label: Access URL Group: URL Data: <link linkTarget="URL" linkTerm="https://seer.ufmg.br/index.php/jidm/article/view/729" linkWindow="_blank">https://seer.ufmg.br/index.php/jidm/article/view/729</link><br /><link linkTarget="URL" linkTerm="https://seer.ufmg.br/index.php/jidm/article/view/288" linkWindow="_blank">https://seer.ufmg.br/index.php/jidm/article/view/288</link> – Name: AN Label: Accession Number Group: ID Data: edsair.dedup.wf.002..6d68f19a689a1da03a2bc6e8606b6a86 |
| PLink | https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsair&AN=edsair.dedup.wf.002..6d68f19a689a1da03a2bc6e8606b6a86 |
| RecordInfo | BibRecord: BibEntity: Languages: – Text: English Subjects: – SubjectFull: metric access method, similarity search Type: general – SubjectFull: bulk-loading Type: general – SubjectFull: Onion-tree Type: general – SubjectFull: F-Onion-tree Type: general Titles: – TitleFull: The HeightBL Algorithm for Bulk-loading F-Onion-trees Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Carosia, Arthur Emanuel de Oliveira – PersonEntity: Name: NameFull: Ciferri, Ricardo Rodrigues – PersonEntity: Name: NameFull: Ciferri, Cristina Dutra de Aguiar – PersonEntity: Name: NameFull: FAPESP, CNPq, CAPES and FINEP IsPartOfRelationships: – BibEntity: Dates: – D: 28 M: 09 Type: published Y: 2014 Identifiers: – Type: issn-print Value: 21787107 – Type: issn-locals Value: edsair – Type: issn-locals Value: edsairFT Titles: – TitleFull: Journal of Information and Data Management Type: main |
| ResultId | 1 |
Full Text Finder
Nájsť tento článok vo Web of Science