Query processing of spatial objects: Complexity versus Redundancy

The management of complex spatial objects in applications, such as geography and cartography, imposes stringent new requirements on spatial database systems, in particular on efficient query processing. As shown before, the performance of spatial query processing can be improved by decomposing complex spatial objects into simple components. Up to now, only decomposition techniques generating a linear number of very simple components, e.g. triangles or trapezoids, have been considered. In this paper, we will investigate the natural trade-off between the complexity of the components and the redundancy, i.e. the number of components, with respect to its effect on efficient query processing. In particular, we present two new decomposition methods generating a better balance between the complexity and the number of components than previously known techniques. We compare these new decomposition methods to the traditional undecomposed representation as well as to the well-known decomposition into convex polygons with respect to their performance in spatial query processing. This comparison points out that for a wide range of query selectivity the new decomposition techniques clearly outperform both the undecomposed representation and the convex decomposition method. More important than the absolute gain in performance by a factor of up to an order of magnitude is the robust performance of our new decomposition techniques over the whole range of query selectivity

Structural models and structural change: analytical principles and methodological issues

Structural analysis is the main topic of this paper and structural change is a dominant theme of the present work. The analysis of structural models and of theories of structural changes carried out in this paper has a double meaning. On the one hand, it allows to pick up several essential principles that characterize these models, on the other hand, it should allow us to reconsider some important methodological issues under a new light, such as different methods of decomposition of the productive systems, the problem of complexity and the strategies to reduce complexity. Moreover, the paper tries to compare Quesnay’s Tableau, taken as a benchmark model, with Leontief’s, von Neumann’s and Sraffa’s models to pick up the different features of these models with respect to his theoretical framework and also to identify their characteristics for structural analysis and structural change.

Efficient algorithms for conditional independence inference

The topic of the paper is computer testing of (probabilistic) conditional independence (CI) implications by an algebraic method of structural imsets. The basic idea is to transform (sets of) CI statements into certain integral vectors and to verify by a computer the corresponding algebraic relation between the vectors, called the independence implication. We interpret the previous methods for computer testing of this implication from the point of view of polyhedral geometry. However, the main contribution of the paper is a new method, based on linear programming (LP). The new method overcomes the limitation of former methods to the number of involved variables. We recall/describe the theoretical basis for all four methods involved in our computational experiments, whose aim was to compare the efficiency of the algorithms. The experiments show that the LP method is clearly the fastest one. As an example of possible application of such algorithms we show that testing inclusion of Bayesian network structures or whether a CI statement is encoded in an acyclic directed graph can be done by the algebraic method

Optical Surface Photometry of a Sample of Disk Galaxies. II Structural Components

This work presents the structural decomposition of a sample of 11 disk galaxies, which span a range of different morphological types. The U, B, V, R, and I photometric information given in Paper I (color and color-index images and luminosity, ellipticity, and position-angle profiles) has been used to decide what types of components form the galaxies before carrying out the decomposition. We find and model such components as bulges, disks, bars, lenses and rings.Comment: 14 figures. Accepted for publication in A&