Distributed Hash Tables (DHTs) provide the substrate to build large scale distributed applications over Peerto-Peer networks. A major limitation of DHTs is that they only support exact-match queries. In order to offer range queries over a DHT it is necessary to build additional indexing structures. Prefix-based indexes, such as Prefix Hash Tree (PHT), are interesting approaches for building dis...

Primary B-tree, a variant of B-tree structure with row data in leaf blocks, is an ideal storage organization for queries involving exact match and/or range search on primary keys. Commercially, primary B-tree like structures have been supported in DBMSs like Compaq Non-Stop SQL, Sybase Adaptive Server, and Microsoft SQL Server. Oracle’s index-organized table is like a primary B-tree; however, i...

A binary three-dimensional (3D) image I is well-composed if the boundary surface of its continuous analog is a 2D manifold. In this paper, we present a method to locally “repair” the cubical complex Q(I) (embedded in R3) associated to I to obtain a polyhedral complex P (I) homotopy equivalent to Q(I) such that the boundary surface of P (I) is a 2D manifold (and, hence, P (I) is a well-composed ...

Today, more and more enterprises process XML data, many of them already in XML database systems. Once systems start to grow in size, scalability becomes an issue. One of the core operations during insert processing is the index maintenance. Typical relational systems only have few indexes per table, however, XML database users already look at creating hundreds of XML indexes per XML column. A s...

In the present paper, we show that $S^*$ iteration method can be used to approximate fixed point of almost contraction mappings. Furthermore, we prove that this iteration method is equivalent to CR iteration method  and it produces a slow convergence rate compared to the CR iteration method for the class of almost contraction mappings. We also present table and graphic to support this result. F...

[Purpose] The purpose of this study was to investigate the amount of plantar pressures on the lower limb during tilt table standing and to indicate the ideal degree of tilting for partial weight bearing. [Subjects and Methods] Fifteen healthy subjects between the ages of 20 and 30 were recruited as volunteers for this study. All the measurements were taken while standing on a tilt table accordi...

This paper presents an automatic application that provides several retinal image analysis functionalities, namely vessel segmentation, vessel width estimation, artery/vein classification and optic disc segmentation. A pipeline of these methods allows the computation of important vessel related indexes, namely the Central Retinal Arteriolar Equivalent (CRAE), Central Retinal Venular Equivalent (...

We have introduced a Multi-Dimensional Clustering (MDC) physical layout scheme in DB2 version 8.0 for relational tables. MultiDimensional Clustering is based on the definition of one or more orthogonal clustering attributes (or expressions) of a table. The table is organized physically by associating records with similar values for the dimension attributes in a cluster. Each clustering key is a...