Efficient Processing of Large Intersection Queries on Set_Valued Data
DOI:
Author:
Affiliation:
Clc Number:
Fund Project:
Article
|
Figures
|
Metrics
|
Reference
|
Related
|
Cited by
|
Materials
|
Comments
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.
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.