EPIX – Efficient Ptolemaic Indexing

随着异类数据的快速增长，对高效、可伸缩的数据访问的需求也在增加。托勒密访问方法为基于度量相似性模型的复杂数据空间的索引和访问提供了一种与领域无关的方法。虽然初步研究已经证明了这种相对年轻的索引方法在各种数据密集型领域的效率，但这种方法的基本原理在很大程度上还没有被探索。关于度量和托勒密数据空间中距离的近似、托勒密查询的几何以及不同下界方法的相互作用等问题目前被认为没有得到充分的回答。本研究项目的目的是调查托勒密和公制访问方法的基本原理，并有条不紊地推进所获得的发现，以演示这类访问方法在索引大型、复杂数据空间时的性能。因此，这一研究项目追求的总体目标是推动开发用于探索数字数据资源的高效数据技术。

Concomitant with the rapid growth of heterogeneous data, the demand for efficient and scalable data access increases. Ptolemaic Access Methods provide a domain-agnostic approach for indexing and accessing complex data spaces based on metric similarity models. While initial studies have already demonstrated the efficiency of this comparatively young indexing method in various data-intensive domains, the fundamentals of this approach are largely unexplored. Questions concerning the approximation of distances in metric and ptolemaic data spaces, the geometry of ptolemaic queries, as well as the interaction of different lower bounding methods are currently considered to be not sufficiently answered. The aim of this research project is to investigate the fundamentals of ptolemaic and metric access methods and to methodically advance the findings obtained in order to demonstrate the performance of this class of access methods for indexing large, complex data spaces. This research project thus pursues the overall goal of advancing the development of efficient data technologies for exploring digital data resources.