La matérialisation de vues est une technique très utilisée dans les systèmes de gestion bases de données ainsi que dans les entrepôts de données pour améliorer les performances des requêtes. Elle permet de réduire de manière considérable le temps de réponse des requêtes en pré-calculant des requêtes coûteuses et en stockant leurs résultats. De ce fait, l'exécution de certaines requêtes nécessite seulement un accès aux vues matérialisées au lieu des données sources. En contrepartie, la matérialisation entraîne un surcoût de maintenance des vues. En effet, les vues matérialisées doivent être mises à jour lorsque les données sources changent afin de conserver la cohérence et l'intégrité des données. De plus, chaque vue matérialisée nécessite également un espace de stockage supplémentaire qui doit être pris en compte au moment de la sélection. Le problème de choisir quelles sont les vues à matérialiser de manière à réduire les coûts de traitement des requêtes étant donné certaines contraintes tel que l'espace de stockage et le coût de maintenance, est connu dans la littérature sous le nom du problème de la sélection de vues. Trouver la solution optimale satisfaisant toutes les contraintes est un problème NP-complet. Dans un contexte distribué constitué d'un ensemble de noeuds ayant des contraintes de ressources différentes (CPU, IO, capacité de l'espace de stockage, bande passante réseau, etc.), le problème de la sélection des vues est celui de choisir un ensemble de vues à matérialiser ainsi que les noeuds du réseau sur lesquels celles-ci doivent être matérialisées de manière à optimiser les coût de maintenance et de traitement des requêtes.Notre étude traite le problème de la sélection de vues dans un environnement centralisé ainsi que dans un contexte distribué. Notre objectif est de fournir une approche efficace dans ces contextes. Ainsi, nous proposons une solution basée sur la programmation par contraintes, connue pour être efficace dans la résolution des problèmes NP-complets et une méthode puissante pour la modélisation et la résolution des problèmes d'optimisation combinatoire. L'originalité de notre approche est qu'elle permet une séparation claire entre la formulation et la résolution du problème. A cet effet, le problème de la sélection de vues est modélisé comme un problème de satisfaction de contraintes de manière simple et déclarative. Puis, sa résolution est effectuée automatiquement par le solveur de contraintes. De plus, notre approche est flexible et extensible, en ce sens que nous pouvons facilement modéliser et gérer de nouvelles contraintes et mettre au point des heuristiques pour un objectif d'optimisation.Les principales contributions de cette thèse sont les suivantes. Tout d'abord, nous définissons un cadre qui permet d'avoir une meilleure compréhension des problèmes que nous abordons dans cette thèse. Nous analysons également l'état de l'art des méthodes de sélection des vues à matérialiser en en identifiant leurs points forts ainsi que leurs limites. Ensuite, nous proposons une solution utilisant la programmation par contraintes pour résoudre le problème de la sélection de vues dans un contexte centralisé. Nos résultats expérimentaux montrent notre approche fournit de bonnes performances. Elle permet en effet d'avoir le meilleur compromis entre le temps de calcul nécessaire pour la sélection des vues à matérialiser et le gain de temps de traitement des requêtes à réaliser en matérialisant ces vues. Enfin, nous étendons notre approche pour résoudre le problème de la sélection de vues à matérialiser lorsque celui-ci est étudié sous contraintes de ressources multiples dans un contexte distribué. A l'aide d'une évaluation de performances extensive, nous montrons que notre approche fournit des résultats de qualité et fiable. / View selection is important in many data-intensive systems e.g., commercial database and data warehousing systems to improve query performance. View selection can be defined as the process of selecting a set of views to be materialized in order to optimize query evaluation. To support this process, different related issues have to be considered. Whenever a data source is changed, the materialized views built on it have to be maintained in order to compute up-to-date query results. Besides the view maintenance issue, each materialized view also requires additional storage space which must be taken into account when deciding which and how many views to materialize.The problem of choosing which views to materialize that speed up incoming queries constrained by an additional storage overhead and/or maintenance costs, is known as the view selection problem. This is one of the most challenging problems in data warehousing and it is known to be a NP-complete problem. In a distributed environment, the view selection problem becomes more challenging. Indeed, it includes another issue which is to decide on which computer nodes the selected views should be materialized. The view selection problem in a distributed context is now additionally constrained by storage space capacities per computer node, maximum global maintenance costs and the communications cost between the computer nodes of the network.In this work, we deal with the view selection problem in a centralized context as well as in a distributed setting. Our goal is to provide a novel and efficient approach in these contexts. For this purpose, we designed a solution using constraint programming which is known to be efficient for the resolution of NP-complete problems and a powerful method for modeling and solving combinatorial optimization problems. The originality of our approach is that it provides a clear separation between formulation and resolution of the problem. Indeed, the view selection problem is modeled as a constraint satisfaction problem in an easy and declarative way. Then, its resolution is performed automatically by the constraint solver. Furthermore, our approach is flexible and extensible, in that it can easily model and handle new constraints and new heuristic search strategies for optimization purpose. The main contributions of this thesis are as follows. First, we define a framework that enables to have a better understanding of the problems we address in this thesis. We also analyze the state of the art in materialized view selection to review the existing methods by identifying respective potentials and limits. We then design a solution using constraint programming to address the view selection problem in a centralized context. Our performance experimentation results show that our approach has the ability to provide the best balance between the computing time to be required for finding the materialized views and the gain to be realized in query processing by materializing these views. Our approach will also guarantee to pick the optimal set of materialized views where no time limit is imposed. Finally, we extend our approach to provide a solution to the view selection problem when the latter is studied under multiple resource constraints in a distributed context. Based on our extensive performance evaluation, we show that our approach outperforms the genetic algorithm that has been designed for a distributed setting.

" Materialized integration views constructed by integrating data from multiple distributed data sources help to achieve better access, reliable performance, and high availability for a wide range of applications. In this dissertation, we propose parallel, adaptive, and grouping techniques to address scalability challenges in high-performance integration view computation and maintenance due to increasingly large data sources and high rates of source updates. State-of-the-art parallel integration view computation makes the common assumption that the maximal pipelined parallelism leads to superior performance. We instead propose segmented bushy parallel processing that combines pipelined parallelism with alternate forms of parallelism to achieve an overall more effective strategy. Experimental studies conducted over a cluster of high-performance PCs confirm that the proposed strategy has an on average of 50\% improvement in terms of total processing time in comparison to existing solutions. Run-time adaptation becomes critical for parallel integration view computation due to its long running and memory intensive nature. We investigate two types of state level adaptations, namely, state spill and state relocation, to address the run-time memory shortage. We propose lazy-disk and active-disk approaches that integrate both adaptations to maximize run-time query throughput in a memory constrained environment. We also propose global throughput-oriented state adaptation strategies for computation plans with multiple state intensive operators. Extensive experiments confirm the effectiveness of our proposed adaptation solutions. Once results have been computed and materialized, it's typically more efficient to maintain them incrementally instead of full recomputation. However, state-of-the-art incremental view maintenance require O($n^2$) maintenance queries with n being the number of data sources that the view is defined upon. Moreover, they do not exploit view definitions and data source processing capabilities to further improve view maintenance performance. We propose novel grouping maintenance algorithms that dramatically reduce the number of maintenance queries to (O(n)). A cost-based view maintenance framework has been proposed to generate optimized maintenance plans tuned to particular environmental settings. Extensive experimental studies verify the effectiveness of our maintenance algorithms as well as the maintenance framework. "

The purpose of the present dissertation is to examine the placing of the housing question on the agenda of social policy, the implications of housing for society, and the possibilities for simple shelter to be transformed into real family homes. The debate emphasizing the dwelling as the smallest social component and the home as the most important place for the raising of citizens has been studied. The dissertation consists of four essays, each of which can be seen as a separate study yet at the same time as interrelated due to the overall theme of the dissertation, housing and the home. The period under investigation is 1889-1929 and the place is Stockholm. The first section deals with philanthropic building activities, described through four representative examples: Föreningen för Välgörenhetens Ordnande, Stockholms Arbetarehem, Govenii Minne and Ella Heckscher's home for tubercular female workers. This section opens with two introductory chapters treating the philanthropic attitude toward housing and the relation of the family to the housing question, respectively. The theme of the second section is the significance of aesthetics for the home. This section also opens with two introductory chapters, whereof the first describes the aesthetic ideals of the epoch and the second presents the so-called "aesthetic educators". A number of pamphlets written about the home are discussed, as well as a selection from the home exhibitions of the day. In a closing chapter, the entrance of the architects into the housing-question arena is presented. The third study deals with politics in the broad sense of the term. The interest of social reformers for the housing question is traced by examining organizations like Studenter och Arbetare and Centralförbundet för Socialt Arbete. The second chapter deals with the contributions of academics to the housing question. The social democratic women belonging to the Stockholm's Women's Club are heard from, and the engagement of women in this question is further delineated through studying periodicals like Morgonbris and Tidevarvet. In the closing chapter, the establishment and treatment of the housing question within the municipal council of Stockholm is discussed. The fourth and final section treats the HSB. First, the origins of the HSB in 1923 via the tenant's movement and guild socialism are discussed. Thereafter the organization and membership of the HSB is described. A brief biography of Sven Wallander, the leading figure of the HSB is provided, followed by a chapter on the periodical Vår Bostad. The final two chapters discuss the materialized ideas themselves: the buildings built by the HSB and the homes which were set up in them, stimulated by the actual physical buildings and discussions about the right way of living in them. The story of the home has solid empirical grounding. This study has been conducted from different perspectives in order that a more nuanced knowledge might be acquired. Vision and practice have proven to be so closely interwoven that it is not always possible to distinguish between them. / digitalisering@umu

Data is being published in digital formats at very high rates nowadays. A large share of this data has complex structure, typically organized as trees (Web documents such as HTML and XML being the most representative) or graphs (in particular, graph-structured Semantic Web databases, expressed in RDF). There is great interest in exploiting such complex data, whether in an Open Data access model or within companies owning it, and efficiently doing so for large data volumes remains challenging. Materialized views have long been used to obtain significant performance improvements when processing queries. The principle is that a view stores pre-computed results that can be used to evaluate (possibly part of) a query. Adapting materialized view techniques to the Web data setting we consider is particularly challenging due to the structural and semantic complexity of the data. This thesis tackles two problems in the broad context of materialized view-based management of Web data. First, we focus on the problem of view selection for RDF query workloads. We present a novel algorithm, which, based on a query workload, proposes the most appropriate views to be materialized in the database, in order to minimize the combined cost of query evaluation, view maintenance and view storage. Although RDF query workloads typically feature many joins, hampering the view selection process, our algorithm scales to hundreds of queries, a number unattained by existing approaches. Furthermore, we propose new techniques to account for the implicit data that can be derived by the RDF Schemas and which further complicate the view selection process. The second contribution of our work concerns query rewriting based on materialized XML views. We start by identifying an expressive dialect of XQuery, corresponding to tree patterns with value joins, and study some important properties for these queries, such as containment and minimization. Based on these notions, we consider the problem of finding minimal equivalent rewritings of a query expressed in this dialect, using materialized views expressed in the same dialect, and provide a sound and complete algorithm for that purpose. Our work extends the state of the art by allowing each pattern node to return a set of attributes, supporting value joins in the patterns, and considering rewritings which combine many views. Finally, we show how our view-based query rewriting algorithm can be applied in a distributed setting, in order to efficiently disseminate corpora of XML documents carrying RDF annotations.

La forte volumétrie des données décrites par des ontologies a conduit à la naissance des basesde données à base ontologique (BDBO). Plusieurs communautés se sont intéressées à cette technologieet ont proposé des solutions pour persister les données sémantiques dans des SGBD.Parallèlement, la conception physique est devenue une étape primordiale dans le cycle de viede conception des bases de données (BD). Durant cette phase, des structures d’optimisation sontsélectionnées. Si de nombreux travaux ont été menés sur la conception physique dans le contexte desBD traditionnelles, peu se sont intéressés à la conception physique dans les BDBO qui est pluscomplexe. Cette complexité est due à la diversité des BDBO qui porte sur des formalismes supportés,des modèles de stockage et des architectures utilisés.Pour guider la sélection des structures d’optimisation et mesurer sa qualité, nous avonsdéveloppé un modèle de coût pour estimer le coût des requêtes dans les BDBO. Les résultatsthéoriques sont confrontés avec les résultats pratiques obtenus à partir de six BDBO dont troisindustrielles (Oracle et IBM SOR, DB2RDF) et trois académiques (Jena, Sesame et OntoDB du LIASde l'ISAE-ENSMA). Ce modèle de coût a été utilisé dans le processus de sélection des vuesmatérialisées. Nous avons proposé deux approches de matérialisation : une approche conceptuelle oùla sélection des vues matérialisées est faite sur les classes et les propriétés utilisées par les requêtes etune approche simulée où la sélection prend en compte la diversité des BDBO. Des expérimentationsont été conduites pour évaluer la qualité de nos approches en les confrontant avec les principauxtravaux existants / The high volume of data described by ontologies led to the creation of Ontology-BasedDatabase (OBDB). Many communities are interested in this technology and have proposed solutionsto persist semantic data in DBMS.Meanwhile, the physical design has become an essential step in the life cycle of databasedesign, in which optimization structures are selected. While many studies have been conducted on thephysical design in the context of traditional databases, few have focused on the physical design inOBDB which is more complex. This complexity is due to the diversity of OBDB which focuses onformalisms supported, storage models and architectures used.To guide the selection of optimization structures, we have developed a cost model to estimatethe cost of queries in OBDB. The theoretical results are compared with the practical results obtainedfrom six OBDB including three industrial (Oracle, IBM SOR and DB2RDF) and three academic (Jena,Sesame and OntoDB of the LIAS Lab of ISAE-ENSMA). This cost model was used in thematerialized views selection process. We proposed two approaches of materialized views selection: aconceptual approach where the selection of materialized views is made on the classes and propertiesused by queries and a simulated approach where the selection takes into account the diversity ofOBDB. Experiments were conducted to evaluate the quality of our approaches and compare them withthe main existing work

[pt] Enquanto muitos trabalhos de pesquisa propõem uma forma de listar um conjunto de opções de sintonia fina para uma determinada carga de trabalho, poucos oferecem uma maneira de ajudar o DBA a tomar melhores decisões ao encontrar um conjunto de ações disponíveis. TuningChef é o resultado do desenvolvimento de uma proposta do passo a passo desse processo de decisão. Dado um conjunto de opções de sintonia fina, recomendamos um subconjunto com boa proporção de custo-benefício, com contexto suficiente para que o DBA entenda a motivação por trás de cada decisão, incluindo a possibilidade de deixar o usuário construir seu próprio subconjunto e verificar o impacto esperado. Também são apresentados resultados experimentais que demonstram a importância do processo de decisão, onde dentro de um subconjunto de 50+ ações de sintonia fina sugeridas por uma ferramenta externa, apenas 8 mostram-se como benéficas para a carga de trabalho utilizada. / [en] While many research works propose a way to list a set of fine-tuning options for a given workload, only a few offer a way to help the DBA make better decisions when encountering a set of available options, especially when taking his possibilities into consideration. We propose and develop a step-by-step decision process. Given a set of fine-tuning options, we recommend a subset with good cost-benefit proportion. Enough context for the DBA accompanies the recommendation to understand its reasoning, with the possibility of letting the user build his own subset and check the expected impact. Some experimental results are also described, showing the importance of the decision step when fine tuning a database, where in a set on 50+ fine tuning actions suggested by an external tool, only 8 are considered beneficial for the a specific workload.

No description available.

De nos jours, des masses de données sont publiées à grande échelle dans des formats numériques. Une part importante de ces données a une structure complexe, typiquement organisée sous la forme d'arbres (les documents du web, comme HTML et XML, étant les plus représentatifs) ou de graphes (en particulier, les bases de données du Web Sémantique structurées en graphes, et exprimées en RDF). Exploiter ces données complexes, qu'elles soient dans un format d'accès Open Data ou bien propriétaire (au sein d'une compagnie), présente un grand intérêt. Le faire de façon efficace pour de grands volumes de données reste encore un défi. Les vues matérialisées sont utilisées depuis longtemps pour améliorer considérablement l'évaluation des requêtes. Le principe est q'une vue stocke des résultats pre-calculés qui peuvent être utilisés pour évaluer (une partie d') une requête. L'adoption des techniques de vues matérialisées dans le contexte de données du web que nous considérons est particulièrement exigeante à cause de la complexité structurelle et sémantique des données. Cette thèse aborde deux problèmes liés à la gestion des données du web basée sur des vues matérialisées. D'abord, nous nous concentrons sur le problème de sélection des vues pour des ensembles de requêtes RDF. Nous présentons un algorithme original qui, basé sur un ensemble de requêtes, propose les vues les plus appropriées à matérialiser dans la base des données. Ceci dans le but de minimiser à la fois les coûts d'évaluation des requêtes, de maintenance et de stockage des vues. Bien que les requêtes RDF contiennent typiquement un grand nombre de jointures, ce qui complique le processus de sélection de vues, notre algorithme passe à l'échelle de centaines de requêtes, un nombre non atteint par les méthodes existantes. En outre, nous proposons des techniques nouvelles pour tenir compte des données implicites qui peuvent être dérivées des schémas RDF sans complexifier davantage la sélection des vues. La deuxième contribution de notre travail concerne la réécriture de requêtes en utilisant des vues matérialisées XML. Nous commençons par identifier un dialecte expressif de XQuery, correspondant aux motifs d'arbres avec des jointures sur la valeur, et nous étudions des propriétés importantes de ces requêtes, y compris l'inclusion et la minimisation. En nous fondant sur ces notions, nous considérons le problème de trouver des réécritures minimales et équivalentes d'une requête exprimée dans ce dialecte, en utilisant des vues matérialisées exprimées dans le même dialecte, et nous fournissons un algorithme correct et complet à cet effet. Notre travail dépasse l'état de l'art en permettant à chaque motif d'arbre de renvoyer un ensemble d'attributs, en prenant en charge des jointures sur la valeur entre les motifs, et en considérant des réécritures qui combinent plusieurs vues. Enfin, nous montrons comment notre méthode de réécriture peut être appliquée dans un contexte distribué, pour la dissémination efficace d'un corpus de documents XML annotés en RDF. / Data is being published in digital formats at very high rates nowadays. A large share of this data has complex structure, typically organized as trees (Web documents such as HTML and XML being the most representative) or graphs (in particular, graph-structured Semantic Web databases, expressed in RDF). There is great interest in exploiting such complex data, whether in an Open Data access model or within companies owning it, and efficiently doing so for large data volumes remains challenging. Materialized views have long been used to obtain significant performance improvements when processing queries. The principle is that a view stores pre-computed results that can be used to evaluate (possibly part of) a query. Adapting materialized view techniques to the Web data setting we consider is particularly challenging due to the structural and semantic complexity of the data. This thesis tackles two problems in the broad context of materialized view-based management of Web data. First, we focus on the problem of view selection for RDF query workloads. We present a novel algorithm, which, based on a query workload, proposes the most appropriate views to be materialized in the database, in order to minimize the combined cost of query evaluation, view maintenance and view storage. Although RDF query workloads typically feature many joins, hampering the view selection process, our algorithm scales to hundreds of queries, a number unattained by existing approaches. Furthermore, we propose new techniques to account for the implicit data that can be derived by the RDF Schemas and which further complicate the view selection process. The second contribution of our work concerns query rewriting based on materialized XML views. We start by identifying an expressive dialect of XQuery, corresponding to tree patterns with value joins, and study some important properties for these queries, such as containment and minimization. Based on these notions, we consider the problem of finding minimal equivalent rewritings of a query expressed in this dialect, using materialized views expressed in the same dialect, and provide a sound and complete algorithm for that purpose. Our work extends the state of the art by allowing each pattern node to return a set of attributes, supporting value joins in the patterns, and considering rewritings which combine many views. Finally, we show how our view-based query rewriting algorithm can be applied in a distributed setting, in order to efficiently disseminate corpora of XML documents carrying RDF annotations.

Dans un monde globalisé, les territoires de la périphérie du monde entrent dans un processus de changement continuel sous les contraintes de multiples acteurs, transnationaux, étatiques et locaux. Cette thèse s’est fixée comme objectif de révéler la spatialité de ces changements ainsi que les jeux d’acteurs qui y contribuent dans le cas de la Bolivie. Les hypothèses, qui postulent un irréversible processus d’autonomisation des territoires, ont résisté à l’épreuve des faits : les bouleversements politiques et sociaux intervenus pendant la période de la réalisation de ce projet. La thèse présente d’abord un positionnement épistémologique qui propose d’articuler l’espace et ses acteurs dans une perspective modélisatrice. Elle expose ensuite un cadre systémique de mise en cohérence des éléments de structuration et de changement territorial qui place, au centre, un système idéel construit à partir des signaux échangés par les acteurs afin de maîtriser ce changement territorial : signaux de domination, de pression ou de séduction engendrant des relations d’exploitation, de conflits ou de coopération. Ce système idéel est relié à des sous-systèmes matérialisés (organisation politico-administrative, système de villes et espaces de l’économie) qui subissent l’impact des changements étudiés. En effet, les politiques territoriales sont les rétroactions d’un tel système. Le traitement de chaque sous-système matérialisé correspond à un changement d’échelle géographique. Les modèles spatiaux à base de chronochorèmes complètent l’étude dynamique du changement. Ces choix méthodologiques permettent une lecture géographique des résultats suivants : - L'efficacité des mouvements sociaux réside moins dans la matrice sectorielle et professionnelle que dans leur assise territoriale .-L'État concentre ses réformes sur le sous-système matérialisé de l'organisation politico-administrative car il semble n'avoir prise ni sur le système des villes, ni sur les espaces et territoires de l'économie. Il n'est jamais parvenu jusqu'à présent à un accord qui lui aurait permis d'équilibrer dépenses sociales et investissements productifs. Un consensus social devra également être trouvé pour rendre viable un État plurinational. L'État concentre sur lui la majorité des signaux et établit ses politiques territoriales en fonction de leur pression. - La toute puissance technologique et financière des acteurs transnationaux se heurtent à l’efficacité des mouvements sociaux. Toutefois, ces acteurs restent à terme des pièces importantes d’un jeu où , pourvoyeurs d’activité et d’emplois, ils continueront à produire de l’espace et à consommer des territoires / In a globalized world, satellite territories undergo continual change process constrained by multiple, transnational, public and local actors. This thesis aims to reveal the spatiality of these changes as well as the sets of actors who contributed to it in Bolivia. The assumptions, which assume an irreversible process of empowering territories, have withstood the proof of facts : political and social upheavals occurred during the period of the realization of this project. The thesis starts with epistemological considerations which propose to articulate space and its actors in a modeling approach. Then the thesis presents a systemic conceptual framework providing coherence within territorial structuration and changes which focus on a system built from the signals exchanged by the actors to control this territorial change : signals of domination, pressure or seduction, generating relation of exploitation, adversarial or cooperation. This conceptual system is connected to effective subsystems (politico-administrative organization, system of cities and territories of the economy) which undergo the impact of the studied changes. Indeed, territorial policies are the results of the feedbacks of such a system. Dealing with each effective subsystem needs to focus on different geographical scales. The spatial models containing chronochorèmes supplement the dynamic study of the change. This methodological approach allows a geographical reading of the following results : - Social movements’ efficiency is better explained by its territorial origin than the sectoral and professional matrix. - The government focuses its reforms on the politico-administrative sub-system because it seems not to have stranglehold either on the system of cities, or on economics territories. Until now, it never managed to achieve an agreement which would have enabled to balance welfare expenditures and productive investments. A social consensus will have also to be found to make viable a multinational nation. The nation concentrates the majority of the signals and establishes its territorial policies according to their pressure. - The technological and financial all-power of the transnational actors face up to the effectiveness of social movements. However, these actors remain in the long term important providers of activity and employment and will continue to produce space and to consume territories

This project report offers an in-depth, detailed account of my creative process and work during my two-year Master in visual communication at Konstfack, Stockholm. My degree project is a celebration of plurality and visual democracy. Starting with identifying different norms pervading the graphic design discipline in the Western world today, both in terms of aesthetic values and systems of thinking, I have worked to propose and visualize alternative possible futures.  Drawing has been my main carrier through an intense journey of un-learning and re-learning resulting in an artist’s book in unique copy.  With this book, I want to problematize the dominant discourses around objectivity as a utopian ideal with a suppressive agenda, while visualizing a world I can recognize myself in. I have used decoration as a method, emotion and femininity as explorative standpoints, giving space to the metaphorical, the ambiguous and the spiritual to challenge current visual norms.  This book emerges as an affirmation of my own quest for visual belonging  as a graphic designer and a woman; a testimony of the practice of drawing as actualized power.