Monitoring and analysis of queries in distributed databases

Dissertação de Mestrado em Engenharia Informática

A survey of distributed data aggregation algorithms

Distributed data aggregation is an important task, allowing the de- centralized determination of meaningful global properties, that can then be used to direct the execution of other applications. The resulting val- ues result from the distributed computation of functions like count, sum and average. Some application examples can found to determine the network size, total storage capacity, average load, majorities and many others. In the last decade, many di erent approaches have been pro- posed, with di erent trade-o s in terms of accuracy, reliability, message and time complexity. Due to the considerable amount and variety of ag- gregation algorithms, it can be di cult and time consuming to determine which techniques will be more appropriate to use in speci c settings, jus- tifying the existence of a survey to aid in this task. This work reviews the state of the art on distributed data aggregation algorithms, providing three main contributions. First, it formally de nes the concept of aggrega- tion, characterizing the di erent types of aggregation functions. Second, it succinctly describes the main aggregation techniques, organizing them in a taxonomy. Finally, it provides some guidelines toward the selection and use of the most relevant techniques, summarizing their principal characteristics.

Concise server-wide causality management for eventually consistent data stores

Large scale distributed data stores rely on optimistic replication to scale and remain highly available in the face of net work partitions. Managing data without coordination results in eventually consistent data stores that allow for concurrent data updates. These systems often use anti-entropy mechanisms (like Merkle Trees) to detect and repair divergent data versions across nodes. However, in practice hash-based data structures are too expensive for large amounts of data and create too many false conflicts. Another aspect of eventual consistency is detecting write conflicts. Logical clocks are often used to track data causality, necessary to detect causally concurrent writes on the same key. However, there is a nonnegligible metadata overhead per key, which also keeps growing with time, proportional with the node churn rate. Another challenge is deleting keys while respecting causality: while the values can be deleted, perkey metadata cannot be permanently removed without coordination. Weintroduceanewcausalitymanagementframeworkforeventuallyconsistentdatastores,thatleveragesnodelogicalclocks(BitmappedVersion Vectors) and a new key logical clock (Dotted Causal Container) to provides advantages on multiple fronts: 1) a new efficient and lightweight anti-entropy mechanism; 2) greatly reduced per-key causality metadata size; 3) accurate key deletes without permanent metadata.

Diagnostic value of the tilt-table test for the assessment of syncope in children and adolescents

OBJECTIVE - To assess the diagnostic value, the characteristics, and feasibility of tilt-table testing in children and adolescents. METHODS - From August 1991 to June 1997, we retrospectively assessed 94 patients under the age of 18 years who had a history of recurring syncope and presyncope of unknown origin and who were referred for tilt-table testing. These patients were divided into 2 groups: group I (children) - 36 patients with ages ranging from 3 to 12 (mean of 9.19±2.31) years; group II (adolescents) - 58 patients with ages ranging from 13 to 18 (mean of 16.05±1.40) years. We compared the positivity rate, the type of hemodynamic response, and the time period required for the test to become positive in the 2 groups. RESULTS - The positivity rates were 41.6 % and 50% for groups I and II, respectively. The pattern of positive hemodynamic response that predominated in both groups was the mixed response. The mean time period required for the test to become positive was shorter in group I (11.0±7.23 min) than in group II (18.44±7.83 min). No patient experienced technical difficulty or complications. CONCLUSION - No difference was observed in regard to feasibility, positivity rate, and pattern of positive response for the tilt-table test in children and adolescents. Pediatric patients had earlier positive responses.

Comparison between tilt-table testing results performed during different periods of the day

OBJECTIVE: To evaluate the influences of circadian variations on tilt-table testing (TTT) results by comparing the positivity rate of the test performed during the morning with that of the test performed in the afternoon and to evaluate the reproducibility of the results in different periods of the day. METHODS: One hundred twenty-three patients with recurrent unexplained syncope or near-syncope referred for TTT were randomized into 2 groups. In group I, 68 patients, TTT was performed first in the afternoon and then in the morning. In group II, 55 patients, the test was performed first in the morning and then in the afternoon. RESULTS: The TTT protocol was the prolonged passive test, without drug sensitization. Twenty-nine (23.5%) patients had a positive result in at least one of the periods. The positivity rate for each period was similar: 20 (16.2%) patients in the afternoon and 19 (15.4%) in the morning (p=1.000). Total reproducibility (positive/positive and negative/negative) was observed in 49 (89%) patients in group I and in 55 (81%) in group II. Reproducibility of the results was obtained in 94 (90.4%) patients with first negative tests but in 10 (34%) patients with first positive tests. CONCLUSION: TTT could be performed during any period of the day, and even in the 2 periods to enhance positivity. Considering the low reproducibility rate of the positive tests, serial TTT to evaluate therapeutic efficacy should be performed during the same period of the day.

maintenance model for systems with phase-type distributed times to failure

Magdeburg, Univ., Fak. für Mathematik, Diss., 2010

Keyword search across distributed heterogenous structured data sources

Magdeburg, Univ., Fak. für Informatik, Diss., 2012

Optimierung biometrischer Hash-Algorithmen für die dynamische Handschrift

Magdeburg, Univ., Fak. für Informatik, Diss., 2015

Collaboration process design for ideation in distributed environments : approaches to support collaborative ideation in global virtual groups using technological support

Magdeburg, Univ., Fak. für Informatik, Diss., 2012

Observações preliminares sôbre a longevidade dos "Seedlings" de feijoeiro - Phaseolus vulgaris : em função das reservas cotiledonares

According previous studies about longevity in maize by ACCORSI e ADÂMOLI DE BARROS, (1961) the authors presents in this paper the results of work on longevity of seedlings of beans. Seeds were separated in three groups according their weight, as followings: small 80-120 mg; medium 130-140 mg and big 150-200 mg. The sowing of the seeds was made in pure sand and the seedlings were distributed in distil. water and in complete solution of Arnon and Hoagland. Each treatment was made in two replications with eight seedlings by treatment. At present time the following conclusions can be related: 1.°) - Eight days after germination, the cotiledones of all the seedlings started to fell down, fourteen days after, all cotiledones had fell down. 2.°) - Fifteen days after germination, the seedlings in nutritive solution showed better development than those in distil. water. Table I e II gives results. 3.°) - All seedlings in distil. water showed symptoms of N, Ca, Fe deficiencies. 4.°) - Twenty nine days after germination the seedlings in distil. water manifested exhaust trace, by falling of the leaves and death of some plants although the aplicai buds keep green. 5.°) - After thirty-one days the plants in nutritives solution was in better condition than those in distil. water, although some alteration aboved mentioned was observed. The causes of this alteration are being studied. 6.°) - In many plants in complet solution the seminal leaves showed clorosis initial and some with necrosis, although apical buds keeps in ativity. 7.°) - Symptoms of clorosis and necrosis in diferents stages were observed in all leaflet; these symptoms were more strong in the groups of little seed and medium seeds.

In search of mathematical primitives for deriving universal projective hash families

We provide some guidelines for deriving new projective hash families of cryptographic interest. Our main building blocks are so called group action systems; we explore what properties of this mathematical primitives may lead to the construction of cryptographically useful projective hash families. We point out different directions towards new constructions, deviating from known proposals arising from Cramer and Shoup's seminal work.

The Total fiscal cost of indirect taxation: an approximation using Catalonia's recent input-output table

In this note we quantify to what extent indirect taxation influences and distorts prices. To do so we use the networked accounting structure of the most recent input-output table of Catalonia, an autonomous region of Spain, to model price formation. The role of indirect taxation is considered both from a classical value perspective and a more neoclassical flavoured one. We show that they would yield equivalent results under some basic premises. The neoclassical perspective, however, offers a bit more flexibility to distinguish among different tax figures and hence provide a clearer disaggregate picture of how an indirect tax ends up affecting, and by how much, the cost structure.

Increasing the scalability and the speedup of a fish school distributed simulator

El present treball fa un anàlisi i desenvolupament sobre les millores en la velocitat i en l’escalabilitat d'un simulador distribuït de grups de peixos. Aquests resultats s’han obtingut fent servir una nova estratègia de comunicació per als processos lògics (LPs) i canvis en l'algoritme de selecció de veïns que s'aplica a cadascun dels peixos en cada pas de simulació. L’idea proposada permet que cada procés lògic anticipi futures necessitats de dades pels seus veïns reduint el temps de comunicació al limitar la quantitat de missatges intercanviats entre els LPs. El nou algoritme de selecció dels veïns es va desenvolupar amb l'objectiu d'evitar treball innecessari permetent la disminució de les instruccions executades en cada pas de simulació i per cadascun del peixos simulats reduint de forma significativa el temps de simulació.