期刊文献+

半结构数据的存储模型和查询执行 被引量:3

Storage Models and Query Execution of Semi-Structured Data
下载PDF
导出
摘要 1引言 半结构数据是指区别于语音和图像文件等"原始数据",具有一定程度的结构,又不像传统的数据库系统那样存在严格模式的数据[1.2].半结构数据广泛存在于各种电子数据源,特别是Internet当中.以WWW为例,其HTML文件格式本身就是由标签和锚点等结构单元组成的,因此文件中的数据常常具有明显的结构.但同时效据的结构又非常不规范,不符合传统效据库的要求,因此不能简单地应用现有的数据库技术和工具对其进行处理,需要研究和开发对半结构数据进行描述和处理的新技术、新工具. Semi-structured data are generally modeled as labeled graphs. Data in such models are self-describing and dynamically typed, and capture both schema and data information. Such models, although flexible, evoke severe efficiency penalties compared to querying structured database, such as relational databases. In order to improve the efficiency of data manipulation by utilizing structure information, we present a hybrid method capable of reorganizing semi-structured data on the basis of their structural degrees. The method extracts data with high degrees of structure and stores them in relations while leaves the rest part in its original graph form. This paper gives the algorithms for generating and dynamic updating storage model of the method, illustrates how queries could be executed based on the storage model and analyzes its improvement in processing queries, comparing with common execution methods. It also gives an algorithm that converts queries on semi-structured data to relational calculus, which provides a way to utilize query optimization techniques in relational database systems.
出处 《计算机科学》 CSCD 北大核心 2002年第10期6-10,共5页 Computer Science
基金 国家"973"重点基础研究发展规划项目(G1998030414)的支持
关键词 半结构数据 存储模型 数据模式 数据库系统 数据查询执行技术 Semi-structured data, Relational database, Storage model, Query execution
  • 相关文献

参考文献15

  • 1Abiteboul S. Querying semi-structured data. In: Proc. of the Intl. Conf. on Database Theory, Deplhi, Greece,Springer-Verlag,1997. 1~18
  • 2Buneman P. Tutorial: Semistructured data. In: Proc. of ACM Symposium on Principles of Database Systems, 1997.117~ 1 21
  • 3Buneman P, et al. A query language and optimization techniques for unstructured data. In: Proc. of ACM-SIGMOD Intl. Conf. on Management of Data, 1996. 505~516
  • 4Papakonstantinou Y, Garcia-Molina H, Widom J. Object exchange across heterogeneous information sources. In: IEEE Intl. Conf. on Data Engineering, March 1995. 251~260
  • 5Abiteboul S,et al. The Lorel query language for semistructured data. International Journal on Digital Libraries, 1997, 1 (1): 68~88
  • 6McHugh J, et al. Lore: A database management system for semistructured data. SIGMOD Record, 1997,26(3): 54~66
  • 7Goldman R,Widom J. DataGuides: enabling query formulation and optimization in semistructured databases. In: Proc. of Very Large Data Bases,Sep. 1997. 436~445
  • 8Buneman P, et al. Adding structure to unstructured data. In:Proc. of the Intl. Conf. on Database Theory, Deplhi, Greece,Springer Verlag, 1997. 336~350
  • 9Beeri C,Milo T. Schemas for integration and translation of structured and semi-structured data. In: Proc. of the Intl. Conf. on Database Theory, 1999
  • 10Milo T, Suciu D. Index structures for path expressions. In:Proc. of the Intl. Conf. on Database Theory, 1999

同被引文献22

  • 1叶飞跃,蒙德龙,员红娟.一种用于存储与查询半结构化数据的新方法[J].计算机工程,2006,32(19):91-93. 被引量:3
  • 2吕橙,魏楚元,张瀚韬.基于OEM模型的半结构化数据的模式发现[J].计算机工程与应用,2006,42(34):162-165. 被引量:5
  • 3Slefankis E.Modelling semi-structured geographical data[J].International Journal of Geographical Information Science,2003,17(6):517-546.
  • 4Abiteboul S.Querying Semi-structured Data[C] //Proc.of ICDT Del phi,Greece:[s,n.] ,1997.
  • 5Agrawal R, Borgida A,Jagadish H V. Efficient management of transitive relationships in large data and knowledge bases[C]// SIGMOD. 1989 : 253-262.
  • 6Jin Ruo-ming, Xiang Yang, Ruan Ning, et al. Efficiently answering reachability queries on very large directed graphs[C]///SIGMOD Conference. 2008 : 595-608.
  • 7Wang Hai-xun, He Hao, Yang Jun, et al. Dual Labeling: Answering graph teachability queries in constant time[C] //ICDE' 06. 2006:75.
  • 8Cohen E, Halperin E, Kaplan H. Reachability and distance queries via 2-Hop labels[C]//Proceedings of the 13th annual ACM- SIAM Symposium on Discrete algorithms. 2002 : 937-946.
  • 9Jagadish H V. A compression technique to materialize transitive closure[J]. ACM Trans. Database Syst. , 1990,15(4):558-598.
  • 10Kapoor S, Ramesh H. Algorithms for generating all spanning trees of undirected and weighted graphs[J]. SIAM J. Comput. , 1995,24(2).

引证文献3

二级引证文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部