An efficient algorithm for bulk-loading xBR[formula omitted]-trees

Autor: Roumelis, George, Vassilakopoulos, Michael, Corral, Antonio, Manolopoulos, Yannis

Publikováno v: In Computer Standards & Interfaces March 2018 57:83-100

Bulk-loading and bulk-insertion algorithms for xBR+-trees in Solid State Drives.

Autor: Roumelis, George¹ (AUTHOR) groumelis@uth.gr, Fevgas, Athanasios¹ (AUTHOR) fevgas@uth.gr, Vassilakopoulos, Michael¹ (AUTHOR) mvasilako@uth.gr, Corral, Antonio² (AUTHOR) acorral@ual.es, Bozanis, Panayiotis¹ (AUTHOR) pbozanis@uth.gr, Manolopoulos, Yannis³ (AUTHOR) yannis.manolopoulos@ouc.ac.cy

Publikováno v: Computing. Oct2019, Vol. 101 Issue 10, p1539-1563. 25p.

New plane-sweep algorithms for distance-based join queries in spatial databases.

Autor: Roumelis, George¹ groumeli@csd.auth.gr, Corral, Antonio² acorral@ual.es, Vassilakopoulos, Michael³ mvasilako@uth.gr, Manolopoulos, Yannis¹ manolopo@csd.auth.gr

Publikováno v: GeoInformatica. Oct2016, Vol. 20 Issue 4, p571-628. 58p.

Bulk Insertions into xBR+ -trees

Autor: Roumelis, George, Vassilakopoulos, Michael, Corral Liria, Antonio Leopoldo, Manolopoulos, Yannis

Publikováno v: 7th International Conference, MEDI 2017, Barcelona, Spain, October 4–6, 2017. LNCS 10563, pp. 185-199, Springer. ISBN: 978-3-319-66853-6
riUAL. Repositorio Institucional de la Universidad de Almería
Universidad de Almería

Bulk insertion refers to the process of updating an existing index by inserting a large batch of new data, treating the items of this batch as a whole and not by inserting these items one-by-one. Bulk insertion is related to bulk loading, which refer

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::311e28f0983983a7c034e434370b878b
https://doi.org/10.1007/978-3-319-66854-3_14

The K Group Nearest-Neighbor Query on Non-indexed RAM-Resident Data

Autor: Roumelis, George, Vassilakopoulos, Michael, Corral Liria, Antonio Leopoldo, Manolopoulos, Yannis

Publikováno v: Geographical Information Systems Theory, Applications and Management. First International Conference, GISTAM 2015, Barcelona, Spain, April 28-30. Communications in Computer and Information Science, Volume 582, pp 69-89, 2016
riUAL. Repositorio Institucional de la Universidad de Almería
Universidad de Almería

Data sets that are used for answering a single query only once (or just a few times) before they are replaced by new data sets appear frequently in practical applications. The cost of buiding indexes to accelerate query processing would not be repaid

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::a3f3a7f4d4b79d9750210dc69ef15603
http://hdl.handle.net/10835/5207