Filters








11,921 Hits in 2.7 sec

Optimizing XML Compression [chapter]

Gregory Leighton, Denilson Barbosa
2009 Lecture Notes in Computer Science  
In this paper, we show that finding an optimal compression configuration with respect to compression gain is an NP-hard optimization problem.  ...  XML-conscious compression techniques seek to overcome this drawback. Many of these techniques first separate XML structure from the document content, and then compress each independently.  ...  XML Compression Permutation-based strategies for XML-conscious compression separately compress the document structure and text content.  ... 
doi:10.1007/978-3-642-03555-5_8 fatcat:j2zefjkfezeuzeoj366ofjyqgm

Optimizing XML Compression in XQueC

Andrei Arion, Angela Bonifati, Ioana Manolescu, Andrea Pugliese, Stefan Böttcher, Markus Lohrey, Sebastian Maneth, Wojcieh Rytter
2008
We present our approach to the problem of optimizing compression choices in the context of the XQueC compressed XML database system.  ...  However, different compression algorithms have different performance and support different sets of operations in the compressed domain.  ...  Conclusions In this paper we presented our approach to the problem of optimizing compression choices in the context of the XQueC compressed XML database system.  ... 
doi:10.4230/dagsemproc.08261.9 fatcat:enlqv2xnw5b3tcejn46lwkguba

MQX

Xiaoling Wang, Aoying Zhou, Juzhen He, Wilfred Ng
2007 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '07  
However, it is still not clear how to exploit the existing XML compression techniques to evaluate multi-query and optimization strategies in XML subscribe/dissemination applications [2] .  ...  Previous work has studied the techniques for efficient evaluation path expressions on original XML document [1] or single-query processing on compressed data [4] based on the different XML compression  ...  However, it is still not clear how to exploit the existing XML compression techniques to evaluate multi-query and optimization strategies in XML subscribe/dissemination applications [2] .  ... 
doi:10.1145/1277741.1277965 dblp:conf/sigir/WangZHN07 fatcat:dkjij6acszb7lbvj4ifz6reknm

XQueC [chapter]

Andrei Arion, Sandra D'Aguanno, Ioana Manolescu, Angela Bonifati, Gianni Costa, Andrea Pugliese
2003 Proceedings 2003 VLDB Conference  
Evaluating XML queries over compressed data The XQueC Query Processor consists of a query parser, which is standard, an optimizer and evaluator.  ...  The XMill project [7] proposed an XML-specific compression method: it compresses the structure (XML tags) separately from the content (data nodes, leaves of the XML tree), which is squeezed into a set  ... 
doi:10.1016/b978-012722442-8/50106-3 dblp:conf/vldb/ArionBCDMP03 fatcat:kdbvay5a5fbmfd5lsrt6pnn7py

Tailor-Made Native XML Storage Structures

Karsten Schmidt, Theo Härder
2007 Symposium on Advances in Databases and Information Systems  
Automatically choosing suitable native storage structures for XML documents arriving at the XML DBMS is a challenging task for its storage manager.  ...  In this paper, we discuss approaches to achieve an adaptive behavior of the storage manager to provide tailor-made native XML storage structures to the extent possible. 1 This work has been supported by  ...  Our optimizations obtain for the compressed Model 1 and Model 2 ~1060 and ~825 MBytes, respectively.  ... 
dblp:conf/adbis/WolfH07 fatcat:lpkizta5abbvbbbmf5ysmx6vlu

Encoding and Compression for the Devices Profile for Web Services

Guido Moritz, Dirk Timmermann, Regina Stoll, Frank Golatowski
2010 2010 IEEE 24th International Conference on Advanced Information Networking and Applications Workshops  
For the first time, we also investigate on the Efficient XML Interchange (EXI) format for DPWS.  ...  We determined 18 message types in the scenario and compressed and encoded all messages by using existing schemes and tools.  ...  814,89 100,00 418,00 2089,00 1 schema-informed (optimized) / compression with Deflate 2 schema-informed (optimized) / without compression 3 schema-informed (default) / compression with Deflate  ... 
doi:10.1109/waina.2010.91 dblp:conf/aina/MoritzTSG10 fatcat:shuncmgszrf7bcq7j6iaaq7vku

Comparison of Complete and Elementless Native Storage of XML Documents

Theo Harder, Christian Mathis, Karsten Schmidt
2007 11th International Database Engineering and Applications Symposium (IDEAS 2007)  
Encoding and compression of XML documents with their complete structure leads to a space consumption of~40% tõ 60% compared to their plain representation, whereas structure virtualization (elementless  ...  In this paper, we explore a variety of options to natively store, encode, and compress XML documents thereby preserving the full DBMS processing flexibility on the documents required by the various language  ...  Complete XML Documents So far, we have outlined the essential concepts used for the optimization of native XML document storage.  ... 
doi:10.1109/ideas.2007.4318094 dblp:conf/ideas/HarderMS07 fatcat:h5wypnesgjfuxa2geyd3oend5a

Usage-driven storage structures for native XML databases

Karsten Schmidt, Theo Härder
2008 Proceedings of the 2008 international symposium on Database engineering & applications - IDEAS '08  
There are numerous and influential parameters associated with the selection of suitable native storage structures for XML documents within an XML DBMS.  ...  Such important parameters are related to node labeling, path synopsis, text compression, document container layout, and indexing.  ...  Structure Virtualization and Content Compression Two of the main issues to be regarded for XML document compression in databases result from the XML structure itself and its content.  ... 
doi:10.1145/1451940.1451964 dblp:conf/ideas/SchmidtH08 fatcat:rjca5snabbeyhg2wsxwuaxmtae

Efficient Query Evaluation over Compressed XML Data [chapter]

Andrei Arion, Angela Bonifati, Gianni Costa, Sandra D'Aguanno, Ioana Manolescu, Andrea Pugliese
2004 Lecture Notes in Computer Science  
XML suffers from the major limitation of high redundancy. Even if compression can be beneficial for XML data, however, once compressed, the data can be seldom browsed and queried in an efficient way.  ...  We shred compressed XML into suitable data structures, aiming at both reducing memory usage at query time and querying data while compressed.  ...  The implementation of an XQuery [29] optimizer for querying XML compressed data is ongoing.  ... 
doi:10.1007/978-3-540-24741-8_13 fatcat:eli6qputhrbzjl7upzdxxk2gam

XML Tree Structure Compression

Sebastian Maneth, Nikolay Mihaylov, Sherif Sakr
2008 2008 19th International Conference on Database and Expert Systems Applications  
XML compression tools such as XMill separate the tree structure from the data content and compress each separately.  ...  In contrast, the focus of this paper is on compressing the tree structure part of an XML document.  ...  In our experiments we found that even with no backend compression it is not optimal to share everything, but a threshold of 14 turned out to be optimal for our test set (using non-aligned Huffman, no-NIL  ... 
doi:10.1109/dexa.2008.41 dblp:conf/dexaw/ManethMS08 fatcat:xzahcpbgmzb7vadeby7xdokgcy

Efficient MPEG-21-based adaptation decision-taking for scalable multimedia content

Ingo Kofler, Christian Timmerer, Hermann Hellwagner, Andreas Hutter, Francesc Sanahuja, Roger Zimmermann, Carsten Griwodz
2007 Multimedia Computing and Networking 2007  
optimization step.  ...  Based on this metadata a mathematical optimization problem can be formulated and its solution yields the optimal parameters for the adaptation operations.  ...  Compression efficiency The first part of the evaluation focuses on the achievable compression ratio. Therefore, the descriptions that are initially encoded in plain text XML are compressed using BiM.  ... 
doi:10.1117/12.705847 fatcat:5hg7rxhc3febvos4lm3gv6z5jm

Xml Data Management In Compressed Relational Database

Hongzhi Wang, Jianzhong Li, Hong Gao
2008 Zenodo  
For the efficiency of storage and query XML, it is necessary to use compressed XML data in relational database.  ...  Besides traditional relational database techniques, additional query process technologies on compressed relations and for special structure for XML are presented.  ...  Considering the usage of existing query optimization and execution technologies of relational, a little improvement is done for the special feature of our compress structure for XML data.  ... 
doi:10.5281/zenodo.1079572 fatcat:yp3qt6ghbbgpvc4tsvhqx4tkme

Comparison of XML serializations: cost benefits versus complexity

Robbie De Sutter, Sam Lerouge, Peter De Neve, Christian Timmerer, Hermann Hellwagner, Rik Van de Walle
2006 Multimedia Systems  
The efficiency of the alternative serialization formats are compared to a classic plain text compression technique, in particular ZIP compression.  ...  It provides good compression efficiency, ability to (partially) update existing XML trees, and facilitates random access into, and manipulation of, the binary-encoded bit stream.  ...  Optimized implementations of the standard will probably provide a caching mechanism for analyzed XML Schemas.  ... 
doi:10.1007/s00530-006-0044-y fatcat:ldbmyb3ywrboxbhokndjcgs26e

Wireless SOAP

Naresh Apte, Keith Deutsch, Ravi Jain
2005 Special interest tracks and posters of the 14th international conference on World Wide Web - WWW '05  
We propose a set of optimization techniques, collectively called Wireless SOAP (WSOAP), to compress SOAP messages transmitted across a wireless link.  ...  The Name Space Equivalency technique rests on the observation that exact recovery of compressed messages is not required at the receiver; an equivalent form suffices.  ...  Some examples of XML inefficiencies are text-serialization of numbers, end tags, and namespaces. Several optimizations have been proposed that apply to XML in general, e.g.  ... 
doi:10.1145/1062745.1062927 dblp:conf/www/ApteDJ05 fatcat:4en4qmedbngavhywwwqjb3swb4

Query Evaluation for XML Databases using Partial Decompression

Vijay Gulhane
2013 IOSR Journal of Computer Engineering  
Proposed here are the algorithms for xml compression and Efficient Query Evaluation as -Feasible XML compression using data compression algorithm. Qurey Processor using Sax parsing and Interfaces.  ...  It is shown that using the proposed techniques for xml data compression will pave a way for better compression and improve the compression ratio and performance of compressor system  ...  CONCLUSION To make the XML compressor adaptive and efficient, it is necessary to make the algorithm adaptive and optimal.  ... 
doi:10.9790/0661-0844145 fatcat:6y3wcnvyq5chlesfwrpspam5ta
« Previous Showing results 1 — 15 out of 11,921 results