首页> 外文会议>International conference on enterprise information systems >Schema-Independent Querying and Manipulation for Heterogeneous Collections in NoSQL Document Stores
【24h】

Schema-Independent Querying and Manipulation for Heterogeneous Collections in NoSQL Document Stores

机译:在NoSQL文档商店中的异构集合的架构独立查询和操纵

获取原文

摘要

NoSQL document stores offer native support to efficiently store documents with different schema within a same collection. However, this flexibility made it difficult and complex to formulate queries or to manipulate collections with multiple schemas. Hence, the user has to build complex queries or to reformulate existing ones whenever new schemas appear in the collection. In this paper, we propose a novel approach, grounded on formal foundations, for enabling schema-independent queries for querying and maintaining multi-structured documents. We introduce a query reformulation mechanism which consults a pre-constructed dictionary. This dictionary binds each possible path in the documents to all its corresponding absolute paths in all the documents. We automate the process of query reformulation via a set of rules that reformulate most document store operators, such as select, project and aggregate. In addition, we automate the process of reformulating the classical manipulation operators (insert, delete and update queries) in order to update the dictionary according to the different structural changes made in the collection. These two processes produce queries which are compatible with the native query engine of the underlying document store. To evaluate our approach, we conduct experiments on synthetic datasets. Our results show that the induced overhead when querying or updating can be acceptable when compared to the efforts made to restructure the data and the time required to execute several queries corresponding to the different schemas inside the collection.
机译:NoSQL文档存储提供本机支持,可在同一集合中有效地存储具有不同架构的文档。然而,这种灵活性使得制定查询或用多个模式操纵收集来使其变得困难和复杂。因此,用户必须在集合中显示新模式时构建复杂的查询或重新格式化现有问题。在本文中,我们提出了一种在正式基础上的新方法,用于启用架构独立查询,用于查询和维护多结构文档。我们介绍了一个查询重构机制,查询预构建的字典。此词典将文档中的每个可能的路径绑定到所有文档中的所有相应的绝对路径。我们通过一组规则自动化查询重构过程,该规则重新编写大多数文档存储运算符,例如选择,项目和聚合。此外,我们自动化典型操作算子(插入,删除和更新查询)的重新绘制的过程,以根据集合中的不同结构更改更新字典。这两个进程产生与底层文档存储的本机查询引擎兼容的查询。为了评估我们的方法,我们对合成数据集进行实验。我们的结果表明,与对对应于集合中的不同模式相对应的若干查询所需的努力相比,可以接受当查询或更新时可以接受诱导的开销。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号