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.