Sciweavers

327 search results - page 6 / 66
» XML Tree Structure Compression
Sort
View
ICPR
2008
IEEE
14 years 1 months ago
Tree-structure lossless coding using intervector angle
In this paper, we propose tree structure lossless coding, by which compression data are arranged in a tree structure. Current compression methods show improved performance by prod...
Jun Rokui
ADBIS
2007
Springer
119views Database» more  ADBIS 2007»
14 years 27 days ago
Combining Efficient XML Compression with Query Processing
This paper describes a new XML compression scheme that offers both high compression ratios and short query response time. Its core is a fully reversible transform featuring substit...
Przemyslaw Skibinski, Jakub Swacha
DASFAA
2007
IEEE
141views Database» more  DASFAA 2007»
13 years 10 months ago
An Efficient Index Lattice for XML Query Evaluation
Abstract. We have defined an XML structural index called the Structure Index Tree (SIT), which eliminates duplicate structures arising from the equivalent subtrees in an XML docume...
Wilfred Ng, James Cheng
IS
2006
13 years 6 months ago
A methodology for clustering XML documents by structure
The processing and management of XML data are popular research issues. However, operations based on the structure of XML data have not received strong attention. These operations ...
Theodore Dalamagas, Tao Cheng, Klaas-Jan Winkel, T...
CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
14 years 3 days ago
A Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...