Sciweavers

327 search results - page 9 / 66
» XML Tree Structure Compression
Sort
View
ICIP
1999
IEEE
13 years 11 months ago
On the Use of Context Tree for Binary Image Compression
We consider the use of a static context tree for binary image compression. The contexts are stored in the leaves of a variable-depth binary tree. The tree structure itself is full...
Pasi Fränti, Eugene I. Ageenko
IDEAS
2007
IEEE
146views Database» more  IDEAS 2007»
14 years 1 months ago
Approximate Structural Matching over Ordered XML Documents
There is an increasing need for an XML query engine that not only searches for exact matches to a query but also returns “query-like” structures. We have designed and develope...
Nitin Agarwal, Magdiel Galan Oliveras, Yi Chen
JSS
2008
139views more  JSS 2008»
13 years 6 months ago
Dynamic interval-based labeling scheme for efficient XML query and update processing
XML data can be represented by a tree or graph structure and XML query processing requires the information of structural relationships among nodes. The basic structural relationsh...
Jung-Hee Yun, Chin-Wan Chung
DATESO
2009
146views Database» more  DATESO 2009»
13 years 4 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
DASFAA
2006
IEEE
135views Database» more  DASFAA 2006»
13 years 10 months ago
An Efficient Co-operative Framework for Multi-query Processing over Compressed XML Data
XML is a de-facto standard for exchanging and presenting information on the Web. However, XML data is also recognized as verbose since it heavily inflates the size of the data due ...
Juzhen He, Wilfred Ng, Xiaoling Wang, Aoying Zhou