40 resultados para relational databases


Relevância:

10.00% 10.00%

Publicador:

Resumo:

Tese de Doutoramento em Sociologia

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Inspired by the relational algebra of data processing, this paper addresses the foundations of data analytical processing from a linear algebra perspective. The paper investigates, in particular, how aggregation operations such as cross tabulations and data cubes essential to quantitative analysis of data can be expressed solely in terms of matrix multiplication, transposition and the Khatri–Rao variant of the Kronecker product. The approach offers a basis for deriving an algebraic theory of data consolidation, handling the quantitative as well as qualitative sides of data science in a natural, elegant and typed way. It also shows potential for parallel analytical processing, as the parallelization theory of such matrix operations is well acknowledged.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Model finders are very popular for exploring scenarios, helping users validate specifications by navigating through conforming model instances. To be practical, the semantics of such scenario exploration operations should be formally defined and, ideally, controlled by the users, so that they are able to quickly reach interesting scenarios. This paper explores the landscape of scenario exploration operations, by formalizing them with a relational model finder. Several scenario exploration operations provided by existing tools are formalized, and new ones are proposed, namely to allow the user to easily explore very similar (or different) scenarios, by attaching preferences to model elements. As a proof-of-concept, such operations were implemented in the popular Alloy Analyzer, further increasing its usefulness for (user-guided) scenario exploration.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

This paper introduces the metaphorism pattern of relational specification and addresses how specification following this pattern can be refined into recursive programs. Metaphorisms express input-output relationships which preserve relevant information while at the same time some intended optimization takes place. Text processing, sorting, representation changers, etc., are examples of metaphorisms. The kind of metaphorism refinement proposed in this paper is a strategy known as change of virtual data structure. It gives sufficient conditions for such implementations to be calculated using relation algebra and illustrates the strategy with the derivation of quicksort as example.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Tese de Doutoramento em Engenharia Civil.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Doctoral Thesis in Juridical Sciences (Specialty in Public Legal Sciences)

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Dissertação de mestrado integrado em Engenharia Biomédica (área de especialização em Informática Médica)

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Dissertação de mestrado em Direito dos Contratos e da Empresa

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Dissertação de mestrado em Ciências da Educação (área de especialização em Desenvolvimento Curricular e Inovação Educativa)