Seidl T, Kriegel H P
Institute for Computer Science, University of Munich, Germany.
Proc Int Conf Intell Syst Mol Biol. 1995;3:350-8.
Protein docking is a new and challenging application for query processing in database systems. Our architecture for an efficient support of docking queries is based on the multistep query processing paradigm, a technique well-known from spatial database system. Along with physicochemical parameters, the geometry of the molecules plays a fundamental role for docking retrieval. Thus, 3D structures and 3D surfaces of molecules are basic objects in molecular databases. We specify a molecular surface representation based on topology, define a class of neighborhood queries, and sketch some applications with respect to the docking problem. We suggest a patch-based data structure called the TriEdge structure, first, to efficiently support topological query processing, and second, to save space in comparison to common planar graph representations such as the quad-edge structure. In analogy to the quad-edge structure, the TriEdge structure has an algebraic interface and is implemented via complex pointers. However, we achieve a reduction of the space requirement by a factor of four. Finally, we investigate the time performance of our prototype.
蛋白质对接是数据库系统中查询处理的一个新的具有挑战性的应用。我们用于高效支持对接查询的架构基于多步查询处理范式,这是一种在空间数据库系统中广为人知的技术。除了物理化学参数外,分子的几何形状在对接检索中起着至关重要的作用。因此,分子的三维结构和三维表面是分子数据库中的基本对象。我们基于拓扑指定了一种分子表面表示,定义了一类邻域查询,并概述了一些关于对接问题的应用。我们首先提出一种称为TriEdge结构的基于面片的数据结构,以有效地支持拓扑查询处理,其次,与诸如四边结构等常见的平面图表示相比,节省空间。类似于四边结构,TriEdge结构具有代数接口并通过复杂指针实现。然而,我们将空间需求减少了四分之一。最后,我们研究了我们原型的时间性能。