Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[KNYGA][B] R-Trees: Theory and Applications: Theory and Applications
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 …
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 …
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
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 …
systems. Recently, a new family of index, named learned index, is proposed to learn hidden …
Predicting cost amortization for query services
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 …
providers need to build data structures, eg materialized views and indexes, in order to offer …
Indexed-based density biased sampling for clustering applications
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 …
sampling, by producing the desired probability distribution in the sample. The ease of …
An efficient and effective algorithm for density biased sampling
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 …
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 …
techniques solve this problem efficiently only for the approximate cases. These solutions are …
An efficient algorithm for bulk-loading xBR+-trees
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 …
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 …
well-behaved data structures for accommodating dynamic massive sets of geometric objects …
Efficient bulk-loading on dynamic metric access methods
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 …
dynamic metric access methods, based on the covering radius of representative elements …