Abstract. In this paper, we present a novel ordered XPATH evaluation in treeunaware RDBMS. The novelties of our approach lies in the followings. (a) We propose a novel XML storage ...
Boon-Siew Seah, Klarinda G. Widjanarko, Sourav S. ...
Many web databases can be seen as providing partial and overlapping information about entities in the world. To answer queries effectively, we need to integrate the information abo...
Ravi Gummadi, Anupam Khulbe, Aravind Kalavagattu, ...
Efficient processing of aggregation queries is essential for decision support applications. This paper describes a class of query transformations, called eager aggregation and lat...
A 3D reconstruction of retinal blood vessel trees using two views of fundus images is presented. The problem addresses: 1) The recovery of camera-eye model parameters by an self-c...
Catalan numbers C(n) = 1 n+1 2n n enumerate binary trees and Dyck paths. The distribution of paths with respect to their number k of factors is given by ballot numbers B(n, k) = n-...