Separable Splits of Metric Data Sets

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F01%3A00005100" target="_blank" >RIV/00216224:14330/01:00005100 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Separable Splits of Metric Data Sets

Original language description

In order to speedup retrieval in large collections of data, index structures partition the data into subsets so that query requests can be evaluated without examining the entire collection. As the complexity of modern data types (such as image, video, oraudio features) grows, the traditional partitioning techniques based on total ordering of data can not typically be applied. We consider the problem of partitioning data collections from generic metric spaces, where total ordering of objects does not exists, and where only distances between pairs of objects can be determined. We study the elementary type of partitioning that splits a given collection into two well-separated subsets, allowing some objects to be excluded from the partitioning process. Five implementation techniques of separable splits are proposed and proved for correctness.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

BD - Information theory

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2001

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

SEBD01 - Italian Symposium on Database Systems

ISBN

—

ISSN

—

e-ISSN

—

Number of pages

18

Pages from-to

45

Publisher name

University Press

Place of publication

Milano

Event location

Milano

Event date

Jan 1, 2001

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—