A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Filters
XQueC
[chapter]
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 XQueC system adheres to the following approach: (I) XQueC takes advantage of the XMill principle of compressing separately data and structure for efficiently querying compressed data. ...
doi:10.1016/b978-012722442-8/50106-3
dblp:conf/vldb/ArionBCDMP03
fatcat:kdbvay5a5fbmfd5lsrt6pnn7py
XQzip: Querying Compressed XML Using Structural Indexing
[chapter]
2004
Lecture Notes in Computer Science
More recently, some compressors have been proposed to query compressed XML data. ...
Although many effective XML compressors, such as XMill, have been recently proposed to solve this data inflation problem, they do not address the problem of running queries on compressed XML data. ...
Thirdly, XQzip utilizes the index to query the compressed XML data. ...
doi:10.1007/978-3-540-24741-8_14
fatcat:m3xpzndl2vcsncdozlan2zyque
A compressor for effective archiving, retrieval, and updating of XML documents
2006
ACM Transactions on Internet Technology
Some XML compressors do not support querying compressed data, while other XML compressors which support querying compressed data blindly encode tags and data values using predefined encoding methods. ...
To overcome the verbosity problem, the research on compressors for XML data has been conducted. ...
Therefore, the reconstruction is needed for XQueC to transmit the compressed XML data through the network. ...
doi:10.1145/1151087.1151088
fatcat:zfr3bcalozfg7fj5tow4uvec4a
Path summaries and path partitioning in modern XML databases
2006
Proceedings of the 15th international conference on World Wide Web - WWW '06
This model improves the efficiency of twig query processing up to two orders of magnitude over the similar A. Arion · I. Manolescu ...
We combine the principle of path partitioning with the presence of structural identifiers in a simple path-partitioned storage model, which allows for selective data access and efficient query plans. ...
Acknowledgements The authors are grateful to Christoph Koch for providing us with his XML compressor code [14] , and to Pierre Senellart for sharing with us his query unfolding application. ...
doi:10.1145/1135777.1136023
dblp:conf/www/ArionBMP06
fatcat:veluiuw64rglpbkgxc2rpgyboy
Path Summaries and Path Partitioning in Modern XML Databases
2007
World wide web (Bussum)
This model improves the efficiency of twig query processing up to two orders of magnitude over the similar A. Arion · I. Manolescu ...
We combine the principle of path partitioning with the presence of structural identifiers in a simple path-partitioned storage model, which allows for selective data access and efficient query plans. ...
Acknowledgements The authors are grateful to Christoph Koch for providing us with his XML compressor code [14] , and to Pierre Senellart for sharing with us his query unfolding application. ...
doi:10.1007/s11280-007-0036-7
fatcat:ho5cgc7zn5ayzesvomjs3rssry
Path Summaries and Path Partitioning in Modern XML Databases
[article]
2006
arXiv
pre-print
We study the applicability of XML path summaries in the context of current-day XML databases. ...
We find that summaries provide an excellent basis for optimizing data access methods, which furthermore mixes very well with path-partitioned stores. ...
Acknowledgements The authors are grateful to Christoph Koch for providing us with his XML compressor code [12] , and to Pierre Senellart for sharing with us his query unfolding application. ...
arXiv:cs/0602039v1
fatcat:zh4q7qyfkfcd3loiejop7lqmh4
Strategy List-An Efficient Querying Structure for RFX Compact Storage
2017
International Journal of Scientific Research in Computer Science, Engineering and Information Technology © 2017 IJSRCSEIT
unpublished
The rapid growth of XML repositories has provided the intention to design and develop systems that can store and query the XML data efficiently. ...
Many researchers are working to compactly store XML document in main memory and query the same. ...
XQueC: Pushing Queries to Compressed XML Data. In (Demo) Proceedings of VLDB, 2003. [2]. M. Brantner, S. Helmer, C-C. Kanne and G. Moerkotte. ...
fatcat:5buuxjm35fesdfjdvm63w234uu
Data Management for Mobile Ajax Web 2.0 Applications
[chapter]
Lecture Notes in Computer Science
We propose to use an XML compression technique that compresses an XML document to a binary directed acyclic graph (DAG) and to use DAG-based DOM evaluation on the client side. ...
Whenever Ajax applications on mobile devices have to retrieve large XML data fragments from a remote server, a reduction of the exchanged data volume may be crucial to manage limited bandwidth and limited ...
According to [5] , the DAG also allows a more efficient search and query evaluation as could be provided on the original XML data, even for large repositories of data. ...
doi:10.1007/978-3-540-74469-6_42
fatcat:qmhvupsmkrbhlj55veeuahsypq