%0 Journal Article
%T INDEXING FOR CONSTRAINT DATABASES<br>约束数据库中的索引
%A WANG Yujun
%A TIAN Zengping
%A QU Yunyao
%A SHI Baile
%A <br>王宇君
%A 田增平
%A 曲云尧
%A 施伯乐
%J 软件学报
%D 1997
%I 
%X In this paper, the indexing in constraint databases is considered. Meta-blocktree is improved and a data structure S* tree is presented. It stores the stabbing sets forconstants that appears in the intervals. If the maximurn length of each stabbing set is limited, the space used in S* tree is optimal- Compared with M tree, a significant improvement of S* is that it can support delete operation.
%K Constraint databases
%K index
%K B+tree
%K dynamic interval management<br>约束数据库
%K 索引
%K B＋树
%K 动态区间管理
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=31A787911CEA128F5C8652E778837835&yid=5370399DC954B911&vid=5D311CA918CA9A03&iid=59906B3B2830C2C5&sid=BF6EDE6C10074464&eid=3DC9CEF02B8360EE&journal_id=1000-9825&journal_name=软件学报&referenced_num=0&reference_num=3