English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Relational DBMSs continue to dominate the database market, and inferenceproblem on external schema of relational DBMS's is still an important issue interms of data privacy.Especially for the last 10 years, external schemaconstruction for application-specific database usage has increased itsindependency from the conceptual schema, as the definitions and implementationsof views and procedures have been optimized. This paper offers an optimizeddecomposition strategy for the external schema, which concentrates on theprivacy policy and required associations of attributes for the intended userroles. The method proposed in this article performs a proactive decompositionof the external schema, in order to satisfy both the forbidden and requiredassociations of attributes.Functional dependency constraints of a databaseschema can be represented as a graph, in which vertices are attribute sets andedges are functional dependencies. In this representation, inference problemcan be defined as a process of searching a subtree in the dependency graphcontaining the attributes that need to be related. The optimized decompositionprocess aims to generate an external schema, which guarantees the prevention ofthe inference of the forbidden attribute sets while guaranteeing theassociation of the required attribute sets with a minimal loss of possibleassociation among other attributes, if the inhibited and required attributesets are consistent with each other. Our technique is purely proactive, and canbe viewed as a normalization process. Due to the usage independency of externalschema construction tools, it can be easily applied to any existing systemswithout rewriting data access layer of applications. Our extensive experimentalanalysis shows the effectiveness of this optimized proactive strategy for awide variety of logical schema volumes.

Graph Based Proactive Secure Decomposition Algorithm for Context Dependent Attribute Based Inference Control Problem