A storage and access architecture for efficient query processing in spatial database systems

Due to the high complexity of objects and queries and also due to extremely large data volumes, geographic database systems impose stringent requirements on their storage and access architecture with respect to efficient query processing. Performance improving concepts such as spatial storage and access structures, approximations, object decompositions and multi-phase query processing have been suggested and analyzed as single building blocks. In this paper, we describe a storage and access architecture which is composed from the above building blocks in a modular fashion. Additionally, we incorporate into our architecture a new ingredient, the scene organization, for efficiently supporting set-oriented access of large-area region queries. An experimental performance comparison demonstrates that the concept of scene organization leads to considerable performance improvements for large-area region queries by a factor of up to 150

Multi-Step Processing of Spatial Joins

Spatial joins are one of the most important operations for combining spatial objects of several relations. In this paper, spatial join processing is studied in detail for extended spatial objects in twodimensional data space. We present an approach for spatial join processing that is based on three steps. First, a spatial join is performed on the minimum bounding rectangles of the objects returning a set of candidates. Various approaches for accelerating this step of join processing have been examined at the last year’s conference [BKS 93a]. In this paper, we focus on the problem how to compute the answers from the set of candidates which is handled by the following two steps. First of all, sophisticated approximations are used to identify answers as well as to filter out false hits from the set of candidates. For this purpose, we investigate various types of conservative and progressive approximations. In the last step, the exact geometry of the remaining candidates has to be tested against the join predicate. The time required for computing spatial join predicates can essentially be reduced when objects are adequately organized in main memory. In our approach, objects are first decomposed into simple components which are exclusively organized by a main-memory resident spatial data structure. Overall, we present a complete approach of spatial join processing on complex spatial objects. The performance of the individual steps of our approach is evaluated with data sets from real cartographic applications. The results show that our approach reduces the total execution time of the spatial join by factors

Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently

$\newcommand{\dist}{\operatorname{dist}}$ In this paper we define the notion of a probabilistic neighborhood in spatial data: Let a set $P$ of $n$ points in $\mathbb{R}^d$, a query point $q \in \mathbb{R}^d$, a distance metric \dist, and a monotonically decreasing function $f : \mathbb{R}^+ \rightarrow [0,1]$ be given. Then a point $p \in P$ belongs to the probabilistic neighborhood $N(q, f)$ of $q$ with respect to $f$ with probability f(\dist(p,q)). We envision applications in facility location, sensor networks, and other scenarios where a connection between two entities becomes less likely with increasing distance. A straightforward query algorithm would determine a probabilistic neighborhood in $\Theta(n\cdot d)$ time by probing each point in $P$. To answer the query in sublinear time for the planar case, we augment a quadtree suitably and design a corresponding query algorithm. Our theoretical analysis shows that -- for certain distributions of planar $P$ -- our algorithm answers a query in $O((|N(q,f)| + \sqrt{n})\log n)$ time with high probability (whp). This matches up to a logarithmic factor the cost induced by quadtree-based algorithms for deterministic queries and is asymptotically faster than the straightforward approach whenever $|N(q,f)| \in o(n / \log n)$. As practical proofs of concept we use two applications, one in the Euclidean and one in the hyperbolic plane. In particular, our results yield the first generator for random hyperbolic graphs with arbitrary temperatures in subquadratic time. Moreover, our experimental data show the usefulness of our algorithm even if the point distribution is unknown or not uniform: The running time savings over the pairwise probing approach constitute at least one order of magnitude already for a modest number of points and queries.Comment: The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-44543-4_3

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

Colloidal CuFeS2 Nanocrystals: Intermediate Fe d-Band Leads to High Photothermal Conversion Efficiency

We describe the colloidal hot-injection synthesis of phase-pure nanocrystals (NCs) of a highly abundant mineral, chalcopyrite (CuFeS2). Absorption bands centered at around 480 and 950 nm, spanning almost the entire visible and near infrared regions, encompass their optical extinction characteristics. These peaks are ascribable to electronic transitions from the valence band (VB) to the empty intermediate band (IB), located in the fundamental gap and mainly composed of Fe 3d orbitals. Laser-irradiation (at 808 nm) of an aqueous suspension of CuFeS2 NCs exhibited significant heating, with a photothermal conversion efficiency of 49%. Such efficient heating is ascribable to the carrier relaxation within the broad IB band (owing to the indirect VB-IB gap), as corroborated by transient absorption measurements. The intense absorption and high photothermal transduction efficiency (PTE) of these NCs in the so-called biological window (650-900 nm) makes them suitable for photothermal therapy as demonstrated by tumor cell annihilation upon laser irradiation. The otherwise harmless nature of these NCs in dark conditions was confirmed by in vitro toxicity tests on two different cell lines. The presence of the deep Fe levels constituting the IB is the origin of such enhanced PTE, which can be used to design other high performing NC photothermal agents.Comment: 12 pages, Chemistry of Materials, 31-May-201

Protein kinase Ymr291w/Tda1 is essential for glucose signaling in Saccharomyces cerevisiae on the level of hexokinase isoenzyme ScHxk2 phosphorylation

The enzyme ScHxk2 of Saccharomyces cerevisiae is a dual-function hexokinase that besides its catalytic role in glycolysis is involved in the transcriptional regulation of glucose-repressible genes. Relief from glucose repression is accompanied by the phosphorylation of the nuclear fraction of ScHxk2 at serine 15 and the translocation of the phosphoenzyme into the cytosol. Different studies suggest different serine/threonine protein kinases, Ymr291w/Tda1 or Snf1, to accomplish ScHxk2-S15 phosphorylation. The current paper provides evidence that Ymr291w/Tda1 is essential for that modification while protein kinases Ydr477w/Snf1, Ynl307c/Mck1, Yfr014c/Cmk1 and Ykl126w/Ypk1, which co-purified during Ymr291w/Tda1 tandem affinity purification, as well as protein kinases PKA and PKB homolog Sch9 are dispensable. Taking into account the detection of a significantly higher amount of the Ymr291w/Tda1 protein in cells grown in low-glucose media as compared to a high-glucose environment, Ymr291w/Tda1 is likely to contribute to glucose signaling in Saccharomyces cerevisiae on the level of ScHxk2-S15 phosphorylation in a situation of limited external glucose availability. The evolutionary conservation of amino acid residue serine 15 in yeast hexokinases and its phosphorylation is illustrated by the finding that YMR291W/TDA1 of Saccharomyces cerevisiae and the homologous KLLA0A09713 gene of Kluyveromyces lactis allow for cross-complementation of the respective protein kinase single-gene deletion strains

Electro-responsivity in electrolyte-free and solution processed Bragg stacks

Achieving an active manipulation of colours has huge implications in optoelectronics, as colour engineering can be exploited in a number of applications, ranging from display to lightning. In the last decade, the synergy of the highly pure colours of 1D photonic crystals, also known as Bragg stacks, with electro-tunable materials have been proposed as an interesting route to attain such a technologically relevant effect. However, recent works rely on the use of liquid electrolytes, which can pose issues in terms of chemical and environmental stability. Here, we report on the proof-of-concept of an electrolyte free and solution-processed electro-responsive Bragg stack. We integrate an electro-responsive plasmonic metal oxide, namely indium tin oxide, in a 1D photonic crystal structure made of alternating layers of ITO and TiO2 nanoparticles. In such a device, we observed a maximum of 23 nm blue-shift upon the application of an external bias (10 V). Our data suggest that electrochromism can be attained in all-solid state systems by combining a judicious selection of the constituent materials with device architecture optimisation. This journal i

Model-based probabilistic frequent itemset mining

Data uncertainty is inherent in emerging applications such as location-based services, sensor monitoring systems, and data integration. To handle a large amount of imprecise information, uncertain databases have been recently developed. In this paper, we study how to efficiently discover frequent itemsets from large uncertain databases, interpreted under the Possible World Semantics. This is technically challenging, since an uncertain database induces an exponential number of possible worlds. To tackle this problem, we propose a novel methods to capture the itemset mining process as a probability distribution function taking two models into account: the Poisson distribution and the normal distribution. These model-based approaches extract frequent itemsets with a high degree of accuracy and support large databases. We apply our techniques to improve the performance of the algorithms for (1) finding itemsets whose frequentness probabilities are larger than some threshold and (2) mining itemsets with the {Mathematical expression} highest frequentness probabilities. Our approaches support both tuple and attribute uncertainty models, which are commonly used to represent uncertain databases. Extensive evaluation on real and synthetic datasets shows that our methods are highly accurate and four orders of magnitudes faster than previous approaches. In further theoretical and experimental studies, we give an intuition which model-based approach fits best to different types of data sets. © 2012 The Author(s).published_or_final_versio

Defective Suppressor Function of Human CD4+ CD25+ Regulatory T Cells in Autoimmune Polyglandular Syndrome Type II

In autoimmune polyglandular syndromes (APS), several organ-specific autoimmune diseases are clustered. Although APS type I is caused by loss of central tolerance, the etiology of APS type II (APS-II) is currently unknown. However, in several murine models, depletion of CD4+ CD25+ regulatory T cells (Tregs) causes a syndrome resembling human APS-II with multiple endocrinopathies. Therefore, we hypothesized that loss of active suppression in the periphery could be a hallmark of this syndrome. Tregs from peripheral blood of APS-II, control patients with single autoimmune endocrinopathies, and normal healthy donors showed no differences in quantity (except for patients with isolated autoimmune diseases), in functionally important surface markers, or in apoptosis induced by growth factor withdrawal. Strikingly, APS-II Tregs were defective in their suppressive capacity. The defect was persistent and not due to responder cell resistance. These data provide novel insights into the pathogenesis of APS-II and possibly human autoimmunity in general