Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases

C Böhm, S Berchtold, DA Keim - ACM Computing Surveys (CSUR), 2001 - dl.acm.org
During the last decade, multimedia databases have become increasingly important in many
application areas such as medicine, CAD, geography, and molecular biology. An important …

[图书][B] Data mining: concepts and techniques

J Han, J Pei, H Tong - 2022 - books.google.com
Data Mining: Concepts and Techniques, Fourth Edition introduces concepts, principles, and
methods for mining patterns, knowledge, and models from various kinds of data for diverse …

The dangers of replication and a solution

J Gray, P Helland, P O'Neil, D Shasha - Proceedings of the 1996 ACM …, 1996 - dl.acm.org
Update anywhere-anytime-anyway transactional replication has unstable behavior as the
workload scales up: a ten-fold increase in nodes and traffic gives a thousand fold increase in …

Distance browsing in spatial databases

GR Hjaltason, H Samet - ACM Transactions on Database Systems …, 1999 - dl.acm.org
We compare two different techniques for browsing through a collection of spatial objects
stored in an R-tree spatial data structure on the basis of their distances from an arbitrary …

Probabilistic location and routing

SC Rhea, J Kubiatowicz - … -First Annual Joint Conference of the …, 2002 - ieeexplore.ieee.org
We propose probabilistic location to enhance the performance of existing peer-to-peer
location mechanisms in the case where a replica for the queried data item exists close to the …

[PDF][PDF] Integrating the UB-tree into a database system kernel.

F Ramsak, V Markl, R Fenk, M Zirkel, K Elhardt… - VLDB, 2000 - academia.edu
Multidimensional access methods have shown high potential for significant performance
improvements in various application domains. However, only few approaches have made …

The data calculator: Data structure design and cost synthesis from first principles and learned cost models

S Idreos, K Zoumpatianos, B Hentschel… - Proceedings of the …, 2018 - dl.acm.org
Data structures are critical in any data-driven scenario, but they are notoriously hard to
design due to a massive design space and the dependence of performance on workload …

Selectivity estimation in spatial databases

S Acharya, V Poosala, S Ramaswamy - Proceedings of the 1999 ACM …, 1999 - dl.acm.org
Selectivity estimation of queries is an important and well-studied problem in relational
database systems. In this paper, we examine selectivity estimation in the context of …

[PDF][PDF] Design Continuums and the Path Toward Self-Designing Key-Value Stores that Know and Learn.

S Idreos, N Dayan, W Qin, M Akmanalp, S Hilgard… - CIDR, 2019 - nivdayan.github.io
We introduce the concept of design continuums for the data layout of key-value stores. A
design continuum unifies major distinct data structure designs under the same model. The …

[PDF][PDF] Data mining concepts and techniques third edition

J Han, M Kamber, J Pei - University of Illinois at Urbana-Champaign …, 2012 - academia.edu
This book is an introduction to the young and fast-growing field of data mining (also known
as knowledge discovery from data, or KDD for short). The book focuses on fundamental data …