Titlebook: Database and Expert Systems Applications; 30th International C Sven Hartmann,Josef Küng,Ismail Khalil Conference proceedings 2019 Springer

Bumptious

Optimization of Row Pattern Matching over Sequence Data in Spark SQLocess. We focus on Spark and show design and implementation of the proposed methods for Spark SQL. We verify by the experiments that our optimization methods really contribute to the reduction of the processing time of Spark SQL queries including row pattern matching.

保守党

Towards Identifying De-anonymisation Risks in Distributed Health Data Silostional probability indicate a high risk of de-anonymisation, similar to quasi-identifiers in syntactic anonymisation schemes, and can be separated instead of deleted. Attribute compartmentation removes the risk of privacy exposure, and deletion avoidance results in a significant reduction in informa

micronutrients

An Attribute-Based Fine-Grained Access Control Mechanism for HBases to access data in HBase storage, the AGAC will give the permission or deny by verifying user’s atomic operations and by analyzing user’s attributes according to the access control policies related to the data granularity level. This access control mechanism is verified on publically available emai

humectant

Lopper: An Efficient Method for Online Log Pattern Mining Based on Hybrid Clustering Treets of log data generated in different industrial applications. The experimental results show that Lopper achieves the accuracy with 92.26% on average which is much better than comparative methods and remains high efficiency at the same time. We also conduct experiments on system anomaly detection ta

CON

Partially Indexing on Flash Memorypose a method which reduces the number of write and erase operations on flash memory during index creation. Due to employing optimization techniques specific for flash memory, the query response time is decreased twice in comparison to the traditional methods. As far as we know, it is the first appr

SENT

HGraph: A Connected-Partition Approach to Proximity Graphs for Similarity Searcharch results quality through long-range edges connecting pivots of different partitions. We present experimental results using real datasets that show that . applied to the . graph was able to decrease the construction time while increasing the approximate search recall when compared to the .. Regar

Pantry

Acetabulum

Adulate

PURE: A Privacy Aware Rule-Based Framework over Knowledge Graphsvaluated the efficiency of PURE over the Berlin SPARQL Benchmark (BSBM). Observed results suggest that PURE is able to scale up to complex scenarios where a large number of rules represents diverse types of policies.

Endoscope