Titlebook: Web-Age Information Management. WAIM 2010 Workshops; WAIM 2010 Internatio Heng Tao Shen,Jian Pei,Jie Shao Conference proceedings 2010 Sprin

雜役

摻假

征兵

LAITY

-Hash: An Efficient Method for Approximate XML Joinsing methods suffer for low efficiency, thus do not scale to large tree sets...-gram is a widely-used method with high quality of matches. In this paper, we propose .-hash as an improvement to .-gram. As the base of .-hash, a randomized data structure, .-array, is developed. With .-array, large trees

Extemporize

詞匯

Compression Algorithms for Structural Query Results on XML Datatem, the transmission of query results become the bottleneck. For the efficiency of XML management system, the compression method for XML query results is studied in this paper. By exploiting the properties of query results on XML data, two compression methods are proposed. One is a G-bitmap algorit

好開玩笑

六個才偏離

promote

Formal Verification of Stochastic Timing Behavior in Web-Based Business Process Collaborationitable Web services at run time. In this paper, for stochastic- timing software business process collaboration based on Web services, we take into account the problem of verifying the behavioral compatibility in the cross-organizational system. We use the extended markovian process algebra to model

間接