[EN] The objective pursued with this work has been to develop a methodology for designing storage systems, also offering the necessary mathematical tools for decision -making. It is for these reasons that this thesis has achieved the following purposes: 1- Define a series of steps in the design of storage systems. 2- In each of the steps, establish the criteria to be taken into account in making decisions that improve the design. 3- Determine the variables to consider and the relationship between these that defines the possible solutions reached, so that all possible combinations in the design of stores, some are discarded by physical impossibilities. 4- Develop mathematical tools such as experimental algorithm defined in this paper that allow the choice of the best possible solutions. 5- Determining procedures for verifying that the solution adopted corresponds to the objectives and followed the established restrictions. 6- Validate the methodology and experimental algorithm defined with the application to a real case study , which has helped define the best posible design constrainted to some objectives and real restrictions with the goal of satisfying the needs expressed . Thus, the gap in the literature related to the design of storage systems can be covered with the contribution made by this work that may enable those experts in this field, relying on the use of it to continue advancing in the complex world of designing storage systems. / [ES] El objetivo perseguido con el presente trabajo ha sido el de desarrollar una metodología de diseño de sistemas almacenamiento, ofreciendo igualmente las herramientas matemáticas necesarias para la toma de decisiones. Es por todo ello que con la presente tesis se han conseguido alcanzar los siguientes propósitos: 1- Definir una serie de pasos a seguir en el diseño de sistemas de almacenamiento. 2- En cada uno de los pasos descritos, establecer los criterios a tener a en cuenta para la toma de decisiones que permiten avanzar en el diseño del mismo. 3- Determinar las variables a tener en cuenta y como la relación entre estas mismas define las soluciones posibles alcanzadas, de forma que de todas las posibles combinaciones posibles en el diseño de almacenes, algunas se descartan por imposibilidades físicas. 4- Desarrollar herramientas matemáticas como el algoritmo de experimentación definido en el presente trabajo que permitan la elección de las mejores soluciones posibles. 5- Determinación de procedimientos de comprobación de que la solución adoptada corresponde con los objetivos perseguidos y se ajusta a las restricciones establecidas. 6- Validar la metodología y el algoritmo de experimentación definidos con la aplicación a un caso práctico real, que ha permitido definir el mejor diseño posible ajustado a unos objetivos y restricciones reales para satisfacer las necesidades planteadas. De esta forma, el vacío existente en la literatura relacionada con el diseño de sistemas de almacenamiento puede ser cubierto con la aportación realizada por el presente trabajo que pueda permitir a los expertos en este campo, apoyarse en la utilización de la misma para seguir avanzando en el complejo mundo del diseño de sistemas de almacenamiento. / [CA] L'objectiu perseguit amb el present treball ha sigut el de desenvolupar una metodologia de disseny de sistemes emmagatzematge, oferint igualment les eines matemàtiques necessàries per a la presa de decisions. És per tot això que amb la present tesi s'han aconseguit assolir els següents propòsits : 1- Definir una sèrie de passos a seguir en el disseny de sistemes de emmagatzematge. 2- En cada un dels passos descrits, establir els criteris a tindre en compte per a la pressa de decisions que permeten avançar en el disseny del mateix. 3- Determinar les variables a tenir en compte i com la relació entre aquestes mateixes defineix les solucions possibles aconseguides, de manera que de totes les possibles combinacions possibles en el disseny de magatzems, algunes es descarten per impossibilitats físiques. 4- Desenvolupar eines matemàtiques com l'algoritme d'experimentació definit en el present treball que permetin l'elecció de les millors solucions possibles. 5- Determinació de procediments de comprovació que la solució adoptada correspon amb els objectius perseguits i s'ajusta a les restriccions establertes. 6- Validar la metodologia i l'algoritme d'experimentació definits amb l'aplicació a un cas pràctic real , que ha permès definir un el millor disseny posible ajustat a uns objectius i restriccions reals per satisfer les necessitats plantejades . D'aquesta manera , el buit existent en la literatura relacionada amb el disseny de sistemes d'emmagatzematge pot ser cobert amb l'aportació realitzada pel present treball que pugui permetre als experts en aquest camp , recolzar-se en la utilització de la mateixa per seguir avançant en el complex món del disseny de sistemes d'emmagatzematge. / Devis Gallego, S. (2016). Una metodología para el diseño estratégico de almacenes de reserva basada en la selección de tecnologías y políticas de gestión [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/61444

Data warehouses (DWs) have traditionally been loaded with data at regular time intervals, e.g., monthly, weekly, or daily, using fast bulk loading techniques. Recently, the trend is to insert all (or only some) new source data very quickly into DWs, called near-realtime DWs (right-time DWs). This is done using regular INSERT statements, resulting in too low insert speeds. There is thus a great need for a solution that makes inserted data available quickly, while still providing bulk-load insert speeds. This paper presents RiTE ('Right-Time ETL'), a middleware system that provides exactly that. A data producer (ETL) can insert data that becomes available to data consumers on demand. RiTE includes an innovative main-memory based catalyst that provides fast storage and offers concurrency control. A number of policies controlling the bulk movement of data based on user requirements for persistency, availability, freshness, etc. are supported. The system works transparently to both producer and consumers. The system is integrated with an open source DBMS, and experiments show that it provides 'the best of both worlds', i.e., INSERT-like data availability, but with bulk-load speeds (up to 10 times faster).

So far the optimization of integration processes between heterogeneous data sources is still an open challenge. A first step towards sufficient techniques was the specification of a universal benchmark for integration systems. This DIPBench allows to compare solutions under controlled conditions and would help generate interest in this research area. However, we see the requirement for providing a sophisticated toolsuite in order to minimize the effort for benchmark execution. This demo illustrates the use of the DIPBench toolsuite. We show the macro-architecture as well as the micro-architecture of each tool. Furthermore, we also present the first reference benchmark implementation using a federated DBMS. Thereby, we discuss the impact of the defined benchmark scale factors. Finally, we want to give guidance on how to benchmark other integration systems and how to extend the toolsuite with new distribution functions or other functionalities.

Automatic summary tables (ASTs), more commonly known as materialized views, are widely used to enhance query performance, particularly for aggregate queries. Such queries access a huge number of rows to retrieve aggregated summary data while performing multiple joins in the context of a typical data warehouse star schema. To keep ASTs consistent with their underlying base data, the ASTs are either immediately synchronized or fully recomputed. This paper proposes an optimization strategy for simultaneously refreshing multiple ASTs, thus avoiding multiple scans of a large fact table (one pass for AST computation). A query stacking strategy detects common sub-expressions using the available query matching technology of DB2. Since exact common sub-expressions are rare, the novel query sharing approach systematically generates common subexpressions for a given set of 'related' queries, considering different predicates, grouping expressions, and sets of base tables. The theoretical framework, a prototype implementation of both strategies in the IBM DB2 UDB/UWO database system, and performance evaluations based on the TPC/R data schema are presented in this paper.

Data marts storing pre-aggregated data, prepared for further roll-ups, play an essential role in data warehouse environments and lead to significant performance gains in the query evaluation. However, in order to ensure the completeness of query results on the data mart without to access the underlying data warehouse, null values need to be stored explicitly; this process is denoted as negative caching. Such null values typically occur in multidimensional data sets, which are naturally very sparse. To our knowledge, there is no work on shrinking the null tuples in a multi-dimensional data set within ROLAP. For these tuples, we propose a lossless compression technique, leading to a dramatic reduction in size of the data mart. Queries depending on null value information can be answered with 100% precision by partially inflating the shrunken data mart. We complement our analytical approach with an experimental evaluation using real and synthetic data sets, and demonstrate our results.

The purpose of this study was to develop a weighted application blank (WAB) which would aid in the selection of employees who would be more likely to remain on the job for 3 months or more. The 31 biographical items for long- and short-tenure employees were compared to see which items differentiated. A somewhat improvised approach which compared trends of both groups (weighting group N = 169, holdout group N 89), produced five items which were significant at the .05 level and resulted in a 70% improvement over the previous method of selection. The long-tenure employee could be described as a slightly older (20 years or more) married person who lives close to the job, less educated (8th grade or less), and who can list three references.

Spatial data warehouses (SDW) and spatial online analytical processing (SOLAP) enhance decision making by enabling spatial analysis combined with multidimensional analytical queries. A SDW is an integrated and voluminous multidimensional database containing both conventional and spatial data. SOLAP allows querying SDWs with multidimensional queries that select spatial data that satisfy a given topological relationship and that aggregate spatial data. Existing SDW and SOLAP applications mostly consider phenomena represented by spatial data having exact locations and sharp boundaries. They neglect the fact that spatial data may be affected by imperfections, such as spatial vagueness, which prevents distinguishing an object from its neighborhood. A vague spatial object does not have a precisely defined boundary and/or interior. Thus, it may have a broad boundary and a blurred interior, and is composed of parts that certainly belong to it and parts that possibly belong to it. Although several real-world phenomena are characterized by spatial vagueness, no approach in the literature addresses both spatial vagueness and the design of SDWs nor provides multidimensional analysis over vague spatial data. These shortcomings motivated the elaboration of this doctoral thesis, which addresses both vague spatial data warehouses (vague SDWs) and vague spatial online analytical processing (vague SOLAP). A vague SDW is a SDW that comprises vague spatial data, while vague SOLAP allows querying vague SDWs. The major contributions of this doctoral thesis are: (i) the Vague Spatial Cube (VSCube) conceptual model, which enables the creation of conceptual schemata for vague SDWs using data cubes; (ii) the Vague Spatial MultiDim (VSMultiDim) conceptual model, which enables the creation of conceptual schemata for vague SDWs using diagrams; (iii) guidelines for designing relational schemata and integrity constraints for vague SDWs, and for extending the SQL language to enable vague SOLAP; (iv) the Vague Spatial Bitmap Index (VSB-index), which improves the performance to process queries against vague SDWs. The applicability of these contributions is demonstrated in two applications of the agricultural domain, by creating conceptual schemata for vague SDWs, transforming these conceptual schemata into logical schemata for vague SDWs, and efficiently processing queries over vague SDWs. / Les entrepôts de données spatiales (EDS) et l'analyse en ligne spatiale (ALS) améliorent la prise de décision en permettant l'analyse spatiale combinée avec des requêtes analytiques multidimensionnelles. Un EDS est une base de données multidimensionnelle intégrée et volumineuse qui contient des données classiques et des données spatiales. L'ALS permet l'interrogation des EDS avec des requêtes multidimensionnelles qui sélectionnent des données spatiales qui satisfont une relation topologique donnée et qui agrègent les données spatiales. Les EDS et l'ALS considèrent essentiellement des phénomènes représentés par des données spatiales ayant une localisation exacte et des frontières précises. Ils négligent que les données spatiales peuvent être affectées par des imperfections, comme l'imprécision spatiale, ce qui empêche de distinguer précisément un objet de son entourage. Un objet spatial vague n'a pas de frontière et/ou un intérieur précisément définis. Ainsi, il peut avoir une frontière large et un intérieur flou, et est composé de parties qui lui appartiennent certainement et des parties qui lui appartiennent éventuellement. Bien que plusieurs phénomènes du monde réel sont caractérisés par l'imprécision spatiale, il n'y a pas dans la littérature des approches qui adressent en même temps l'imprécision spatiale et la conception d'EDS ni qui fournissent une analyse multidimensionnelle des données spatiales vagues. Ces lacunes ont motivé l'élaboration de cette thèse de doctorat, qui adresse à la fois les entrepôts de données spatiales vagues (EDS vagues) et l'analyse en ligne spatiale vague (ALS vague). Un EDS vague est un EDS qui comprend des données spatiales vagues, tandis que l'ALS vague permet d'interroger des EDS vagues. Les contributions majeures de cette thèse de doctorat sont: (i) le modèle conceptuel Vague Spatial Cube (VSCube), qui permet la création de schémas conceptuels pour des EDS vagues à l'aide de cubes de données; (ii) le modèle conceptuel Vague Spatial MultiDim (VSMultiDim), qui permet la création de schémas conceptuels pour des EDS vagues à l'aide de diagrammes; (iii) des directives pour la conception de schémas relationnels et des contraintes d'intégrité pour des EDS vagues, et pour l'extension du langage SQL pour permettre l'ALS vague; (iv) l'indice Vague Spatial Bitmap (VSB-index) qui améliore la performance pour traiter les requêtes adressées à des EDS vagues. L'applicabilité de ces contributions est démontrée dans deux applications dans le domaine agricole, en créant des schémas conceptuels des EDS vagues, la transformation de ces schémas conceptuels en schémas logiques pour des EDS vagues, et le traitement efficace des requêtes sur des EDS vagues. / O data warehouse espacial (DWE) é um banco de dados multidimensional integrado e volumoso que armazena dados espaciais e dados convencionais. Já o processamento analítico-espacial online (SOLAP) permite consultar o DWE, tanto pela seleção de dados espaciais que satisfazem um relacionamento topológico, quanto pela agregação dos dados espaciais. Deste modo, DWE e SOLAP beneficiam o suporte a tomada de decisão. As aplicações de DWE e SOLAP abordam majoritarimente fenômenos representados por dados espaciais exatos, ou seja, que assumem localizações e fronteiras bem definidas. Contudo, tais aplicações negligenciam dados espaciais afetados por imperfeições, tais como a vagueza espacial, a qual interfere na identificação precisa de um objeto e de seus vizinhos. Um objeto espacial vago não tem sua fronteira ou seu interior precisamente definidos. Além disso, é composto por partes que certamente pertencem a ele e partes que possivelmente pertencem a ele. Apesar de inúmeros fenômenos do mundo real serem caracterizados pela vagueza espacial, na literatura consultada não se identificaram trabalhos que considerassem a vagueza espacial no projeto de DWE e nem para consultar o DWE. Tal limitação motivou a elaboração desta tese de doutorado, a qual introduz os conceitos de DWE vago e de SOLAP vago. Um DWE vago é um DWE que armazena dados espaciais vagos, enquanto que SOLAP vago provê os meios para consultar o DWE vago. Nesta tese, o projeto de DWE vago é abordado e as principais contribuições providas são: (i) o modelo conceitual VSCube que viabiliza a criação de um cubos de dados multidimensional para representar o esquema conceitual de um DWE vago; (ii) o modelo conceitual VSMultiDim que permite criar um diagrama para representar o esquema conceitual de um DWE vago; (iii) diretrizes para o projeto lógico do DWE vago e de suas restrições de integridade, e para estender a linguagem SQL visando processar as consultas de SOLAP vago no DWE vago; e (iv) o índice VSB-index que aprimora o desempenho do processamento de consultas no DWE vago. A aplicabilidade dessas contribuições é demonstrada em dois estudos de caso no domínio da agricultura, por meio da criação de esquemas conceituais de DWE vago, da transformação dos esquemas conceituais em esquemas lógicos de DWE vago, e do processamento de consultas envolvendo as regiões vagas do DWE vago. / Doctorat en Sciences de l'ingénieur et technologie / Location of the public defense: Universidade Federal de São Carlos, São Carlos, SP, Brazil. / info:eu-repo/semantics/nonPublished

O presente trabalho teve como objetivo definir o rearranjo espacial da capacidade estática de armazenamento de soja no estado do Mato Grosso a partir de um modelo matemático de localização, visando à minimização dos custos logísticos envolvidos no escoamento da produção do grão aos armazéns e desses aos principais portos brasileiros. O instrumental utilizado para tanto foi a programação inteira-mista, considerando que o mercado em questão atua em concorrência perfeita, com oferta (produção) e demanda (exportação) fixas e ausência de diferença tecnológica e de economia de escala nas atividades de armazenamento e transporte. Foi adotado como premissa básica que o transporte dos locais armazenadores aos portos se dará apenas pela logística intermodal (rodo-ferro/hidroviário). Foram elaborados quatro cenários para tal análise, que incorporaram alterações na demanda, na economia de escala dos custos de construção dos armazéns graneleiros e mudanças na seleção dos armazéns para atendimento às exportações. Para todas essas simulações foi considerada a ausência de armazéns graneleiros no Mato Grosso, para comparação dos resultados com a situação da rede armazenadora existente. Os resultados obtidos sinalizaram que há uma tendência para ampliação da capacidade estática de armazenamento, principalmente nas mesorregiões Norte e Nordeste mato-grossenses, em torno de 1,4 milhões de toneladas. As microrregiões de Alto Paraguai (Centro-Sul), Alto Araguaia (Sudeste), Nova Lacerda e Tangará da Serra (Sudoeste) possuem uma defasagem na capacidade de estocagem atual, mostrando-se assim como locais potenciais para receber investimentos na ampliação. Portanto, pode-se concluir que o modelo desenvolvido atendeu ao objetivo do problema que foi de identificar os locais e dimensionar a capacidade de armazenamento para o Mato Grosso, mostrando assim, quais são as regiões que necessitam ampliar seu sistema armazenador. Dessa forma, a expansão planejada do sistema de armazenamento pode contribuir para minimizar as perdas no escoamento da produção, uma vez que o estado está muito distante dos portos. Assim, uma logística intermodal (mais competitiva) integrada com um sistema de armazenamento planejado pode diminuir o custo total envolvido para escoar a produção de soja mato-grossense até os portos. / The current study aimed to define the spatial rearrangement of the static capacity of soybean storage in the state of Mato Grosso, making use of a mathematical model of location, seeking for the reduction of logistic costs involved in transporting the grains production to warehouses and from there to the mains harbors in Brazil. The method used for that purpose was the mixed-integer programming, considering that the market under study is under perfect competition, with fixed supply (production) and demand (exportation) and the absence of a technological difference and of economies of scale in the activities of stocking and transporting. It was adopted as basic premise that the transporting from warehouses to harbors will be done through inter modal logistics (road-railway / waterway). Four scenarios were developed for such analysis, which incorporate changes in demand, economies of scale on costs of building grain warehouses and a change in the choice of the warehouses to meet the demand for exportation. In all of these simulations it was considered the absence of warehouses in Mato Grosso for comparing the results to the system of the existing network of storage. The results obtained signal that there is a tendency to expand the static capacity of storage, specially in the regions of the North or Northeast of Mato Grosso, to 1.4 million tons roughly. The regions of Alto Paraguai (Center-South), Alto Araguaia (Southeast), Nova Lacerda and Tangará da Serra (Southwest) have a current gap in the capacity of storage, showing that they are potential places to receive investments for expansion. Therefore, it can be concluded that the model developed reached the objective of the problem, which was to identify places and to delineate the capacity of storage for the state of Mato Grosso, presenting this way the regions to expand their stocking system. The planned expansion of the system can contribute to minimizing the losses in transporting the production, once the state is located far from the harbors. Thus, an inter modal logistic (more competitive) integrated to a planned system of storage can reduce the total cost involved to transport the soybean production to the harbors.

Les statistiques présentes dans les Open Data ou données ouvertes constituent des informations utiles pour alimenter un système décisionnel. Leur intégration et leur entreposage au sein du système décisionnel se fait à travers des processus ETL. Il faut automatiser ces processus afin de faciliter leur accessibilité à des non-experts. Ces processus doivent pallier aux problèmes de manque de schémas, d'hétérogénéité structurelle et sémantique qui caractérisent les données ouvertes. Afin de répondre à ces problématiques, nous proposons une nouvelle démarche ETL basée sur les graphes. Pour l'extraction du graphe d'un tableau, nous proposons des activités de détection et d'annotation automatiques. Pour la transformation, nous proposons un programme linéaire pour résoudre le problème d'appariement holistique de données structurelles provenant de plusieurs graphes. Ce modèle fournit une solution optimale et unique. Pour le chargement, nous proposons un processus progressif pour la définition du schéma multidimensionnel et l'augmentation du graphe intégré. Enfin, nous présentons un prototype et les résultats d'expérimentations. / Statistical Open Data present useful information to feed up a decision-making system. Their integration and storage within these systems is achieved through ETL processes. It is necessary to automate these processes in order to facilitate their accessibility to non-experts. These processes have also need to face out the problems of lack of schemes and structural and sematic heterogeneity, which characterize the Open Data. To meet these issues, we propose a new ETL approach based on graphs. For the extraction, we propose automatic activities performing detection and annotations based on a model of a table. For the transformation, we propose a linear program fulfilling holistic integration of several graphs. This model supplies an optimal and a unique solution. For the loading, we propose a progressive process for the definition of the multidimensional schema and the augmentation of the integrated graph. Finally, we present a prototype and the experimental evaluations.

In recent years, there has been an exponential increase in container volume shipment within intermodal transportation systems. Container terminals as part of the global port system represent important hubs within this intermodal transportation system. Thus, the need to improve the operational efficiency is the most important issue for container terminals from an economic standpoint. Moreover, intermodal transportation systems, ports and inland transport facilities should all be integrated into one coordinated plan. More specifically, a method to schedule different types of handling equipment in an integrated way within a container terminal is a popular topic for researchers. However, not many researchers have addresses this topic in relationship to the simulation aspect which will test feasible solutions under real container terminal environment parameters. In order to increase the efficiency of operations, the development of mathematical models and algorithms is critical in finding the best feasible solution. The objective of this study is to evaluate the feasible solution to find the proper number of Yard Trailers (YTs) with the minimal cost for the container terminals. This study uses the Dynamic YTs operation's method as a background for modeling. A mathematical model with various constraints related to the integrated operations among the different types of handling equipment is formulated. This model takes into consideration both serving time of quay cranes and yard cranes, and cost reduction strategies by decreasing use of YTs with the specific objective of minimum total cost including utilization of YTs and vessel berthing. In addition, a heuristic algorithm combined with Monte Carlo Method and Brute-Force Search are employed. The early Stage Technique of Monte Carlo method is proposed to generate vast random numbers to replicate simulation for real cases. / The Brute-Force Search is used for identifying all potential cases specific to the conditions of this study. Some preliminary numerical test results suggest that this method is good for use in conjunction with simulation of container terminal operation. The expected outcome of this research is a solution to obtain the proper number of YTs for transporting containers with a minimum cost; thus, improving the operational efficiency in a container terminal. / by Yueqiong Zhao. / Thesis (M.S.C.S.)--Florida Atlantic University, 2011. / Includes bibliography. / Electronic reproduction. Boca Raton, Fla., 2011. Mode of access: World Wide Web.