Combining Relational Algebra, SQL, Constraint Modelling, and Local Search

The goal of this paper is to provide a strong integration between constraint modelling and relational DBMSs. To this end we propose extensions of standard query languages such as relational algebra and SQL, by adding constraint modelling capabilities to them. In particular, we propose non-deterministic extensions of both languages, which are specially suited for combinatorial problems. Non-determinism is introduced by means of a guessing operator, which declares a set of relations to have an arbitrary extension. This new operator results in languages with higher expressive power, able to express all problems in the complexity class NP. Some syntactical restrictions which make data complexity polynomial are shown. The effectiveness of both extensions is demonstrated by means of several examples. The current implementation, written in Java using local search techniques, is described. To appear in Theory and Practice of Logic Programming (TPLP)Comment: 30 pages, 5 figure

Enabling Secure Database as a Service using Fully Homomorphic Encryption: Challenges and Opportunities

The database community, at least for the last decade, has been grappling with querying encrypted data, which would enable secure database as a service solutions. A recent breakthrough in the cryptographic community (in 2009) related to fully homomorphic encryption (FHE) showed that arbitrary computation on encrypted data is possible. Successful adoption of FHE for query processing is, however, still a distant dream, and numerous challenges have to be addressed. One challenge is how to perform algebraic query processing of encrypted data, where we produce encrypted intermediate results and operations on encrypted data can be composed. In this paper, we describe our solution for algebraic query processing of encrypted data, and also outline several other challenges that need to be addressed, while also describing the lessons that can be learnt from a decade of work by the database community in querying encrypted data

Structurally Tractable Uncertain Data

Many data management applications must deal with data which is uncertain, incomplete, or noisy. However, on existing uncertain data representations, we cannot tractably perform the important query evaluation tasks of determining query possibility, certainty, or probability: these problems are hard on arbitrary uncertain input instances. We thus ask whether we could restrict the structure of uncertain data so as to guarantee the tractability of exact query evaluation. We present our tractability results for tree and tree-like uncertain data, and a vision for probabilistic rule reasoning. We also study uncertainty about order, proposing a suitable representation, and study uncertain data conditioned by additional observations.Comment: 11 pages, 1 figure, 1 table. To appear in SIGMOD/PODS PhD Symposium 201

New software tool to characterize photovoltaic modules from commercial equipment

A software platform has been developed in order to unify the different measurements obtained from different manufacturers in the photovoltaic system laboratory of the University of Malaga, Spain. These measurements include the current-voltage curve of PV modules and several meteorological parameters such as global and direct irradiance, temperature and spectral distribution of solar irradiance. The measurements are performed in an automated way by a stand-alone application that is able to communicate with a pair of multimeters and a bipolar power supply that are controlled in order to obtain the current–voltage pairs. In addition, several magnitudes, that can be configured by the user, such as irradiance, module temperature or wind speed, are incorporated to register the conditions of each measurement. Moreover, it is possible to attach to each curve the spectral distribution of the solar radiation at each moment. Independently of the source of the information, all these measurements are stored in a uniform relational database. These data can be accessed through a public web site that can generate several graphics from the data.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech. Junta de Andalucía. Proyecto de Excelencia P11-RNM-711

Methods of representing the structure of complex industrial products on computer files, to facilitate planning, costing and related management tasks : a thesis presented in fulfilment of the requirements for the degree of Master of Technology in Manufacturing and Industrial Technology at Massey University

When the original concepts for the computerisation of product structures were developed in the late 1960's the available computer power was very limited. A modularisation technique was developed to address the situation in which a number of similar products were being manufactured. This technique tried to rationalise these products into family groups. Each member of the family differed from the others due to the possession of different features or options. However there was also a high degree of commonality to give the product membership of the family. Modularisation involved the identification of the options and features providing the variability. Those parts remaining tended to be common to all members of the family and became known as the common parts. Separate Bills of Material (BOMs) were set up for each of the identified options or features. Another BOM was set up for the common parts. The simple combination of the required options and/or features BOMs with the common parts BOM specified a product. Computer storage requirements and redundancy were reduced to a minimum. The Materials Requirements Planning (MRP) system could manipulate these option and feature BOMs to over plan product variability without over planning the parts common to all members. The modularisation philosophy had wide acceptance and is the foundation of MRP training. Modularisation, developed for MRP, is generally parts orientated. An unfortunate side effect tends to be the loss of product structure information. Most commercial software would list 6 resistors, Part No. 123, in the common parts BOM without concern as to where the resistors are fitted. This loss of product structure information can hide the fact that two products using these 6 resistors 'in common' are in fact different as they do not use the resistors in the same 6 places. Additional information must be consulted to enable the correct assembly of the 'common' portion of these products. The electronics industry is especially affected by this situation. This industry has changed considerably since the late 1960's. Product variability can be very high. Changes and enhancements are a constant factor in products having a relatively short life span. The modularisation technique does not have a good mechanism for the situation where an option itself has options or features. This situation can exist down a number of layers of the family tree structure of an electronics product. Maintenance of these BOMs is difficult. Where there are options within options the designers and production staff need to know the inter-relationship of parts between options to ensure accuracy, compatibility and plan assembly functions. The advent of computerised spreadsheets has made the maintenance of this type of product structure information easier. This matrix is another separate document which must be maintained and cross checked. It will inevitably differ from the BOMs periodically. This thesis develops a product structure Relational BOM based on the matrix for the family of products. The processing power of the 1990's computer is fully utilised to derive the common parts for any or all of the selected products of the family. All product structure information is retained and the inter-relationship of parts is highly visible. The physical maintenance of the BOMs is simple. The BOM serves all purposes without the need for supplementary information. It is fully integrated into the Sales Order Entry , MRP, Costing, Engineering Design and Computer Aided Manufacturing (CAM) systems. This technique has been proven by being the only system used in one Electronics Design and Manufacturing organisation for over 1 year without any major problems. As described in Section 1.6 user satisfaction has been high. The response of the users to the suggestion 'lets buy an "off the shelf" package' is very negative, as it would not incorporate this BOM system. Users have expressed the opinion that EXICOM could not continue, with present staffing levels, using the traditional BOM structure

Incremental View Maintenance For Collection Programming

In the context of incremental view maintenance (IVM), delta query derivation is an essential technique for speeding up the processing of large, dynamic datasets. The goal is to generate delta queries that, given a small change in the input, can update the materialized view more efficiently than via recomputation. In this work we propose the first solution for the efficient incrementalization of positive nested relational calculus (NRC+) on bags (with integer multiplicities). More precisely, we model the cost of NRC+ operators and classify queries as efficiently incrementalizable if their delta has a strictly lower cost than full re-evaluation. Then, we identify IncNRC+; a large fragment of NRC+ that is efficiently incrementalizable and we provide a semantics-preserving translation that takes any NRC+ query to a collection of IncNRC+ queries. Furthermore, we prove that incremental maintenance for NRC+ is within the complexity class NC0 and we showcase how recursive IVM, a technique that has provided significant speedups over traditional IVM in the case of flat queries [25], can also be applied to IncNRC+.Comment: 24 pages (12 pages plus appendix

COEL: A Web-based Chemistry Simulation Framework

The chemical reaction network (CRN) is a widely used formalism to describe macroscopic behavior of chemical systems. Available tools for CRN modelling and simulation require local access, installation, and often involve local file storage, which is susceptible to loss, lacks searchable structure, and does not support concurrency. Furthermore, simulations are often single-threaded, and user interfaces are non-trivial to use. Therefore there are significant hurdles to conducting efficient and collaborative chemical research. In this paper, we introduce a new enterprise chemistry simulation framework, COEL, which addresses these issues. COEL is the first web-based framework of its kind. A visually pleasing and intuitive user interface, simulations that run on a large computational grid, reliable database storage, and transactional services make COEL ideal for collaborative research and education. COEL's most prominent features include ODE-based simulations of chemical reaction networks and multicompartment reaction networks, with rich options for user interactions with those networks. COEL provides DNA-strand displacement transformations and visualization (and is to our knowledge the first CRN framework to do so), GA optimization of rate constants, expression validation, an application-wide plotting engine, and SBML/Octave/Matlab export. We also present an overview of the underlying software and technologies employed and describe the main architectural decisions driving our development. COEL is available at http://coel-sim.org for selected research teams only. We plan to provide a part of COEL's functionality to the general public in the near future.Comment: 23 pages, 12 figures, 1 tabl