Sciweavers

785 search results - page 70 / 157
» Binary Join Trees
Sort
View
DASFAA
2007
IEEE
205views Database» more  DASFAA 2007»
15 years 1 months ago
Efficient Support for Ordered XPath Processing in Tree-Unaware Commercial Relational Databases
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. ...
ICDE
2010
IEEE
272views Database» more  ICDE 2010»
15 years 9 months ago
SMARTINT: A System for Answering Queries over Web Databases Using Attribute Dependencies
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, ...
VLDB
1995
ACM
194views Database» more  VLDB 1995»
15 years 1 months ago
Eager Aggregation and Lazy Aggregation
Efficient processing of aggregation queries is essential for decision support applications. This paper describes a class of query transformations, called eager aggregation and lat...
Weipeng P. Yan, Per-Åke Larson
ICVGIP
2004
14 years 11 months ago
3D Reconstruction of Retinal Blood Vessels from Two Views
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...
M. Elena Martínez-Pérez, Arturo Espi...
DM
2008
113views more  DM 2008»
14 years 10 months ago
Multivariate Fuss-Catalan numbers
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-...
Jean-Christophe Aval