首页> 外国专利> How to merge sort records in a high efficiency with a trie tree structure, apparatus and computer program

How to merge sort records in a high efficiency with a trie tree structure, apparatus and computer program

机译:如何利用特里树结构,装置和计算机程序高效地合并排序记录

摘要

A first record group and a second record group having a tree structure are merge-sorted. The first record group and the second record group are acquired, and depth information indicative of the hierarchical depth of the tree structure is attached as metadata to key information on each node of each record included in the acquired first record group and second record group. The depth information is compared in preference to the key information to perform merge sort sequentially.
机译:具有树结构的第一记录组和第二记录组被合并分类。获取第一记录组和第二记录组,并且表示树结构的层次深度的深度信息作为元数据被附加到所获取的第一记录组和第二记录组中包括的每个记录的每个节点的关键信息上。优先将深度信息与关键信息进行比较,以顺序执行合并排序。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号