Sciweavers

186 search results - page 4 / 38
» An analysis of XML compression efficiency
Sort
View
JDCTA
2010
151views more  JDCTA 2010»
13 years 2 months ago
Research on Querying Node Probability Method in Probabilistic XML Data Based on Possible World
In order to solve the low efficiency problem of directly querying single node probability in the set of all ordinary XML data obtained by enumerating possible world set of the cor...
Jianwei Wang, Zhongxiao Hao
ICDIM
2007
IEEE
13 years 11 months ago
Efficient XML storage based on DTM for read-oriented workloads
We propose an XML storage scheme based on Document Table Model (DTM) which expresses an XML document as a table form. When performing query processing on large scale XML data, XML...
Makoto Yui, Jun Miyazaki, Shunsuke Uemura, Hirokaz...
WWW
2005
ACM
14 years 8 months ago
An adaptive, fast, and safe XML parser based on byte sequences memorization
XML (Extensible Markup Language) processing can incur significant runtime overhead in XML-based infrastructural middleware such as Web service application servers. This paper prop...
Toshiro Takase, Hisashi Miyashita, Toyotaro Suzumu...
CORR
2007
Springer
94views Education» more  CORR 2007»
13 years 7 months ago
Pushdown Compression
The pressing need for efficient compression schemes for XML documents has recently been focused on stack computation [6, 9], and in particular calls for a formulation of informati...
Pilar Albert, Elvira Mayordomo, Philippe Moser, Sy...
DATESO
2009
146views Database» more  DATESO 2009»
13 years 5 months ago
Compression of the Stream Array Data Structure
In recent years, many approaches to XML twig pattern query (TPQ) processing have been developed. Some algorithms are supported by a stream abstract data type. s an abstract data ty...
Radim Baca, Martin Pawlas