集合数据相交查询的高效处理方法
作者:
基金项目:

Supported by the National Natural Science Foundation of China under Grant Nos.69933010,60303008(国家自然科学基金);the National High-Tech Research and Dcvelopment Plan of China under Grant No.2002AA423430(国家高技术研究发展计划(863))

  • 摘要
  • | |
  • 访问统计
  • |
  • 参考文献 [9]
  • |
  • 相似文献 [20]
  • | | |
  • 文章评论
    摘要:

    集合类型是面向对象数据库和对象.关系数据库申的一种重要的数据类型,但是目前还缺少支持相关查询的有效的索引结构.提出了集合类型数据的一种索引结构:Settrie,这种结构是基于数据库中数据的公共前缀构造的,与Invertfile不同,在Settrie中重复的数据得以合理地组织,所以查询中访问的数据量比Invert file 小,提高了选择操作的性能.通过实验证明:这种方法相比Invert file提高了集合数据上的各种相交选择操作的性能,同时还讨论了时Settrie的几种优化方法.

    Abstract:

    Set is a common data type in database system today.But there is no efficient index structure for set type data to support the queries relate to it.This paper presents a structure called SetUie.The stlxlcture is built based on the common prefix patterns in database.Unlike invert file,the sets with salne value are well organized.So the size of the data accessed by a query is smaller than that of invert file.This feature will cause the improvement of the selection operation’s performance.The experiments support this result.In this paper We also discuss several eptimizations approaches to Settrie.

    参考文献
    [1] BancilhonF,FerranG.The object database standard.PODS’92 1992 351~362.
    [2] Beeri C.New data models and language-the challenge PODS’92.1992.351~362.
    [3] TannenV Languages for collection types PODS’93.1993.
    [4] Helmer S,Moerkotte G.A study offour index structures for set-valuad attributes oflow cardinality. Technique Report,1999.
    [5] Hetmer S,Moerkotte G.Index structures for databases containing data items with setvaluad attributes. Technical Report,University ofMannheim,1997.
    [6] Helmer S,Moerkotte G. Evaluation of main memory join algorithms for joins with subset join predicates. VLDB’97 1997.
    [7] RamasamyK.et al.Set containment joins:the good,the bad and the ugly VLDB’2000. 2000.
    [8] Agrawal R,et al. Fast algorithms for mining association rules in large databases.VLDB 94.1994.
    [9] Hellerstein JM.Pfeffer A. The RD-Tree:An index structure for sets.Technical Report. Univetsity of Wisconsin, Madison,1997. [1O] Han J,Pei J,Yin Y. Mining frequent patterns without candidate generation In:Proc.of the 2000 ACM SIGMOD int’l Conf on Management of Data (SlG-MOD 2000) Dallas,2000.
    引证文献
    网友评论
    网友评论
    分享到微博
    发 布
引用本文

汪卫,谢闽峰,刘国华,庞引明,施伯乐.集合数据相交查询的高效处理方法.软件学报,2004,15(zk):53-67

复制
分享
文章指标
  • 点击次数:3163
  • 下载次数: 4444
  • HTML阅读次数: 0
  • 引用次数: 0
历史
文章二维码
您是第19754502位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号