Details
| Originalsprache | Englisch |
|---|---|
| Titel des Sammelwerks | Database and Expert Systems Applications |
| Untertitel | 30th International Conference, DEXA 2019, Linz, Austria, August 26–29, 2019, Proceedings |
| Herausgeber/-innen | Sven Hartmann, Josef Küng, Sharma Chakravarthy, Gabriele Anderst-Kotsis, A Min Tjoa, Ismail Khalil |
| Seiten | 205-214 |
| Seitenumfang | 10 |
| Band | I |
| Auflage | 1. |
| ISBN (elektronisch) | 978-3-030-27615-7 |
| Publikationsstatus | Veröffentlicht - 3 Aug. 2019 |
| Veranstaltung | 30th International Conference on Database and Expert Systems Applications, DEXA 2019 - Linz, Österreich Dauer: 26 Aug. 2019 → 29 Aug. 2019 |
Publikationsreihe
| Name | Lecture Notes in Computer Science (LNISA) |
|---|---|
| Band | 11706 |
| ISSN (Print) | 0302-9743 |
| ISSN (elektronisch) | 1611-3349 |
Abstract
Open data initiatives and FAIR data principles have encouraged the publication of large volumes of data, encoding knowledge relevant for the advance of science and technology. However, to mine knowledge, it is usually required the processing of data collected from sources regulated by diverse access and privacy policies. We address the problem of enforcing data privacy and access regulations (EDPR) and propose PURE, a framework able to solve this problem during query processing. PURE relies on the local as view approach for defining the rules that represent the access control policies imposed over a federation of RDF knowledge graphs. Moreover, PURE maps the problem of checking if a query meets the privacy regulations to the problem of query rewriting (QRP) using views; it resorts to state-of-the-art QRP solutions for determining if a query violates or not the defined policies. We have evaluated 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.
ASJC Scopus Sachgebiete
- Mathematik (insg.)
- Theoretische Informatik
- Informatik (insg.)
- Allgemeine Computerwissenschaft
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
Database and Expert Systems Applications : 30th International Conference, DEXA 2019, Linz, Austria, August 26–29, 2019, Proceedings. Hrsg. / Sven Hartmann; Josef Küng; Sharma Chakravarthy; Gabriele Anderst-Kotsis; A Min Tjoa; Ismail Khalil. Band I 1. Aufl. 2019. S. 205-214 (Lecture Notes in Computer Science (LNISA); Band 11706).
Publikation: Beitrag in Buch/Bericht/Sammelwerk/Konferenzband › Aufsatz in Konferenzband › Forschung › Peer-Review
}
TY - GEN
T1 - PURE
T2 - 30th International Conference on Database and Expert Systems Applications, DEXA 2019
AU - Goncalves, Marlene
AU - Vidal, Maria Esther
AU - Endris, Kemele M.
N1 - Funding information: This work has been partially supported by the EU H2020 RIA funded project iASiS with grant agreement No. 727658.
PY - 2019/8/3
Y1 - 2019/8/3
N2 - Open data initiatives and FAIR data principles have encouraged the publication of large volumes of data, encoding knowledge relevant for the advance of science and technology. However, to mine knowledge, it is usually required the processing of data collected from sources regulated by diverse access and privacy policies. We address the problem of enforcing data privacy and access regulations (EDPR) and propose PURE, a framework able to solve this problem during query processing. PURE relies on the local as view approach for defining the rules that represent the access control policies imposed over a federation of RDF knowledge graphs. Moreover, PURE maps the problem of checking if a query meets the privacy regulations to the problem of query rewriting (QRP) using views; it resorts to state-of-the-art QRP solutions for determining if a query violates or not the defined policies. We have evaluated 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.
AB - Open data initiatives and FAIR data principles have encouraged the publication of large volumes of data, encoding knowledge relevant for the advance of science and technology. However, to mine knowledge, it is usually required the processing of data collected from sources regulated by diverse access and privacy policies. We address the problem of enforcing data privacy and access regulations (EDPR) and propose PURE, a framework able to solve this problem during query processing. PURE relies on the local as view approach for defining the rules that represent the access control policies imposed over a federation of RDF knowledge graphs. Moreover, PURE maps the problem of checking if a query meets the privacy regulations to the problem of query rewriting (QRP) using views; it resorts to state-of-the-art QRP solutions for determining if a query violates or not the defined policies. We have evaluated 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.
UR - http://www.scopus.com/inward/record.url?scp=85077125619&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-27615-7_15
DO - 10.1007/978-3-030-27615-7_15
M3 - Conference contribution
AN - SCOPUS:85077125619
SN - 978-3-030-27614-0
VL - I
T3 - Lecture Notes in Computer Science (LNISA)
SP - 205
EP - 214
BT - Database and Expert Systems Applications
A2 - Hartmann, Sven
A2 - Küng, Josef
A2 - Chakravarthy, Sharma
A2 - Anderst-Kotsis, Gabriele
A2 - Tjoa, A Min
A2 - Khalil, Ismail
Y2 - 26 August 2019 through 29 August 2019
ER -