|Appears in Collections:||Computing Science and Mathematics Conference Papers and Proceedings|
|Title:||Towards flexible indices for distributed graph data: The formal schema-level index model FLuID|
|Citation:||Blume T & Scherp A (2018) Towards flexible indices for distributed graph data: The formal schema-level index model FLuID. In: Klassen G & Conrad S (eds.) Proceedings of the 30th GI-Workshop Grundlagen von Datenbankenvolume 2126. CEUR Workshop Proceedings, 2126. 30th GI-Workshop Grundlagen von Datenbanken, Wuppertal, Germany, 22.05.2018-25.05.2018. Aachen, Germany: CEUR Workshop Proceedings, pp. 23-28|
|Series/Report no.:||CEUR Workshop Proceedings, 2126|
|Conference Name:||30th GI-Workshop Grundlagen von Datenbanken|
|Conference Dates:||2018-05-22 - 2018-05-25|
|Conference Location:||Wuppertal, Germany|
|Abstract:||Graph indices are a key to manage huge amounts of distributed graph data. Instance-level indices are available that focus on the fast retrieval of nodes. Furthermore, there are so-called schema-level indices focusing on summarizing nodes sharing common characteristics, i. e., the combination of attached types and used property-labels. We argue that there is not a one-size-fits-all schema-level index. Rather, a parameterized, formal model is needed that allows to quickly design, tailor, and compare different schema-level indices. We abstract from related works and provide the formal model FLuID using basic building blocks to flexibly define different schema-level indices. The FLuID model provides parameterized simple and complex schema elements together with four parameters. We show that all indices modeled in FLuID can be computed in O(n). Thus, FLuID enables us to efficiently implement, compare, and validate variants of schema-level indices tailored for specific application scenarios.|
|Status:||VoR - Version of Record|
|Rights:||Copyright © 2016 for the individual papers by the papers' authors. Copying permitted for private and academic purposes|
|Blume-Scherp.pdf||Fulltext - Published Version||616.96 kB||Adobe PDF||View/Open|
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
If you believe that any material held in STORRE infringes copyright, please contact email@example.com providing details and we will remove the Work from public display in STORRE and investigate your claim.