Παρακαλώ χρησιμοποιήστε αυτό το αναγνωριστικό για να παραπέμψετε ή να δημιουργήσετε σύνδεσμο προς αυτό το τεκμήριο: https://hdl.handle.net/123456789/1323
Τύπος: Άρθρο σε επιστημονικό περιοδικό
Τίτλος: View selection over knowledge graphs in triple stores
Συγγραφέας: [EL] Μαΐλης, Θεόφιλος[EN] Mailis, Theofilossemantics logo
[EL] Κωτίδης, Ιωάννης[EN] Kotidis, Yannissemantics logo
[EL] Χριστοφορίδης, Σταμάτης[EN] Christoforidis, Stamatissemantics logo
[EN] Kharlamov, Evgenysemantics logo
[EL] Ιωαννίδης, Γιάννης[EN] Ioannidis, Yannissemantics logo
Ημερομηνία: 01/09/2021
Περίληψη: Knowledge Graphs (KGs) are collections of interconnected and annotated entities that have become powerful assets for data integration, search enhancement, and other industrial applications. Knowledge Graphs such as DbPedia may contain billion of triple relations and are intensively queried with millions of queries per day. A prominent approach to enhance query answering on Knowledge Graph databases is View Materialization, ie., the materialization of an appropriate set of computations that will improve query performance. We study the problem of view materialization and propose a view selection methodology for processing query workloads with more than a million queries. Our approach heavily relies on subgraph pattern mining techniques that allow to create efficient summarizations of massive query workloads while also identifying the candidate views for materialization. In the core of our work is the correspondence between the view selection problem to that of Maximizing a Nondecreasing Submodular Set Function Subject to a Knapsack Constraint. The latter leads to a tractable view-selection process for native triple stores that allows a (1 − 𝑒 −1 )-approximation of the optimal selection of views. Our experimental evaluation shows that all the steps of the view-selection process are completed in a few minutes, while the corresponding rewritings accelerate 67.68% of the queries in the DbPedia query workload. Those queries are executed in 2.19% of their initial time on average.
Γλώσσα: Αγγλικά
Σελίδες: 14
DOI: 10.14778/3484224.3484227
ISSN: 2150-8097
Θεματική κατηγορία: [EL] Επιστήμη ηλεκτρονικών υπολογιστών[EN] Computer Sciencesemantics logo
Λέξεις-κλειδιά: Knowledge GraphsView Materialization
Κάτοχος πνευματικών δικαιωμάτων: © The Author(s) 2021.
Όροι και προϋποθέσεις δικαιωμάτων: This work is licensed under the Creative Commons BY-NC-ND 4.0 International License. Visit https://creativecommons.org/licenses/by-nc-nd/4.0/ to view a copy of this license. For any use beyond those covered by this license, obtain permission by emailing info@vldb.org. Copyright is held by the owner/author(s). Publication rights licensed to the VLDB Endowment.
Ηλεκτρονική διεύθυνση του τεκμηρίου στον εκδότη: https://dl.acm.org/doi/10.14778/3484224.3484227
Ηλεκτρονική διεύθυνση περιοδικού: https://dl.acm.org/journal/pvldb
Τίτλος πηγής δημοσίευσης: Proceedings of the VLDB Endowment
Τεύχος: 13
Τόμος: 14
Σελίδες τεκμηρίου (στην πηγή): 3281–3294
Σημειώσεις: This research is co-financed by Greece and the European Union (European Social Fund- ESF) through the Operational Programme «Human Resources Development, Education and Lifelong Learning» in the context of the project “Reinforcement of Postdoctoral Researchers - 2nd Cycle” (MIS-5033021), implemented by the State Scholarships Foundation (IKY). This research has received funding from the European Union’s Horizon 2020 Framework Programme for Research and Innovation under the Specific Grant Agreements No. 945539 (Human Brain Project SGA3) and No. 777413 (Delivering Agile Research Excellence on European e-Infrastructures).
Εμφανίζεται στις συλλογές:Μεταδιδακτορικοί ερευνητές

Αρχεία σε αυτό το τεκμήριο:
Αρχείο Περιγραφή ΣελίδεςΜέγεθοςΜορφότυποςΈκδοσηΆδεια
p3281-mailis.pdf14 σελίδες1.26 MBAdobe PDF-ccbyncndΔείτε/ανοίξτε