[KNYGA][B] R-Trees: Theory and Applications: Theory and Applications

Y Manolopoulos, A Nanopoulos, AN Papadopoulos… - 2006 - books.google.com
Space support in databases poses new challenges in every part of a database management
system & the capability of spatial support in the physical layer is considered very important …

[KNYGA][B] Advanced information and knowledge processing

L Jain, X Wu - 2009 - Springer
This volume was born from the experience of the authors as researchers and educators,
which suggests that many students of data mining are handicapped in their research by the …

A pluggable learned index method via sampling and gap insertion

Y Li, D Chen, B Ding, K Zeng, J Zhou - arxiv preprint arxiv:2101.00808, 2021 - arxiv.org
Database indexes facilitate data retrieval and benefit broad applications in real-world
systems. Recently, a new family of index, named learned index, is proposed to learn hidden …

Predicting cost amortization for query services

V Kantere, D Dash, G Gratsias, A Ailamaki - Proceedings of the 2011 …, 2011 - dl.acm.org
Emerging providers of online services offer access to data collections. Such data service
providers need to build data structures, eg materialized views and indexes, in order to offer …

Indexed-based density biased sampling for clustering applications

A Nanopoulos, Y Theodoridis… - Data & Knowledge …, 2006 - Elsevier
Density biased sampling (DBS) has been proposed to address the limitations of Uniform
sampling, by producing the desired probability distribution in the sample. The ease of …

An efficient and effective algorithm for density biased sampling

A Nanopoulos, Y Manolopoulos… - Proceedings of the …, 2002 - dl.acm.org
In this paper we describe a new density-biased sampling algorithm. It exploits spatial
indexes and the local density information they preserve, to provide improved quality of …

Simp: accurate and efficient near neighbor search in high dimensional spaces

V Singh, AK Singh - Proceedings of the 15th International Conference on …, 2012 - dl.acm.org
Near neighbor search in high dimensional spaces is useful in many applications. Existing
techniques solve this problem efficiently only for the approximate cases. These solutions are …

An efficient algorithm for bulk-loading xBR+-trees

G Roumelis, M Vassilakopoulos, A Corral… - Computer Standards & …, 2018 - Elsevier
A major part of the interface to a database is made up of the queries that can be addressed
to this database and answered (processed) in an efficient way, contributing to the quality of …

LR-tree: a logarithmic decomposable spatial index method

P Bozanis, A Nanopoulos… - The computer …, 2003 - ieeexplore.ieee.org
Since its introduction in 1984, R-tree has been proven to be one of the most practical and
well-behaved data structures for accommodating dynamic massive sets of geometric objects …

Efficient bulk-loading on dynamic metric access methods

TG Vespa, C Traina Jr, AJ Traina - Information Systems, 2010 - Elsevier
This paper presents a new technique and two algorithms to bulk-load data into multi-way
dynamic metric access methods, based on the covering radius of representative elements …