par Hewasinghage, Moditha 
;Nadal, Sergi;Abelló, Alberto;Zimanyi, Esteban
Référence Knowledge and Information Systems, 65, 7, page (3045-3078)
Publication Publié, 2023-07
;Nadal, Sergi;Abelló, Alberto;Zimanyi, Esteban Référence Knowledge and Information Systems, 65, 7, page (3045-3078)
Publication Publié, 2023-07
Article révisé par les pairs
| Résumé : | Document stores have gained popularity among NoSQL systems mainly due to the semi-structured data storage structure and the enhanced query capabilities. The database design in document stores expands beyond the first normal form by encouraging de-normalization through nesting. This hinders the process, as the number of alternatives grows exponentially with multiple choices in nesting (including different levels) and referencing (including the direction of the reference). Due to this complexity, document store data design is mostly carried out in trial-and-error or ad-hoc rule-based approaches. However, the choices affect multiple, often conflicting, aspects such as query performance, storage space, and complexity of the documents. To overcome these issues, in this paper, we apply multicriteria optimization. Our approach is driven by a query workload and a set of optimization objectives. First, we formalize a canonical model to represent alternative designs and introduce an algebra of transformations that can systematically modify a design. Then, using these transformations, we implement a local search algorithm driven by a loss function that can propose near-optimal designs with high probability. Finally, we compare our prototype against an existing document store data design solution purely driven by query cost, where our proposed designs have better performance and are more compact with less redundancy. |
