On <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>N</mml:mi></mml:math>-differential graded algebras

Angel, Mauricio; Díaz, Rafael

doi:10.1016/j.jpaa.2006.11.009

Cited by 5 publications

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The workstation has 512MB RAM and 80GB disk drive. We used IBM XML data generator [9] to generate the data sets and used the DTD in Fig.4. The raw data size is 128MB.…”

Section: B Ancestor-descendant Structural Join Algorithmmentioning

confidence: 99%

Bitmap Based Partition in Structural Join of XML

2010

2010 Fifth Annual ChinaGrid Conference

View full text Add to dashboard Cite

XML numbering scheme was analyzed. The advantages and disadvantages of RangePartitionJoin algorithm were analyzed. According to the feature of structural join, Bitmap based partition method was proposed. The determination method of partition boundaries was expounded.The corresponding structural join algorithms --Parent-Child structural join algorithm and Ancestor-Descendant structural join algorithm were presented. In order to test the performance of the algorithms, the experiments were design. The experiment result showed that proposed algorithms are effective

show abstract

“…The workstation has 512MB RAM and 80GB disk drive. We used IBM XML data generator [9] to generate the data sets and used the DTD in Fig.4. The raw data size is 128MB.…”

Section: B Ancestor-descendant Structural Join Algorithmmentioning

confidence: 99%

Bitmap Based Partition in Structural Join of XML

2010

2010 Fifth Annual ChinaGrid Conference

View full text Add to dashboard Cite

show abstract

“…数据准备:本文的数据采用 XMill 的测试数据,目前测试了 4 种数据,包括 SwissProt 数据 [7] (112.1M),NASA 数据集合 [8] (24.4M),TreeBank_E [9] 数据集合(84M)3 种真实数据,以及利用 IBM 的 XML 数据产生器基于 NASA 的 DTD 产生的模拟数据(137M) [10] .测试运行在 Dell Optiplex 商用计算机,操作系统为 Windows 2000,内存 512M,…”

Section: 环境构建unclassified

XPath Evaluation Oriented XML Data Stream Compression

WANG¹

2005

Journal of Software

View full text Add to dashboard Cite

Because XML (extensible markup language) is self-described, there is much redundant structural information in XML data stream. How to compress XML data so as to reduce the network transfer cost and support XPath evaluation on the compressed data is a new area of research. The existing methods on XML compression require the multi-pass scan on data or can not support real time query processing on compressed data. In this paper, a novel compression method XSC (XML stream compression) is proposed to compress and decompress XML stream in real time. XSC constructs XML element event sequence dictionary and outputs the related index dynamically. When DTD is available, XSC can generate the XML element event sequence graph for producing more reasonable encoding before XML data stream is processed. The compressed XML data stream can be decomposed directly for XPath evaluation. Experimental results show that XSC outperforms other methods in compression ratio and compression efficiency, and the cost of XPath evaluation on compressed data stream is acceptable.

show abstract

“…Shipley [8] have investigated the relationship between DG algebras and topological ring spectra. M. Angel and R. Dlaz [4] have introduced N-DG algebras (abbreviated as N-dga), and they have studied the module space of deformations of the differential of an N-differential graded algebra. J. Jardine [9] has constructed a closed model structure for the category of noncommutative DG algebra can be found in [3], [5], [6], and [12].…”

Section: Introductionmentioning

confidence: 99%